Miracle-dz/UniFAR-FTUs huggingface dataset:
Evolution of the vorticity-area density during the formation of coherent structures in two-dimensional flows

It is shown: (1) that in two-dimensional, incompressible, viscous flows the vorticity-area distribution evolves according to an advection-diffusion equation with a negative, time dependent diffusion coefficient and (2) how to use the vorticity-stream function relations, i.e., the so-called scatter-plots, of the quasi-stationary coherent structures in order to quantify the experimentally observed changes of the vorticity distribution moments leading to the formation of these structures.
A Compact Differential Inductor with Improved Self-Resonance Frequency

An original multi-layer structure is proposed for the realization of monolithic differential inductors. Compared with standard differential topologies of equal inductance, it can reduce the area occupation by more than 50% and increase the self-resonance frequency fSR up to 30%. However, because of the high resistivity of the lower metal layers, the quality factor Q decreases by 25−40% and makes this inductor mainly interesting for applications like chokes. The higher fSR is obtained through an optimized sequencing of wires. In fact, a second stacked differential inductor without wiring optimization gives no benefits in fSR, but only in area reduction, and shows the importance of a proper layout. The novel structure was fabricated in a silicon-germanium technology; measurements report fSR = 5.66 GHz for a 14-nH inductance. An analytical model for singleand multi-layer differential inductors is also introduced. The model is in good agreement with experimental results, with a 5% error in fSR and a 6% error in inductance.
Preferences extraction and ranking functions in mobile search

This paper preferences extraction and ranking functions in mobile search that captures the users' preferences in the form of concepts by mining their click through data. Due to the importance of location information in mobile search, it classifies these concepts into content concepts and location concepts. In addition, users' locations (positioned by GPS) are used to supplement the location concepts. The user preferences are organized in an ontology-based, multi-facet user profile, which are used to adapt a personalized ranking function for rank adaptation of future search results. To characterize the diversity of the concepts associated with a query and their relevance's to the users need, four entropies are introduced to balance the weights between the content and location facets. Based on the client-server model, also present a detailed architecture and design for implementation of preferences extraction and ranking functions in mobile search. In our design, the client collects and stores locally the click through data to protect privacy, whereas heavy tasks such as concept extraction, training and re-ranking are performed at the server. Moreover, here address the privacy issue by restricting the information in the user profile exposed to the server with two privacy parameters. To prototype preferences extraction and ranking functions in mobile search on the Google Android platform.
Multiuser rate-based flow control

Flow and congestion control allow the users of a telecommunication network to regulate the traffic that they send into the network in accordance with the quality of service that they require. Flow control may be performed by the network, as is the case in asynchronous transfer mode (ATM) networks (the available bit rate (ABR) transfer capacity), or by the users themselves, as is the case in the Internet [transmission control protocol/Internet protocol (TCP/IP)]. We study both situations using optimal control and dynamic game techniques. The first situation leads to the formulation of a dynamic team problem, while the second one leads to a dynamic noncooperative game, for which we establish the existence and uniqueness of a linear Nash equilibrium and obtain a characterization of the corresponding equilibrium policies along with the performance costs. We further show that when the users update their policies in a greedy manner, not knowing a priori the utilities of the other players, the sequence of policies thus generated converges to the Nash equilibrium. Finally, we study an extension of the model that accommodates multiple traffic types for each user, with the switching from one type of traffic to another being governed by a Markov jump process. Presentation of some numerical results complements this study.
Deciding When and How to Learn

Learning is an important aspect of intelligent behavior. Unfortunately, learning rarely comes for free. Techniques developed by machine learning can improve the abilities of an agent but they often entail considerable computational expense. Furthermore, there is an inherent tradeoff between the power and efficiency of learning. More powerful learning approaches require greater computational resources. This poses a dilemmato a learning agent that must act in the world under a variety of resource constraints. This paper investigates the issues involved in constructing a rational learning agent. Drawing on work in decision-theory we describe a framework for a rational agent that embodies learning actionsthat canmodify its own behavior. The agent must posses deliberative capabilities to assess the relative merits of these actions in the larger context of its overall behavior and resource constraints. We then sketch several algorithms that have been developed within this framework.
The ‘Long March’ of the Management Modernizers: Ritual, Rhetoric and Rationality

