Miracle-dz/UniFAR-FTUs huggingface dataset:
Characteristics of a vehicular network

If the full range of applications and protocols that exploit vehicular networks are going to be adopted then it is key to understand the performance characteristics of these networks: both the spatial and temporal properties. Many of the applications, services and protocols that could drive deployment of vehicular networking can only be developed if we understand the properties of the network that will be created. Yet, to really understand these properties we need studies of large-scale vehicle traffic traces, which are difficult to obtain. To date, most studies have used traces of small street or freeway sections, or the traces have been generated using unrealistic mobility models. To address this issue we present an extensive analysis of a mobility trace generated by Los Alamos National Laboratory for Portland, Oregon. It is generated using the TRANSIMS micro-traffic simulator, combined with macrolevel traffic information gathered in the city from censuses and studies over a year. Hence, this trace is far more accurate than previously studied synthetic traces. We analyze it to identify and characterize the key properties starting from the characteristics of the vehicle movement. We then explore the properties of the network that would be formed, considering different radio ranges and penetration rates. Finally, we then evaluate how these impact the design space for algorithms that use either one-to-many or one-to-one communication patterns.
Virtual machines jailed: virtualization in systems with small trusted computing bases

The trusted computing base of legacy applications can be reduced significantly by separating their security-critical parts into dedicated protection domains. As yet, paravirtualization has been used to host the non-secure portion. The applicability of this approach is limited by the need of source code access. We show how to implement efficient virtual machines in a microkernel-based system enabling the reuse of arbitrary operating systems. We found that the performance is on par with other virtual machine implementations, while security-sensitive applications retain their small trusted computing base. In fact, the kernel growth is marginal (500 SLOC), other security-critical components are not affected.
Computational refining of a Russian-language taxonomy using Wikipedia

A two-step approach to devising a hierarchical taxonomy of a domain is outlined. As the first step, a coarse “high-rank” taxonomy frame is built manually using the materials of the government and other representative sites. As the second step, the frame is refined topic-by-topic using the Russian Wikipedia category tree and articles filtered of “noise”. A topic-to-text similarity score, based on annotated suffix trees, is used throughout. The method consists of three main stages: 1) clearing Wikipedia data of noise, such as irrelevant articles and categories; 2) refining the taxonomy frame with the remaining relevant Wikipedia categories and articles; 3) extracting key words and phrases from Wikipedia articles. Also, a set of so-called descriptors is assigned to every leaf; these are phrases explaining aspects of the leaf topic. In contrast to many existing taxonomies, our resulting taxonomy is balanced so that all the branches are of similar depths and similar numbers of leaves. The method is illustrated by its application to a mathematics domain, “Probability theory and mathematical statistics”.
Analysis of the Murine Immune Response to Pulmonary Delivery of Precisely Fabricated Nano- and Microscale Particles

Nanomedicine has the potential to transform clinical care in the 21st century. However, a precise understanding of how nanomaterial design parameters such as size, shape and composition affect the mammalian immune system is a prerequisite for the realization of nanomedicine's translational promise. Herein, we make use of the recently developed Particle Replication in Non-wetting Template (PRINT) fabrication process to precisely fabricate particles across and the nano- and micro-scale with defined shapes and compositions to address the role of particle design parameters on the murine innate immune response in both in vitro and in vivo settings. We find that particles composed of either the biodegradable polymer poly(lactic-co-glycolic acid) (PLGA) or the biocompatible polymer polyethylene glycol (PEG) do not cause release of pro-inflammatory cytokines nor inflammasome activation in bone marrow-derived macrophages. When instilled into the lungs of mice, particle composition and size can augment the number and type of innate immune cells recruited to the lungs without triggering inflammatory responses as assayed by cytokine release and histopathology. Smaller particles (80×320 nm) are more readily taken up in vivo by monocytes and macrophages than larger particles (6 µm diameter), yet particles of all tested sizes remained in the lungs for up to 7 days without clearance or triggering of host immunity. These results suggest rational design of nanoparticle physical parameters can be used for sustained and localized delivery of therapeutics to the lungs.
AN INFORMATION QUALITY FACTOR DEVELOPMENT AND ANALYSIS

One of the most important issues in information technology (IT) and Information Systems (IS) is the quality of information that organizations are using in their daily transactions, decision-making, and development of strategic advantage. Unfortunately, it is an area that has been lightly studied in terms specific to information technology. Our research questions explore information quality and its influence on modern organizations. Our study first develops an overall measure of information quality as determined by how information integrity, information maturity, and information consistency are viewed by CFOs (Chief Financial Officers) from 481 US and other countries. Through exploratory factor analysis, this one information quality (IQ) factor is used as a measure of an organization’s overall quality perception. Our study then explored and found that IQ varied by size of the company with larger companies having higher IQ. Industry type had no effect. Broad based secondary survey data from large sample of financial executives were used to explore these questions via a variety of statistical methods. Overall and specific effects are reviewed and summarized.
A comprehensive overview of Vehicular Ad hoc Network evaluation alternatives

