Miracle-dz/UniFAR-FTUs huggingface dataset:
Background Traffic Modeling for Large-Scale Network Simulation

OF THE DISSERTATION BACKGROUND TRAFFIC MODELING FOR LARGE-SCALE NETWORK SIMULATION by Ting Li Florida International University, 2014 Miami, Florida Professor Jason Liu, Major Professor Network simulation is an indispensable tool for studying Internet-scale networks due to the heterogeneous structure, immense size and changing properties. It is crucial for network simulators to generate representative traffic, which is necessary for effectively evaluating next-generation network protocols and applications. With network simulation, we can make a distinction between foreground traffic, which is generated by the target applications the researchers intend to study and therefore must be simulated with high fidelity, and background traffic, which represents the network traffic that is generated by other applications and does not require significant accuracy. The background traffic has a significant impact on the foreground traffic, since it competes with the foreground traffic for network resources and therefore can drastically affect the behavior of the applications that produce the foreground traffic. This dissertation aims to provide a solution to meaningfully generate background traffic in three aspects. First is realism. Realistic traffic characterization plays an important role in determining the correct outcome of the simulation studies. This work starts from enhancing an existing fluid background traffic model by removing its two unrealistic assumptions. The improved model can correctly reflect the network conditions in the reverse direction of the data traffic and can reproduce the traffic burstiness observed from measurements. Second is scalability. The trade-off between accuracy and scalability is a constant theme in background traffic modeling. This
Research on Dynamic Self-Adaptive Network Security Model Based on Mobile Agent

The rapid development and wide application of computer network is a new challenge to information security and network security. Traditional security models and single security technology can not keep up with the change of complex network structure and alterable intrusion measure. Based on analysis of some classical security models and technologies, we think network security is a kind of dynamic security. So, this paper presents a dynamic self-adaptive network security model based on mobile agent, and emphases on its structure, control strategy and prototype implementation.
Display and Interface Design: Subtle Science, Exact Art

Technological advances in hardware and software provide powerful tools with the potential to design interfaces that are powerful and easy to use. Yet, the frustrations and convoluted "work-arounds" often encountered make it clear that there is substantial room for improvement. Drawn from more than 60 years of combined experience studying, implementing, and teaching about performance in human-technology systems, Display and Interface Design: Subtle Science, Exact Art provides a theoretically-based yet practical guide for ecological display and interface design. Written from the perspective of cognitive systems engineering and ecological interface design, the book delineates how to design interfaces tailored to specific work demands, leverage the powerful perception-action skills of the human, and use powerful interface technologies wisely. This triadic approach (domain, human, interface) to display and interface design stands in sharp contrast to traditional dyadic (human, interface) approaches. The authors describe general principles and specific strategies at length and include concrete examples and extensive design tutorials that illustrate quite clearly how these principles and strategies can be applied. The coverage spans the entire continuum of interfaces that might need to be developed in today's work places. The book includes access to a web site containing examples of the dynamic properties of displays. The reason that good interfaces are few and far between is really quite simple: they are extremely difficult to design and build properly. While there are many books available that address display design, most of them focus on aesthetic principles but lack scientific rigor, or are descriptive but not prescriptive. Whether you are exploring the principles of interface design or designing and implementing interfaces, this book elucidates an overarching framework for design that can be applied to the broad spectrum of existing domains.
A Principled Approach to Policy Composition for Runtime Enforcement Mechanisms

Runtime enforcement mechanisms are an important and well-employed method for ensuring an execution only exhibits acceptable behavior, as dictated by a security policy. Wherever interaction occurs between two or more parties that do not completely trust each other, it is most often the case that a runtime enforcement mechanism is between them in some form, monitoring the exchange. Considering the ubiquity of such scenarios in the computing world, there has been an increased effort to build formal models of runtime monitors that closely capture their capabilities so that their effectiveness can be analysed more precisely. While models have grown more faithful to their real-life counterparts, issues concerning complexity and manageability (a common concern for software engineers) of centralized policies remains to be fully addressed. The goal of this thesis is to provide a principled approach to policy construction that is modular, intuitive, and backed by formal methods. This thesis introduces a class of policy combinators adequate for use with runtime enforcement policies and analyses a particular instance of them called Static Committee Combinators (SCCs). SCCs present a model of policy composition where combinators act as committees that vote on events passing through the monitor. They were conceptualized in collaboration with Jay Ligatti and Daniel Lomsak. The general class of combinators are called Static Decision Combinators (SDCs), which share key features with SCCs such as allowing combinators to respond with alternative events when polled, in addition to responding with grants or denials. SDCs treat the base-level policies they compose as black
Aktuelles Schlagwort: Business Process Intelligence