This article deals with a transition process from a professional engineering archetype to a modernizing managerialist archetype in a British electricity utility. This took place in the context of the substantially changing utility sector characterized by privatization, the introduction of efficiency targets, the introduction of a regulatory system, the prospect of mergers and predatory takeovers. The high-flying rhetoric of modernizing managerialists needs to be seen in the context of institutional templates, which carried substantial mimetic legitimacy, in particular programmes such as total quality management, teamworking and job redesign. They provided a basis to displace entrenched engineering rituals, and establish a new ‘dominant rhetoric’. One reading ascribes such projects as striving towards objectified and technocratic organizational improvements - the modernizers’ rhetoric. An alternative reading is one that problematizes such an understanding by instead drawing attention to the largely ceremonial and rhetoric intensive nature of modernizing managerialism - the critics’ rhetoric. A third perspective is provided by engineers who were fighting a largely rearguard action, as professional expectations emphasizing engineering safety were gradually losing force, but remained in sedimented form. The rhetoric intensive practice of talking ‘spin’ and engaging in elaborate rituals may well, whether in political or in organizational life, lead to critical, and sometimes cynical responses. In this article we highlight the way in which the scripts of ceremonialism, reformism and cynicism have played out among managerial and professional groups in the organization.
Visual Performance in Multidimensional Data Characterisation with Scatterplots and Parallel Coordinates

We present a study on the visual assessment of relative data point distances in Parallel coordinate systems and scatterpiots in Cartesian coordinate systems Specifically, we assess the impact of coordinate system type, dimension, and relative point distance deviation. We performed an online pilot experiment with 100 participants using Amazon's MechanicalTurk. The experiment design and methodology are presented in detail and results indicate that there may indeed be a difference in human performance when visually assessing distances in the considered coordinate systems. We argue that further investigations are needed to draw stronger conclusions. These should consider inclusion of other factors into the experiment design, such as the relative angle between data points that is expected to have a significant impact on the outcomes.
1 Implicit Terrains : Meaning , Measurement , and Spatial Metaphors in Organizational

INTRODUCTION Meaning, Measurement, and Markets The interpretation of meaning is a critical problem for the study of markets and industries for two reasons. First, in a fundamental sense that I hope to make clear in this chapter, to understand and to explain the processes that drive markets and industries requires that we interpret the meanings that are in play there because meanings are embodied in social actions (and thus in social structures). But the pursuit of those meanings quickly leads us into unfamiliar terrain and thus into a second kind of problem. Meanings are notoriously difficult to manage within the frameworks of quantitative social science. Ethnographic field researchers can tell us a great deal about the “webs of significance” that are spun by their informants but those of us who study markets and industries from a less intimate vantage point are in a quandary. We can either approach meanings indirectly, relying on something rather like peripheral vision (this is mostly what we do now), or we can resolve to change how we study markets and industries. In this chapter I argue for a change. I will not suggest that we all become ethnographers (though the idea has some merit) but that we shift our approach to collecting and analyzing empirical data in such a way as to put meaning at the center of our investigations. Doing so will significantly increase our ability to understand and explain markets and industries as types of institutional systems. The question before us—and it is the question that this chapter takes up directly—is why we don’t do this already? The obstacles in our path are not
FIXED-B ASYMPTOTICS FOR THE STUDENTIZED MEAN FROM TIME SERIES WITH SHORT, LONG, OR NEGATIVE MEMORY

This paper considers the problem of variance estimation for the sample mean in the context of long memory and negative memory time series dynamics, adopting the fixed-bandwidth approach now popular in the econometrics literature. The distribution theory generalizes the short memory results of Kiefer and Vogelsang (2005, Econometric Theory 21, 1130–1164). In particular, our results highlight the dependence on the kernel (we include flat-top kernels), whether or not the kernel is nonzero at the boundary, and, most important, whether or not the process is short memory. Simulation studies support the importance of accounting for memory in the construction of confidence intervals for the mean.
Data Flow Analysis of Software Executed by Unreliable Hardware

The data flow is a crucial part of software execution in recent applications. It depends on the concrete implementation of the realized algorithm and it influences the correctness of a result in case of hardware faults during the calculation. In logical circuits, like arithmetic operations in a processor system, arbitrary faults become a more tremendous aspect in future. With modern manufacturing processes, the probability of such faults will increase and the result of a software's data flow will be more vulnerable. This paper shows a principle evaluation method for the reliability of a software's data flow with arbitrary soft errors also with the concept of fault compensation. This evaluation is discussed by means of a simple example based on an addition.
The design and implementation of an approach to publish and discover Semantic Web Services