Vehicular Ad Hoc Networks (VANETs) is attracting a growing attention from both research and industry, due to the important range of applications raised by VANETs, from road safety to traffic control, up to travel and comfort entertainment. Because of their particular characteristics, VANETs require the definition of specific networking techniques whose performance and feasibility need to be evaluated via an appropriate realistic evaluation method. In this paper, we present a practical taxonomy of evaluation techniques, outlining the evaluation alternatives used in the literature. This classification follows a comparative approach, describing the pros and cons of each one. Our ultimate aim is to allow the selection of a suitable tool regarding the designer specific needs to perform the evaluation.
Detecting capability evaluate of spider detection techniques

Spider is a program for harvesting internet resources. In order to regulate and monitor accessing behavior of spiders, many Spiders Detection Techniques (SDT) are proposed based on Decision Tree and Bayesian Network etc. At present, the evaluation of these detection techniques mainly rely on manual analysis of web log data. In order to objectively and accurately evaluate the detecting capability of SDT, an Evaluation Method based on Trap technique (EMT) is proposed in this paper. The principles of EMT base on the statistical hypothesis that the users captured by trap obeying binomial distribution theory. The traps layout information and users accessing information are used to calculate evaluating indicators. The evaluating result of experiment indicates that EMT has an accurate and scientific conclusion.
Coordinated control of power system stabilizer and FACTS devices for dynamic performance enhancement — State of art

There are two types of oscillation damping controller in power system which are power system stabilizer (PSS) and flexible ac transmission systems (FACTS). Numerous works have been carried out on the damping of power system low frequency oscillations. This paper addresses an extensive literature review on coordination problem in single-machine and multi-machine power system. It also reviews various types of FACTS controllers. Various methods are proposed in order to enhance the dynamic performance of a power system for coordinated control between FACTS and PSS controller in power system models.
Parallel fully coupled Schwarz preconditioners for saddle point problems.

We study some parallel overlapping Schwarz preconditioners for solving Stokes-like problems arising from ﬁnite element discretization of incompressible ﬂow problems. Most of the existing methods are based on the splitting of the velocity and pressure variables. With the splitting, fast solution methods are often constructed using various fast Poisson solvers for one of the variables. More recently, several papers have investigated the so-called fully coupled approaches in which the variables are not separated. The fully coupled approach has some advantages over the variable splitting method when solving Stokes-like equations with many variables, where a good splitting may be hard to obtain. In this paper we systematically study the parallel scalability of several versions of the fully coupled Schwarz method for both symmetric and nonsymmetric Stokes-like problems. We show numerically that the performance of a two-level method with a multiplicative iterative coarse solver is superior to the other variants of Schwarz preconditioners.
The Relevance of Testing the Efficacy of Anti-Angiogenesis Treatments on Cells Derived from Primary Tumors: A New Method for the Personalized Treatment of Renal Cell Carcinoma

Despite the numerous available drugs, the most appropriate treatments for patients affected by common or rare renal cell carcinomas (RCC), like those associated with the Xp11.2 translocation/transcription factor for immunoglobulin heavy-chain enhancer 3 (TFE3) gene fusion (TFE3 RCC), are not clearly defined. We aimed to make a parallel between the sensitivity to targeted therapies on living patients and on cells derived from the initial tumor. Three patients diagnosed with a metastatic RCC (one clear cell RCC [ccRCC], two TFE3 RCC) were treated with anti-angiogenesis drugs. The concentrations of the different drugs giving 50% inhibition of cell proliferation (IC50) were determined with the Thiazolyl Blue Tetrazolium Bromide (MTT) assay on cells from the primary tumors and a reference sensitive RCC cell line (786-O). We considered the cells to be sensitive if the IC50 was lower or equal to that in 786-O cells, and insensitive if the IC50 was higher to that in 786-O cells (IC 50 of 6±1 µM for sunitinib, 10±1 µM for everolimus and 6±1 µM for sorafenib). Based on this standard, the response in patients and in cells was equivalent. The efficacy of anti-angiogenesis therapies was also tested in cells obtained from five patients with non-metastatic ccRCC, and untreated as recommended by clinical practice in order to determine the best treatment in case of progression toward a metastatic grade. In vitro experiments may represent a method for evaluating the best first-line treatment for personalized management of ccRCC during the period following surgery.
GPU Performance and Power Tuning Using Regression Trees