In jungerer Vergangenheit ruckt vermehrt die Erfassung und Analyse von Prozessechtdaten (z.B. zum Start und Ende von Prozessaktivitaten) in den Blickpunkt. Solche Daten werden von den meisten prozessorientierten Informationssystemen geliefert. Das Schlagwort Business Process Intelligence (BPI) subsumiert existierende Konzepte, Anwendungen und Werkzeuge fur die Erfassung und Auswertung von Prozessdaten. Anwendungsbeispiele sind die aggregierte Auswertung von Daten uber einer Kollektion von Prozessinstanzen (z.B. mittlere Prozessdurchlaufzeit oder durchschnittliche Ressourcenallokation) oder die automatische Ableitung von Prozessmodellen aus den Protokolldaten zu abgeschlossenen Prozessausfuhrungen. Aus Informatiksicht gilt es, geeignete Rahmenbedingungen zur Unterstutzung entsprechender Anwendungsszenarien zu schaffen. Wichtige Aspekte, die in diesem Beitrag in einer BPI-Referenzarchitektur eingeordnet werden, betreffen die Datenintegration, das Prozess-Monitoring und die Prozessvisualisierung.
Una propuesta de reconocimiento de patrones para asistir en el diagnóstico del test gestáltico visomotor

El Test de Bender es un test visomotor que consiste en una prueba no verbal, neutra e inofensiva, aplicable a niños desde los 4 años de edad. Se fundamenta en la teoría de la gestalt y está incluido en gran cantidad de baterías psicodiagnósticas para explorar posibles compromisos neuronales o enfermedades orgánicas de la persona estudiada (por ejemplo: afasias). La implementación de este test en forma masiva perjudica la calidad de observación del profesional durante su ejecución. En este contexto, este artículo propone una arquitectura de reconocimiento de patrones para asistir en el diagnóstico del test gestáltico visomotor en evaluación diferida de la toma de test, permitiéndole al profesional observar al individuo, mientras resuelve el test, con independencia de la necesidad de registrar y evaluar los desvíos introducidos por el sujeto en los grafismos al momento de resolución del mismo.
A CRYPTOSYSTEMS ALGORITHM USING SYSTEMS OF NON-LINEAR EQUATIONS

Encryption is an important tool for managing and protecting information. Cryptography is the only practical means of sending information over an insecure channel. These channels may be computers, telephone lines, satellite, etc. The Increasing use of electronic means of data transfer from one point to another, coupled with the growth in networking and Internet communication, has extended the need to protect vital information- military, banking, academics (question papers), databases and the e-initiative. This paper proposes a new radical method for a secured means of encrypting and decrypting messages. The method uses data compression and systems of non-linear equations. With this, we hope that data transmission across networks will be more secured. This new proposal is in recognition of the peculiar nature of our environment where people want to break codes/messages not intended for them. The final stage is to turn the text message to a system of non-linear equations, which can be solved only when the text message gets to its intended destination.
6502 Assembly Language Programming

After viewing product detail pages, look here to find an easy way to navigate back to pages you are interested in. > View and Edit Your Browsing History The error prone and branch instructions, not only be used for assemblers support work. For 6502 were looking at the, stack space that in this subroutine. Perhaps the given an exact byte value. Is initially announced a separate list contains compilers translate into straightforward to the computation press. In the binary form actual, values its level languages this limitation was a handful. The opcode is a system's portable peddle to translate? Is this issue was only able to the value 75 lsr.
How recent developments in university libraries affect research

Summarizes the results of a 1995 survey of over 2,000 UK academics. The main objective was to look at how well university libraries meet research needs and at the possible consequences for research of recent library developments. The results suggest that library collections are perceived by their users to be deteriorating, gaining access to important journals is becoming increasingly difficult and, as a result, satisfaction with libraries is declining. Academics are relying more now on inter‐library loan and on purchasing their own materials. The growing use of electronic services has, to some extent, mitigated the potentially detrimental effects for research of deteriorating collections. Electronic services permit easier access to a wide range of information, a view which has led to increasing satisfaction with library services over time. However, views vary by university and by discipline, and it appears that a significant minority of academics (perhaps as many as one in four) believe that recent resear.
A CMOS Analog Hopfield Net with Local Adaption and Storage of Weights

of the research was funded through the NIADE project. I thank my advisor Tor Sverre Lande for always being encouraging and always oering constructive criticism of my ideas, no matter how farfetched they might seem. I have also been allowed great liberty in choice of methods and solutions, which have suited me very well. I also thank my parents for their support, both monetary and not the least morally. Without them this thesis never would have been possible.
Elimination of Side Channel attacks on a Precision Timed Architecture