Although WSDL and UDDI are widely accepted as standards for web service discovery, they can not guarantee scalable, flexible and automatic service discovery. Therefore, Semantic Web Services (SWS) is proposed to ensure high-quality service discovery. However, an effective and dedicated semantic registry for SWS discovery is still desired. Accordingly, in the paper we propose an approach and implement it for SWS publication and discovery. First, we discuss the basic idea of the approach. Next, present the architecture and operation principle of a SWS registry based on the approach. Then, we simply discuss its implementation and testing work. Finally, point out the highlighted merits of the approach. In fact, through analysis and a large number of experiments, the approach proves to be a simple and effective method to publish and discover SWS.
Spatial and Temporal Characteristics of Normal and Perturbed Vesicle Transport

Efficient intracellular transport is essential for healthy cellular function and structural integrity, and problems in this pathway can lead to neuronal cell death and disease. To spatially and temporally evaluate how transport defects are initiated, we adapted a primary neuronal culture system from Drosophila larval brains to visualize the movement dynamics of several cargos/organelles along a 90 micron axonal neurite over time. All six vesicles/organelles imaged showed robust bi-directional motility at both day 1 and day 2. Reduction of motor proteins decreased the movement of vesicles/organelles with increased numbers of neurite blocks. Neuronal growth was also perturbed with reduction of motor proteins. Strikingly, we found that all blockages were not fixed, permanent blocks that impeded transport of vesicles as previously thought, but that some blocks were dynamic clusters of vesicles that resolved over time. Taken together, our findings suggest that non-resolving blocks may likely initiate deleterious pathways leading to death and degeneration, while resolving blocks may be benign. Therefore evaluating the spatial and temporal characteristics of vesicle transport has important implications for our understanding of how transport defects can affect other pathways to initiate death and degeneration.
Control of Tele-Operation Systems Subject to Capacity Limited Channels and Uncertainty

This paper is concerned with asymptotic observability and stabilizability of dynamical systems over communication channels subject to limited transmission capacity constraint and uncertainty. In particular, the following control/communication systems are considered. 1) The control/communication system described by a controlled diffusion process over an additive white Gaussian noise (AWGN) flat fading channel subject to limited transmission capacity constraint, in which, the sensors are geographically separated from the plant while the controller is attached to the plant, and 2) The control/communication system described by an uncertain plant over uncertain communication channels subject to limited transmission capacity constraint, in which, there is communication constraint in both forward and feedback paths
Two-Phase Activity Recognition with Smartphone Sensors

The smartphone has become very popular and it is very useful in our daily life. A smartphone is equipped with a variety of sensors, which makes it very suitable in replacing other types of wearable sensors for activity recognition of the user. Many researches have been carried out with this subject. However, most of them have to confine the smartphone to a certain position or even orientation. For example, the smartphone might need to be placed in the front pocket of pants to make the right recognition. In this research, we hope to relieve this limitation and to develop a smartphone APP for activity recognition. Activity recognition can be done in two phases. In the first phase, gyroscope data are used to decide the position of the smartphone by the Support Vector Machine (SVM). It could be of three categories: (1) front pockets of pants, (2) back pockets of pants, and (3) shirt pockets or bags. Different classifiers are used for smartphone with different position categories. SVMs are trained for different position categories using accelerometer data. Each of them can recognize activities of walk, run, up-stairs and down-stairs. The developed APP can recognize activities of the smartphone user in real time and accumulate the times for different activities. The user can check the results through the APP at any time.
A Novel Three-Dimensional Localization Algorithm in Wireless Sensor Networks

Location is crucial to wireless sensor network monitoring. Therefore, node localization becomes a key technology. After analyzing DV-Hop propagation algorithm and ABC algorithm, this paper proposes a novel three-dimensional localization approach, which is called DHA (DV-hop and ABC) localization algorithm. It introduces the idea of DHA algorithm in detail, and finally implements the algorithm on WSN test bed. By analyzing the experimental results, the accuracy is accepted with the new localization approach.
Raised Soluble P-Selectin Moderately Accelerates Atherosclerotic Plaque Progression

