Miracle-dz/UniFAR-FTUs huggingface dataset:
Possible reasons for the migration of tropical cyclone track over the western north pacific: Interdecadal pacific oscillation modulation

Recent studies have proposed a relatively reliable metric, i.e., the annual-mean latitude of tropical cyclone (TC) lifetime maximum intensity, to evaluate the observed trend of poleward migration of TC. The documented trend in the existing records of the metric suggests that anthropogenic factors might make considerable contributions to the poleward migration of TC. However, here we show that there is no significant TC migration trend in the western North Pacific (WNP). Instead, large interdecadal variation is found in the WNP TC track over the past 35 years. Rather than the anthropogenic factors, it is the natural variability, especially the Interdecadal Pacific Oscillation (IPO), that plays a key role in modulating the migration of WNP TC track. The IPO-related TC migration is assumed to cause systematic changes (i.e., increases and decreases) in regional hazard exposure and risk. The impact of IPO on the WNP TC migration is attributed to its influences on the large-scale circulation, TC genesis potential index, and the potential intensity in the TC prevailing region of the WNP.
Generating Code for Agent UML Sequence Diagrams

A new and distinct cultivar of Chrysanthemum plant named Parasol having flat capitulum form and single capitulum type, spoon tipped pink-purple ray florets, variable length spoons, 130-150 mm. diameter across face of capitulum, tall plant height and semi-upright branching pattern, and the fading of its flowers to almost white under very high temperatures.
Edible coatings and films to improve food quality