Side-channel attacks exploit information-leaky implementations of cryptographic algorithms to find the encryption key. These information leaks are caused by the underlying execution platform which contain hardware elements designed to optimize performance at the expense of predictable execution time. This shows that for security systems, not only does the software need to be secure, but the execution platform also needs to be secure in order for the entire system to be truly secure. PRET is an architecture designed for real time systems that has total predictability without sacrificing performance. It contains ISA extensions to bring control over temporal properties of a program to the software level. We show that this design can not only defend against all software side channel attacks on encryption algorithms, but completely eliminate the root cause of the problem. We demonstrate this by running a reference implementation of the RSA algorithm on PRET and prove that it’s immune to side channel attacks.
Incremental Basis Function Expansion in Reinforcement Learning using Cascade-Correlation Networks

In machine learning, in parallel to algorithms themselves, the representation of data is a point of utmost importance. Efforts on data pre-processing in general are a key ingredient to success. An algorithm that performs poorly on a particular form of given data may perform much better, both in terms of efficiency and the quality of the solution, when the same data is represented in another form. Despite the amount of literature on the subject, the issue of how to enrich a representation to suit the underlying mechanism is clearly still pending. In this paper, we approach this problem within the context of reinforcement learning, and in particular, interested in discovery of a ''good'' representation of data for the LSPI algorithm. To this end, we use the cascade-correlation learning architecture to automatically generate a set of basis functions which would lead to a better approximation of the value function, and consequently improve the performance of the resulting policies. We also show the effectiveness of the idea on some benchmark problems.
The nature of niching: genetic algorithms and the evolution of optimal, cooperative populations

Genetic algorithms (GAs) with "fitness sharing" have been analyzed and successfully applied to problems in search and optimization, while GAs using various types of "resource sharing" have been incorporated into classifiers, immune system models, artificial ecologies, artificial economies, etc. Both types of sharing are based on the same observation of nature: dividing a finite resource among competing organisms limits the size of populations dependent on that resource. If multiple resources are involved, each resource can be considered a "niche", and each subpopulation exploiting a niche can be considered a "species". By treating population slots as a finite resource, we obtain the traditional, fixed-size population "simple GA". By further treating the figure of merit (i.e., the function to be optimized) as a limited resource, we obtain fitness sharing. If our problem domain manifests explicit resources, such as rewards for correct classification of examples, we can enforce resource sharing. Both fitness and resource sharing have been studied separately, and usually under the assumption of non-overlapping niches, or "perfect sharing". Little effort has been made to understand the more complicated situation of niche overlap. Yet the resolution of niche overlap is critical to successful, useful niching. Non-overlapping niches can be covered by non-competing species, while heavily overlapped niches induce competition between species in which only the best will survive to represent the overlapping resources. Somewhere in between the two extremes of overlap must lie a critical boundary between cooperation (all species survive) and competition (one dominant species survives). We seek this boundary for the simplest case of niche overlap: two niches. We first define the general mechanism of sharing, and investigate where sharing-induced-niching fits into the larger frameworks of context-dependent function optimization, natural ecologies, and models of cooperation and competition. We then map fitness sharing to resource sharing, and show that they are identical when there is no niche overlap (i.e., perfect sharing). We go on to analyze the three cases: perfect sharing, fitness sharing (with overlap) and resource sharing (with overlap). We find that even under severe selective pressure with high degrees of niche overlap, a stable equilibrium population is quickly found and indefinitely maintained, a population consisting of diverse species covering the best niches. We find that maintenance of the sharing equilibrium degrades gradually as niche overlap and fitness discrepancies increase. We create a control map for the two-niche case, plotting the boundary between surviving niche pairs (cooperation) and untenable niche pairs (competition). Controlling this boundary will allow us to use sharing to evolve the types of cooperation and competition appropriate to the problem at hand. We extend the above analysis by looking at some aspects of the gen
Analysis of anisotropic behavior using sub-aperture polarimetric SAR data

In this paper, a fully polarimetric analysis method is introduced to decompose synthesized polarimetric images into sub-aperture data sets, which corresponds to the scene responses under different azimuthal look-angles. A statistical analysis of polarimetric parameters permits to clearly discriminate media showing a non-stationary behavior during the SAR integration. A method is proposed, which eliminates the influence of azimuthal backscattering variations in conventional polarimetric SAR data analysis.
Complex Predicates: Cross-Linguistic Perspectives On Event Structure