GPU performance and power tuning is difficult, requiring extensive user expertise and time-consuming trial and error. To accelerate design tuning, statistical design space exploration methods have been proposed. This article presents Starchart, a novel design space partitioning tool that uses regression trees to approach GPU tuning problems. Improving on prior work, Starchart offers more automation in identifying key design trade-offs and models design subspaces with distinctly different behaviors. Starchart achieves good model accuracy using very few random samples: less than 0.3% of a given design space; iterative sampling can more quickly target subspaces of interest.
Data De-anonymization : From Mobility Traces to On-line Social Networks

When people utilize social applications and services, their privacy suffers potential serious threat. In this paper, we present a novel, robust, and effective de-anonymization attack to mobility trace data and social data. First, we design a Unified Similarity (US) measurement which takes account of local and global structural characteristics of data, information obtained from auxiliary data, and knowledge inherited from on-going de-anonymization results. By analyzing the measurement on real data sets, we find that some data can potentially be de-anonymized accurately and the other can be de-anonymized in a coarse granularity. Utilizing this property, we present a US based De-Anonymization (DA) framework, which iteratively de-anonymizes data with accuracy guarantee. Then, to de-anonymize large scale data without the knowledge on the overlap size between the anonymized data and the auxiliary data, we generalize DA to an Adaptive De-Anonymization (ADA) framework. By smartly working on two core matching subgraphs, ADA achieves high de-anonymization accuracy and reduces computational overhead. Finally, we examine the presented de-anonymization attack on three well known mobility traces: St Andrews, Infocom06, and Smallblue, and three social data sets: ArnetMiner, Google+, and Facebook. The experimental results demonstrate that the presented de-anonymization framework is very effective and robust to noise. For instance, utilizing the knowledge of one seed mapping merely, 93.2% of the data in Smallblue can be successfully de-anonymized; utilizing the knowledge of ten seed mappings, August 13, 2014 DRAFT
Polytopic and TS models are nowhere dense in the approximation model space

We show in this paper that the set of functions, consisting of polytopic or TS models constructed from finite number of components, is nowhere dense in the approximation model space, if that is defined as a subset of continuous functions. This topological notion means that the given set of functions lies "almost discretely" in the space of approximated functions. As a consequence, by means of the mentioned models we cannot approximate in general continuous functions arbitrarily well, if the number of components are restricted. Thus, only functions satisfying certain conditions can be approximated by such models, or alternatively, we need unbounded number of components. The possible solutions are outlined in the paper.
Atomic Congestion Games with Taxes on Resources

Introduction We consider the following network problem: there are finite number of users in the network. Each user has a non-negligible (or atomic) amount of demand and wants to route her demand from her source to her sink through multiple paths. For each edge in the network, there exists congestion for per unit of flow, which depends on the total amount of flow on this edge. The cost of a user is the total congestion she experiences for routing her demand. The social cost of the network is the sum of costs of all users. If the routing of all users can be controlled by the system, then optimizing the social cost becomes a convex optimization problem under certain natural assumptions. But it is always difficult, if not impossible, to control every user in a large system(for an example, the Internet), since the goal of a selfish user – minimizing her own cost – usually does not align with the goal of the system – optimizing the social cost. Therefore the system designer should ensure that a network performs well even when shared by selfish users. To be more concrete, one measure of the robustness of the network can be the ratio between the social cost of the worst outcome of the stable states of the system and that of the optimal state of the system. Here the stable state can be formally defined as the Nash equilibrium of a game played by users of the network, whose strategies are the paths from their sources to their sinks. The ratio is called the Price of Anarchy (PoA). A small PoA means that the system will perform almost as well as it is centrally controlled. So the first question will be how to analyze the PoA of a game. This question has been studied by many researchers in the field of algorithmic game theory. But perhaps the more important question for the designer of the system would be: how can we make the PoA small? Specifically, the system designer should find a way to motivate the users such that their selfish behavior align with the optimal state as the system is centrally controlled. One practical way is to ask for a tax or a toll when some resource is used. In that case, the cost of a user would be the congestion she experienced plus the taxes she pays. But the system should not collect too much taxes from the users. In a real world scenario, no one will like to pay a high tax to use a system, even if the congestion of the system is very small. In summary, we hope to find the answers to the following questions: (1) How much smaller can the PoA be if taxes are allowed on resources? (2) How much taxes do the users have to pay to reach a small PoA? (3) Is there a trade-off between the PoA and the taxes?
5.1 Introduction 5.2 Historical Overview 5.2.1 Introspection 5. Cognitive Perspectives in Psychology