Soluble P-selectin (sP-selectin), a biomarker of inflammatory related pathologies including cardiovascular and peripheral vascular diseases, also has pro-atherosclerotic effects including the ability to increase leukocyte recruitment and modulate thrombotic responses in vivo. The current study explores its role in progressing atherosclerotic plaque disease. Apoe −/− mice placed on a high fat diet (HFD) were given daily injections of recombinant dimeric murine P-selectin (22.5 µg/kg/day) for 8 or 16 weeks. Saline or sE-selectin injections were used as negative controls. In order to assess the role of sP-selectin on atherothrombosis an experimental plaque remodelling murine model, with sm22α-hDTR Apoe−/− mice on a HFD in conjunction with delivery of diphtheria toxin to induce targeted vascular smooth muscle apoptosis, was used. These mice were similarly given daily injections of sP-selectin for 8 or 16 weeks. While plaque mass and aortic lipid content did not change with sP-selectin treatment in Apoe−/− or SM22α-hDTR Apoe−/− mice on HFD, increased plasma MCP-1 and a higher plaque CD45 content in Apoe −/− HFD mice was observed. As well, a significant shift towards a more unstable plaque phenotype in the SM22α-hDTR Apoe−/− HFD mice, with increased macrophage accumulation and lower collagen content, leading to a lower plaque stability index, was observed. These results demonstrate that chronically raised sP-selectin favours progression of an unstable atherosclerotic plaque phenotype.
A Multi-Armed Bandit Problem-Based Target Coverage Protocol for Wireless Sensor Network

Wireless sensor networks consist of tiny sensors with some constraints particularly when the energy is concerned. In recent years, owing to their vast applications, sensor networks are devoted a great part of researches aiming at enhancing the network lifetime. Since there are a large number of nodes available in the environment of the network, one important factor reaching this aim will be to activate the minimum number of nodes to provide a secure coverage of the targets under surveillance. By so doing, the energy consumption among the nodes of the network is optimized. In this paper, we have presented a Multi-Armed Bandit Problem-Based Target Coverage Protocol, called MABTC, for Wireless Sensor Networks, which endeavors to recognize nodes which are higher in energy amount yet are more effective in the coverage of the targets of the network and sustain the coverage in a way that the energy consumption of the nodes is balanced and optimized. To assess, the proposed protocol is simulated using NS2 and the results are compared to those of some outstanding methods in the network coverage.
An efficient approach for mining frequent item sets with transaction deletion operation

Deletion of transactions in databases is common in real-world applications. Developing an efficient and effective mining algorithm to maintain discovered information is thus quite important in data mining fields. A lot of algorithms have been proposed in recent years, and the best of them is the pre-large-tree-based algorithm. However, this algorithm only rebuilds the final pre-large tree every deleted transactions. After that, the FP-growth algorithm is applied for mining all frequent item sets. The pre-large-tree-based approach requires twice the computation time needed for a single procedure. In this paper, we present an incremental mining algorithm to solve above issues. An itemset tidset-tree structure will be used to maintain large and pre-large item sets. The proposed algorithm only processes deleted transactions for updating some nodes in this tree, and all frequent item sets are directly derived from the tree traversal process. Experimental results show that the proposed algorithm has good performance.
Device and circuit performance issues with deeply scaled high-K MOS transistors

In this paper we look at the effect of Fringe-Enhanced-Barrier-lowering (FEBL) for high-K dielectric MOSFETs and the dependence of FEBL on various technological parameters (spacer dielectrics, overlap length, dielectric stack, S/D junction depth and dielectric thickness). We show that FEBL needs to be contained in order to maintain the performance advantage with scaled high-K dielectric MOSFETs. The degradation in high-K dielectric MOSFETs is also identified as due to the additional coupling between the drain-to-source that occurs through the gate insulator, when the gate dielectric constant is significantly higher than the silicon dielectric constant. The technology parameters required to minimize the coupling through the high-K dielectric are identified. It is also shown that gate dielectric stack with a low-K material as bottom layer (very thin SiO 2 or oxy-nitride) will be helpful in minimizing FEBL. The circuit performance issues with high-K MOS transistors are also analyzed in this paper. An optimum range of values for the dielectric constant has been identified from the delay and the energy dissipation point of view. The dependence of the optimum K for different technology generations has been discussed. Circuit models for the parasitic capacitances in high-K transistors, by incorporating the fringing effects, have been presented.