1. Introduction: complex predicates Mengistu Amberber, Brett Baker and Mark Harvey 2. Complex predicate formation Brett Baker and Mark Harvey 3. The light verb jungle: still hacking away Miriam Butt 4. Events and serial verb constructions William A. Foley 5. Cotemporal serial verb constructions in White Hmong Nerida Jarkey 6. Activity incorporates in some Athabaskan languages Keren Rice 7. Warlpiri verbs of change and causation: the thematic core Mary Laughren 8. Complex predicates in Wambaya: detaching predicate composition from syntactic structure Rachel Nordlinger 9. Compound verbs and ideophones in Wolaitta revisited Azeb Amha 10. The structure of the light verb construction in Amharic Mengistu Amberber Author index Language index Subject index.
Security Awareness: A Lesson from Tcpdump and Ethereal

Ethernet has survived for several decades as essential media for LAN technology because of its relative inexpensive and reasonably fast. Shared Ethernet uses broadcast technology where CSMA/CD acts as medium access control. CSMA/CD deploys principle of media sharing and the drawback is promiscuous mode, whereby network interface device could intercept all packet frames that traveling on the wire. This has a significant impact on the security of Internet application. HTTP, FTP, E-MAIL and TELNET are daily applications, which offer secure transaction or unsecured transaction. However, users do not aware of the security provided by the services. They usually use unsecured transaction because of simplicity or unaware of security awareness. This behavior is vulnerable to packet-sniffing tools, such as sniffit, tcpdump and ethereal. These tools could intercept the traveling packet and extract sensitive information, such as user login and password or unencrypted data payload. This paper explores network security awareness from the perspective of packet-sniffing tools over unsecured application. The study uses tcpdump and ethereal, which are two of the most popular packet-sniffing tools. From the experiment, it is shown that vital information, such as login and password, could be compromised easily from the packet if users do not consider security awareness seriously.
The Research on Mass-MAS Parallel Decision in Integrated Infrastructurefor Agile Enterprise

The Information Economics and its platform can input the vigor into manufacturing industry, i.e. garment in- dustry, and help to increase its ability for good return, can promote the level of technology and management of Garments from a labor-intensive industry, and can move it toward the accurate management. The platform is designed as Compre- hensive Information Platform by our research team. This paper is one of the series of papers about the design of Agile In- frastructure for Collaborative Manufacturing as well as Agile Supply Chain. This one lays emphasis upon the design of the optimal production planning algorithm to keep the manufacture financing stability in product cycle. We mainly con- cern and research into the research on Mass-MAS parallel decision in integrated infrastructure for agile enterprise, includ- ing the analysis of information exchange rules for MAS members, individual behavior rules and its correction by envi- ronment driven, MAS decision rules for members in the Algorithm, the solution to the problem & algorithm design in the decision-making operation burden for IIAE. Their logical relationship and flow chart designs are elaborated in turn. The paper tries to introduce the research of Agile Infrastructure and its key technologies, showing how well they work in some traditional manual industries.
WINMAC: a novel transmission protocol for infostations

Infostations is a new system concept proposed to support "many time, many where" wireless messaging services. Three basic scenarios, sit-through, walk-through, and drive-through are used to describe the user mobility in infostations. In order to handle channel access and allocation, retransmission, and adaptive transmission rate adjustment in infostations, we propose an intelligent transmission protocol called WINMAC in this paper. Especially, the design and implementation issues of WINMAC for a prototype infostation system based on a commercial radio chip set for 2.4 GHz IEEE 802.11 wireless LAN are described.
Financial forecasting and rules extraction from trained networks

This paper describes a forecasting approach using constrained networks. Two complementary approaches are proposed. The main property of the first approach is to lead to an efficient predictive algorithm based on backpropagation. Some units are constrained to hold the logical information of the network whereas the unconstrained unit keep the numerical information. Therefore the task of each unit is defined during the training. The second approach is focused on rules extraction. Using constrained networks, we are able to extract information from trained networks. This property is essential as it is possible to analysis, explain, extract and therefore control what happens inside trained networks. Simulation results for these approaches are reported. <<ETX>>
The CO2 Pollution Map: Lessons Learned from Designing a Visualization that Bridges the Gap between Visual Communication and Information Visualization

We present the design of the CO2 Pollution map, a web-based visualization that uses motion design techniques to assist users in interpreting semantic information about the data. We describe our motivations and inspirations, found in the fields of graphic and motion design, and present how free visual variables can be used to create an impression of what the data are about. We finish by reporting an early evaluation of the impact of the visualization, which we published in the form of a data journalism article. Index Terms—Graphic design, Motion design, Design for interpretation, Pollution map