The purpose of this chapter is to discuss some of the developments in cognitive psychology that have been influential in educational technology research. Since cognitive psychology is a broad, eclectic, and sometimes elusive discipline , this chapter is of necessity selective. Nonetheless, it provides discussion of the most important research in cogni-tive psychology that has a bearing on the theory and practice of educational technology. Educational technology came of age as a discipline at a time when relevant psychological theory was based almost entirely on behavioral principles (see 2.2). This meant that the procedures and practice of educational technology evolved to accommodate behavioral accounts of learning and instruction (Winn, 1989). History teaches us that theories change more readily than practice. Therefore, when researchers started to develop cognitive theories that compensated for the inadequacy of behaviorism to explain many aspects of human activity, the technologies and practices by means of which psychological theory is applied changed much more slowly, and in some cases not at all. The practices recommended by some schools of thought in instructional design are still exclusively behavioral. This chapter is colored by the tension that exists between some aspects of traditional practice in educational technology and cognitive theory, a tension that arises from the difficulty of trying to reconcile one kind of theory with procedures for application developed for another kind. The different rates of change in the theory and practice of educational technology mean that the true importance of research in cognitive psychology to our field must be examined in its historical context. For this reason, the chapter begins with a brief review of the antecedents of cognitive theory and of behaviorism against which it reacted. The historical development of cognitive psychology and cognitive science is addressed in a little more detail. The next two sections deal with two of the cornerstones of cognitive theory, mental representation, and mental processes. It will become clear that these topics are not entirely dissociable one from the other. Nonetheless, we feel that this somewhat artificial distinction is a better compromise for the sake of clarity than the muddle that would surely ensue from trying to treat both at once. The final section speaks specifically to the relevance of cognitive psychology to the practice of educational technology, namely, instructional design. It examines ways in which cognitive theory has been brought to both the theory of instruction and the design procedures …
The Health-Care System in Russia

The article discusses current issues in health economics, such as investments in health, the specific characteristics of medical services, state regulation, and a mixed economy in health care. The author emphasizes the potential of budget financing of health care as well as the principles of economic efficiency and social equity in the context of health-care reforms in Russia.
Study on the Decision Support System of Techniques and Tactics in Net Sports and the Application in Beijing Olympic Games

The techniques and tactics in net sports are the main factors of winning, while the key technology is the analysis of techniques and tactics and decision support. Using artificial intelligence, data mining and decision support technology, based on the development of multimedia and interactive data acquisition system and intelligent analysis system for the techniques and tactics in net sports, the decision support system of techniques and tactics in net sports is studied and developed. This achievement has been successfully used in table tennis team, badminton team, women's tennis team, volleyball team for women in 2008 Beijing Olympic Games, and the application effects are significant.
Variance modulated task prioritization in Whole-Body Control

Whole-Body Control methods offer the potential to execute several tasks on highly redundant robots, such as humanoids. Unfortunately, task combinations often result in incompatibilities which generate undesirable behaviors. Prioritization techniques can prevent tasks from perturbing one another but often to the detriment of the lower precedence tasks. For many tasks, static prioritization is not necessary or even appropriate because tasks can often be achieved in variable ways, as in reaching. In this paper, we show that such task variability can be used to modulate task priorities during execution, to temporarily deviate certain tasks as needed, in the presence of incompatibilities. We first present a method for mapping from task variance to task priority and then provide an approach for computing task variance. Through three common conflict scenarios, we demonstrate that mapping from task variance to priorities reactively solves a number of task incompatibilities.
Oligopoly Pricing: Old Ideas and New Tools

The "oligopoly problem"--the question of how prices are formed when the market contains only a few competitors--is one of the more persistent problems in the history of economic thought. In this book Xavier Vives applies a modern game-theoretic approach to develop a theory of oligopoly pricing. Vives begins by relating classic contributions to the field--including those of Cournot, Bertrand, Edgeworth, Chamberlin, and Robinson--to modern game theory. In his discussion of basic game-theoretic tools and equilibrium, he pays particular attention to recent developments in the theory of supermodular games. The middle section of the book, an in-depth treatment of classic static models, provides specialized existence results, characterizations of equilibria, extensions to large markets, and an analysis of comparative statics with a view toward applied work. The final chapters examine commitment issues, entry, information transmission, and collusion using a variety of tools: two-stage games, the modeling of competition under asymmetric information and mechanism design theory, and the theory of repeated and dynamic games, including Markov perfect equilibrium and differential games.