Introduction Elizabeth Baldwin and Robert Hagenmaier Protein-based films and coatings Maria B. Perez-Gago Edible coatings from lipids, waxes, and resins David J. Hall Polysaccharide coatings Robert Soliva-Fortuny, Maria Alejandra Rojas-Grau, and Olga Martin-Belloso Gas-exchange properties of edible films and coatings Robert D. Hagenmaier Role of edible film and coating additives Roberto de Jesus Avena-Bustillos and Tara H. McHugh Coatings for fresh fruits and vegetables Jinhe Bai and Anne Plotto Coatings for minimally processed fruits and vegetables Sharon Dea, Christian Ghidelli, Maria B. Perez-Gago, and Anne Plotto Applications of edible films and coatings to processed foods Tara H. McHugh and Roberto de Jesus Avena-Bustillos Application of commercial coatings Yanyun Zhao Encapsulation of flavors, nutraceuticals, and antibacterials Stephane Desobry and Frederic Debeaufort Overview of pharmaceutical coatings Anthony Palmieri Regulatory aspects of coatings Guiwen A. Cheng and Elizabeth A. Baldwin
Early Characterization of the Defect Removal Process

 ,YU9BQYBa,0Y0 Yd¡U¢Q d^[£¤Q¥d§¦BdO ̈©aw0«M¬­®0OQd9 ̄U°@Q5Y ± Y]w¦2X>]2QU3Q>][£ ́£­Ya 2d;¦wWXμUUQdU« ¶¤Y0Yw·w ̈QdawUB·2QUY QT ̧aUUQ ±  ± 0U ± 2b,¦BYdM[ ̈QdQaw0° 0 ̈Qg0UQ¦aa@a1_[£oY ̈Qd0E ®Qd»2BQ¦g  ¦BYQB«1⁄21⁄43⁄4dX]Yb¿©29ÀYYwY  ± QÁd ¥QwQa ±  ± 0 ± 2b ± w¥U¦2B 1⁄2^YQ QYY«
Increasing scalability in network simulation and testbed experiments

One of the major challenges that network researchers and operators face today is the lack of reliable and scalable network testbeds. Since it is often infeasible to perform experiments directly on a production network or build analytical models for complex systems, researchers often resort to simulation or downscaled testbed experiments. However, designing a downscaled experiment that can faithfully represent a large-scale experiment is often challenging. The results of a non-representative experiment can be misleading and unexpected bugs may not be discovered until the Internet protocol or application is deployed into an operational network. In this work, we present two solutions to enable large-scale network experiments. Our first solution, flow-based scenario partitioning (FSP), is a platform-independent mechanism to partition a large network experiment into a set of small experiments that are sequentially executed. Each of the small experiments can be conducted on a given number of experimental nodes, e.g., the available machines on a testbed. Results from the small experiments approximate the results that would have been obtained from the original large experiment. Experimental results from several simulation and testbed experiments demonstrate that our techniques approximate performance characteristics, even with closed-loop traffic and congested links. Our second solution, EasyScale, aims to bridge the current gap between emulation testbed users and large-scale security experiments possibly using multiple scaling techniques. EasyScale is a new framework for easily configuring a large-scale network security experiment on an emulation testbed. Multiple scaling techniques, such as full and OS-level virtualization techniques, can be used for different parts of the input experimental topology in order to balance scalability and fidelity. The EasyScale resource allocation scheme considers user-specified fidelity requirements. Additional resources are allocated to the experiment components that are considered to be highly important, in order to increase the experimental fidelity. Our results from distributed denial of service and worm attack experiments demonstrate that EasyScale can easily allocate testbed resources to the critical components in an experiment, lowering the barrier for testbed users to conduct high fidelity yet scalable network security experiments.
The Role of Internet and Effects on Nigerians

– This study highlighted the various effect of Internet on Nigerians; literature work was deployed to exhaustively harness the important of Internet in economical development, social activities etc. Data were obtained from Network “k” mobile communication networ k in Nigeria, which involves voice and data usage intensity for various years in Nigeria. Questionnaires were deployed in Ekpoma environment to determine the busy hours of data usage from the subscribers. It is observed from the analysis that there is a geometric increase in data package (Internet) usage, were compared to voice usage over the years in Nigeria. In addition, it is observed that the busy hour lies between 6.00 am to 12:00noon hrs witnessed the highest number of subscriber data usage intensity, followed by the period between 12.00noon to 6.00 pm. These peak hours which lies between 6:00 am to 12:00 were probably caused by internet activities such were e-banking, online admission and clearance, YouTube activities, social medium etc, encaged by Nigerian populist in gust of information. Also, a better quality of service is experienced from the internet service in the night between 0.00 to 6.00 am due to low number of subscribers’ usage. Therefore, data package (Internet) provider should increase data package transmission channels along side with increase in demand .
Hmetis: a hypergraph partitioning package

∗hMETIS is copyrighted by the regents of the University of Minnesota. This work was supported by IST/BMDO through Army Research Office contract DA/DAAH04-93-G-0080, and by Army High Performance Computing Research Center under the auspices of the Department of the Army, Army Research Laboratory cooperative agreement number DAAH04-95-2-0003/contract number DAAH04-95-C-0008, the content of which does not necessarily reflect the position or the policy of the government, and no official endorsement should be inferred. Access to computing facilities were provided by Minnesota Supercomputer Institute, Cray Research Inc. Related papers are available via WWW at URL: http://www.cs. umn.edu/ ̃karypis
Keynes, Sraffa and the latter´s secret scepticism

The relationship between Keynes and Sraffa was very close in some respects and quite otherwise in some other respects. Keynes was deeply impressed by Sraffa’s breadth and depth of knowledge, his sharpness and intellectual brilliance, and he found his younger Italian colleague a truly likeable person. There are numerous documents that express vividly their close personal relationship which grew into friendship (see recently Ranchetti, 2005). Without Keynes’s continuous support up until his premature death in 1946 it is difficult to imagine how Sraffa would have done in an environment like Cambridge, given the peculiarities of his character, his meticulosity and even pedantry. Thanks to Keynes, Sraffa could pursue his work without much interference. Keynes, it seems, had full trust in Sraffa’s intellectual capabilities and made no serious effort to direct his research. He allowed Sraffa to follow his course and develop his truly novel ideas, which were eventually born into an environment that was not prepared for them and had difficulties to absorb them. Sraffa was and remained a loner amongst the economics profession in Cambridge. Highly respected and even feared by his colleagues, he was hardly ever fully understood (see Marcuzzo, 2002, and Ranchetti, 2002). Sraffa knew how much his critical and constructive work contradicted the received wisdom in Cambridge and elsewhere. Apart from some early attempts at communication he was reluctant to let his colleagues know what precisely his work was all about, which difficulties he had encountered and which results he had got when. Sraffa kept his cards very much to himself and typically disclosed them only in the moment in which he was absolutely sure that what he had to offer was both new and sound. Unlike Keynes he was horrified by the vision of circulating half-baked ideas and leave it to others to straighten them out. It is telling that apart from Maurice Dobb Sraffa discussed his work typically only with mathematicians: in the late 1920s with Frank Ramsey and in the 1940s and 1950s with Abram S. Besicovitch and Alister Watson.1
Cognitive Primitives for Mobile Robots

Tekkotsu (see www.Tekkotsu.org) is an application development framework for the Sony AIBO mobile robot that endeavors to provide an intuitive set of primitives for perception, manipulation, and attentional control, drawing on insights from cognitive science. The framework also addresses some of the human-robot interaction problems faced by mobile robot application developers.
Notes on QoS information model for making adaptation decisions

Abstract: We present a network model that allows processi ng of QoS (quality of service) information about media flows to enable applications to make adaptation decisions. Our model is based around a multi-dimensional spatial representation t hat allows QoS information describing the flow constructions and QoS parameters – flow-s tates – to interact with a representation of the network QoS. The model produces report s about the compatibility between the flow-states and the network QoS, indicating w hich flow-states the network can currently support. The simple nature of the reports allow s the application to make decisions, dynamically, on which flow-state it should use. The model is relati vely lightweight and scaleable. We demonstrate the use of the model by simulation of a dynamically adaptive audio tool. Our work is ongoing.
Drowsy Cache Partitioning for Multithreaded Systems and High Level Caches

Drowsy Cache Partitioning for Multithreaded Systems and High Level Caches Samantha Rose Kenyon Supervising Professor: Dr. Sonia Lopez Alarcon Power consumption is becoming an increasingly important component of processor design. As technology shrinks both static and dynamic power become more relevant. This is particularly important for the cache hierarchy. The cache portion of a microprocessor contains a large percentage of the total number of transistors in the microprocessor. Therefore the cache consumes a large percentage of both static and dynamic power. When improving power consumption in the past, there has always been a large trade-off between energy savings and performance. Techniques that reduce power consumption typically have a negative impact on performance. Likewise, when performance is improved it is at the cost of higher energy consumption. Also many current implementations only reduce one kind of power in the cache, either static or dynamic. For a more robust approach that will remain relevant as technology continues to shrink, both aspects of power need to be addressed. This thesis implements a phase adaptive cache that will reduce both static and dynamic power while having very little impact on the performance. This cache stores the most recently used blocks in one partition that is quick and easy to access. The second partition is placed in drowsy mode to reduce leakage power consumption. In this work, this approach is implemented for all three levels of cache in a multicore architecture. The design is also tested with multithreaded simulations. Brendan Fitzgerald et al. used a similar approach in [10], however it was only for a second level cache for a single threaded application. The results are measured using an architecture simulator. Simulations of the modified cache structure are compared to those of a baseline unchanged cache hierarchy running on the same machine. These results are compared for both energy savings including static and dynamic power, along with the overall impact on performance. The results in this work show that this cache design produces both dynamic energy and leakage energy savings with a low performance impact.
Partitionnement automatique optimisant les ressources FPGA pour l'aide à la conception de SoC reconfigurable

In the dynamically reconfigurable architectures field, the lack of software support is now well known. To answer this problem, we propose tools that helps designer to implement algorithms using dynamic reconfiguration. This tool allows to find the best adequacy between an application and its implementation on a SoC. Based on an original temporal partitioning methodology, its aims are: minimizing logic resources and minimizing the memory bandwidth.
Simulation Techniques to Bridge the Gap Between Novice and Competent Healthcare Professionals

Simulation techniques are being used today in a variety of programs designed to enhance the skills of healthcare providers. The aim of this article is to describe simulation techniques currently being used in healthcare education and identify future directions for the use of simulation in healthcare. The author will describe various types of simulators and simulated experiences, including role playing, standardized patients, partial task trainers, complex task trainers, integrated simulators, and full mission simulation. Next, the use of simulation in undergraduate nursing programs, continuing education programs, interdisciplinary team training, and competency assessment will be presented. Resources for simulation faculty and costs associated with simulation will be discussed. The author will conclude by noting that next steps in using simulation to strengthen the provision of healthcare include providing healthcare educators with the motivation and competencies needed to create and use meaningful simulation learning experiences and initiating more research regarding the benefits of simulation in healthcare education.
Robust Efficient Conditional Probability Estimation.

The problem is finding a general, robust, and efficient mechanism for estimating a conditional probability P (y|x) where robustness and efficiency are measured using techniques from learning reductions. In particular, suppose we have access to a binary regression oracle B which has two interfaces—one for specifying training information and one for testing. Training information is specified as B(x′, y′) where x′ is an unspecified feature vector and y′ ∈ [0, 1] is a bounded range scalar with no value returned. This operation is stateful, possibly altering the return value of the testing interface in arbitrary ways. Testing is done according to B(x′) with a value in [0, 1] returned. The testing operation operation is stateless. A learning reduction consists of two algorithms R and R−1. The algorithm R takes as input a single example (x, y) where x is a feature vector and y ∈ {1, . , k} is a discrete variable. R then specifies a training example (x′, y′) for the oracle B. R can then create another training example for B based on all available information. This process repeats some finite number of times before halting without returning information. A basic observation is that for any oracle algorithm, a distribution D(x, y) over multiclass examples and a reduction R induces a distribution over a sequence (x′, y′)∗ of oracle examples. We collapse this into a distribution D′(x′, y′) over oracle examples by drawing uniformly from the sequence. The algorithm R−1 takes as input a single example (x, y) and returns a value v ∈ [0, 1] after using (only) the testing interface of B zero or more times. We measure the power of an oracle and a reduction according to squared-loss regret according to: reg(D,R−1) = E(x,y)∼D[(R(x, y)−D(y|x))] and similarly letting μx′ = E(x′,y′)∼D′ [y′]. reg(D′, B) = E(x′,y′)∼D′(B(x)− μx′) The open problem is to specify R and R−1satisfying the following theorem:
IBA Performance and Usability for Mobile Phones

Mobile phones are becoming increasingly sophisticated, enabling consumers to access more services and generate more data. However, the current PIN and password protection capabilities available on mobile phones are often misused resulting insufficient protection of the information stored within mobile phones. Image-based authentication (IBA) leverages the human ability to recognize graphics better than recalling a sequence of strings and results have shown increased pass-image memorability among users. In this paper, the performance results and user opinions of two IBA techniques, Picture Password and Awase-E, will be compared alongside PIN and password as control techniques. In summary, of the data on authentication speed and success rate were collected but results indicate that Awase-E is possibly a superior technique which is more preferred by users.
Constraint Programming for Natural Language Processing

This course demonstrates how constraint programming can be used effectively in practice, for linguistic applications. It shows how many forms of ambiguity arising in computational linguistic can be represented compactly and elegantly, and processed efficiently with constraints. A key idea to derive the most benefit from constraint propagation is that intended models should be characterized as solutions of Constraint Satisfaction Problems (CSPs) rather than defined inductively or in a generative fashion. We examine several topics in detail: encodings of finite domains, tree descriptions using dominance constraints, and parsing with dependency grammars. In each case, we present a formal characterization of the problem as a CSP and illustrate how to derive a corresponding constraint program. The course includes 4 complete interactive applications written in Oz, with full code supplied. Through these programmatic vignettes the reader is exposed to the practice of constraint programming with finite domain and finite set variables, and introduced to some of the more powerful types of constraints available today, such as reified constraints, disjunctive propagators, and selection constraints. Copyright c © by Denys Duchier, June 2000 Universitat des Saarlandes, Saarbrucken, Germany duchier@ps.uni-sb.de This course is also available online: http://www.ps.uni-sb.de/~duchier/esslli-2000/index.html
Modèle et algorithme d'ordonnancement pour architectures reconfigurables dynamiquement

With increasing multimedia application complexity, designers try to propose hardware architectures able to support this complexity. Architectures, called SoCs (Systems on Chip), based on heterogeneous processing units (e. G. General purpose processors, FPGAs, DSP) integrated on a single chip, are more and more adopted, especially in embedded systems. These heterogeneous units can present different computing capacities in addition of different energy cost for the same portion of code. Furthermore, the presence of dynamically reconfigurable units allow to adapt the architecture to the variety of the application processing (intensive data processing and control) on data of different nature and width. These specific highly heterogeneous architecture consideration requires the use of specific methods and tools. In this thesis, software solutions to the specificity of the architectures considered is discussed. First, a general model of a system-on-chip based platform which includes dynamically reconfigurable modules is proposed. This model is essential prior to the implementation phase of an application and aims at providing a real simulation framework. The specific part of the operating system that ensures task scheduling, i. E. Dispatching tasks over processing units on the chip is then dealt with. The contribution of the proposed method in this thesis is the ability to take into account the heterogeneity of the computing unit characteristics in addition of the heterogeneity of the application task constraints in an on-line manner. To do so, we consider the extension of neural network use to on-line task scheduling on heterogeneous architectures. This method based on neural networks is well suited for on-line scheduling since the networks convergence is extremely rapid when implemented directly in silicium. An on-line scheduling algorithm is than constructed and simulations show the applicability and the efficiency of this method for heterogeneous systems.
Integrated Logical Topology Design and Traffic Grooming in Re-Configurable WDM Networks

Abstract : Wavelength-division multiplexing (WDM) networks provide reconfigurability and the possibility of creating single-hop communication channels between end nodes. This eliminates the electronic processing at intermediate nodes and reduces delay significantly. However, because of the limited number of network interfaces and other scalability issues, single-hop channels do not support all traffic demands. Some of the traffic requires routing or switching over multi-hop lightpaths to reach the destination. Such traffic is referred to as multi-hop traffic. The optimization of multi-hop traffic has significant impact on the performance of optical networks. In this paper, the authors propose an integrated logical topology design and traffic-grooming algorithm. The algorithm supports lightpath setup for multi-hop as well as single-hop paths. This is enabled by the consideration of the traffic grooming for multi-hop paths together with the logical topology design. They have used simulations with randomly generated traffic demand matrices to evaluate the performance of their algorithm in comparison with well-known algorithms such as HLDA, MMHA, and MRU. The results indicate that their algorithm performs better in terms of average weighted (logical) hop count and network throughput. In terms of average number of wavelengths per lightpath, its optical resource usage is similar to MMHA, more efficient than HLDA, but not as efficient as MRU.