Miracle-dz/UniFAR-FTUs huggingface dataset:
Correlating IPv6 addresses for network situational awareness

The advent of the IPv6 protocol on enterprise networks provides fresh challenges to network incident investigators. Unlike the conventional behavior and implementation of its predecessor, the typical deployment of IPv6 presents issues with address generation (host-based autoconfiguration rather than centralized distribution), address multiplicity (multiple addresses per host simultaneously), and address volatility (randomization and frequent rotation of host identifiers). These factors make it difficult for an investigator, when reviewing a log file or packet capture ex post facto, to both identify the origin of a particular log entry/packet and identify all log entries/packets related to a specific network entity (since multiple addresses may have been used). I have demonstrated a system, titled IPv6 Address Correlator (IPAC), that allows incident investigators to match both a specific IPv6 address to a network entity (identified by its MAC address and the physical switch port to which it is attached) and a specific entity to a set of IPv6 addresses in use within an organization's networks at any given point in time. This system relies on the normal operation of the Neighbor Discovery Protocol for IPv6 (NDP) and bridge forwarding table notifications from Ethernet switches to keep a record of IPv6 and MAC address usage over time. With this information, it is possible to pair each IPv6 address to a MAC address and each MAC address to a physical switch port. When the IPAC system is deployed throughout an organization's networks, aggregated IPv6 and MAC addressing timeline information can be used to identify which host caused an entry in a log file or sent/received a captured packet, as well as correlate all packets or log entries related to a given host.
A System-in-Package (SiP) Integration of a 62GHz Transmitter for MM-wave Communication Terminals Applications

We demonstrate a 2.1 X 1.0 X 0. 1cm³ sized compact transmitter using LTCC System-in-Package (SiP) technology for 60G Hz-hand wireless communication applications. For low-attenuation characteristics and resonance suppression of the SiP, we have proposed and demonstrated a coplanar double wire-bond transition and novel CPW-to-stripline transition integrating air-cavities as well as novel air-cavities embedded CPW line. The fabricated transmitter achieves an output of 13dBm at a RF frequency of 62GHz, an IF frequency of 2.4GHz, and a LO frequency of 59.6GHz. The up-conversion gain is 11dB, while the LO signal is suppressed with the image rejection mixer below -21.4dBc, and the image and spurious signals are also suppressed below -31dBc.
Combining the Phoenix Flash Code with the Binary Index Flash Code for Low Write Deficiency

In the framework of floating codes, a block of flash cells stores data in the form of binary numbers. The fundamental approach in constructing a coding scheme is by assigning cells to bits. However, the way to assign cells to bits is not simple, as the frequency of changes of the value of the bits is not known. This makes it difficult to partition the cells in a block in proportion to the frequency of the changes of bit value where the most updated bit has the most number of cells assigned to it. In this study, we discuss a novel coding scheme to dynamically assign cells to bits. At the beginning, there is a pre-determined assignment of cells to bits, but the coding scheme allows reassignment of cells if needed. The proposed coding scheme gives a very low write deficiency. A novel idea is discussed in this manuscript.
Evaluation of the performance of techniques to transmit ipv6 data through ipv4 networks

This article presents the simulation of an IPv4 network connected to two IPv6 isles. Those protocols are not compatible; therefore, transition mechanisms were implemented to fulfill a fundamental role. Meanwhile, this reaches the total deployment of IPv6, such as: Tunneling and Address translation. The first, encapsulates an IPv6 packet inside an IPv4 Header so that it can be moved through he network; the second, translates the address and the protocol of those packets crossing through it. To assess the performance of each technique when the data is sent, the changes with respect to memory consumption and router processing were analyzed.
FLIPPING THE CLASSROOM AND PROBLEM SOLVING TECHNIQUES – OBSERVATIONS AND LESSONS LEARNED

The “flipped classroom”, one where the lectures take place outside of the classroom and the homework is done in the classroom, is one of the trendier topics in contemporary education. The idea behind the model is that students can work on problems when both their instructor and peers are present, while having the lectures on video that can be watched at home allows the students to rewind, fast-forward, and otherwise tailor the lecture experience to meet each individual learner’s needs. This paper reports the results of the author’s experiences in flipping the classroom in an advanced spreadsheet modeling class. It also offers recommendations for those wishing to participate in further flipped classroom experiences. While the amount of material able to be covered was greater, students who were used to doing less work reported anxieties. Care should be taken to be certain that students are prepared for the amount of work and for the benefits of the flipped classroom.
Facilitators, inhibitors and obstacles - A refined categorization regarding barriers for knowledge transfer, sharing and flow

Within the KM area, numerous terms are frequently used. Among terms that have high significance for change in the knowledge structure, terms related to distribution or dispersion are common. Four of those terms are Knowledge Transfer (KT), Knowledge Sharing (KS), Knowledge Flow (KF), and Knowledge Barriers. Barriers come in many forms, ranging from strictly individual/personal barriers through group-related barriers, intra- and inter-organizational barriers, barriers related to national differences, as well as an array of technology-related barriers. Several authors have developed categories with the purpose to create a structure. However, these categories only focus on type of barrier. There is a lack of categorization that divides barriers due to their relative effect on the KT and KS or KF. The purpose is to present a refined categorization regarding factors that influence knowledge transfer, sharing, and flow and to show how previously identified barriers fit into this new categorization. This research has been carried out as a literature review. Previously identified influencing factors have been re-categorized. The research has resulted in a proposition of factors influencing knowledge dissemination and the following terms are suggested: (1) Facilitators (which denominate factors with positive influence), (2) Inhibitors (factors with negative influence) and (3) Obstacles (factors that obstruct knowledge dissemination, until certain conditions or levels are fulfilled). The proposed categorization is supported by descriptive examples taken from in-depth case studies of four multinational manufacturing companies with product development in Sweden and manufacturing in China The refined categorization will enable practitioners and academics alike to develop suitable tools to further enhance the collective (or individual) understanding of the mechanisms behind knowledge dissemination.
A Jaubert, M. Lorblanchet, H. Laville, R. Slott Moller, A. Turq et J.P. Brugat : Les chasseurs d'aurochs de La Borde. Un site du paléolithique moyen (Livernon, Lot)

Monnier Jean Laurent. A Jaubert, M. Lorblanchet, H. Laville, R. Slott Moller, A. Turq et J.P. Brugat : Les chasseurs d'aurochs de La Borde. Un site du paleolithique moyen (Livernon, Lot). In: Revue archeologique de l'ouest, tome 8, 1991. p. 195.
Auto-Calibration and Three-Dimensional Reconstruction for Zooming Cameras

This dissertation proposes new algorithms to recover the calibration parameters and 3D structure of a scene, using 2D images taken by uncalibrated stationary zooming cameras. This is a common configuration, usually encountered in surveillance camera networks, stereo camera systems, and event monitoring vision systems. This problem is known as camera auto-calibration (also called self-calibration) and the motivation behind this work is to obtain the Euclidean three-dimensional reconstruction and metric measurements of the scene, using only the captured images. Under this configuration, the problem of auto-calibrating zooming cameras differs from the classical auto-calibration problem of a moving camera in two major aspects. First, the camera intrinsic parameters are changing due to zooming. Second, because cameras are stationary in our case, using classical motion constraints, such as a pure translation for example, is not possible. In order to simplify the non-linear complexity of this problem, i.e., auto-calibration of zooming cameras, we have followed a geometric stratification approach. In particular, we have taken advantage of the movement of the camera center, that results from the zooming process, to locate the plane at infinity and, consequently to obtain an affine reconstruction. Then, using the assumption that typical cameras have rectangular or square pixels, the calculation of the camera intrinsic parameters have become possible, leading to the recovery of the Euclidean 3D structure. Being linear, the proposed algorithms were easily extended to the case of an arbitrary number of images and cameras. Furthermore, we have devised a sufficient constraint for detecting scene parallel planes, a useful information for solving other computer vision problems.
Mathematics of program construction : Third International Conference, MPC '95, Kloster Irsee, Germany, July 17-21, 1995 : proceedings

Towards automatic parallelization of logic programs. - Functional Algorithm Design. - Mathematics of software engineering. - Program construction in intuitionistic Type Theory. - Computer-aided computing. - Derivation of parallel algorithms from functional specifications to CSP processes. - Architecture independent massive parallelization of divide-and-conquer algorithms. - Exploring summation and product operators in the refinement calculus. - An action system specification of the caltech asynchronous microprocessor. - Formal derivation of CSP programs from temporal specifications. - A compositional proof system for asynchronously communicating processes. - A graphical calculus. - A simple, efficient, and flexible implementation of flexible arrays. - Induction and recursion on datatypes. - Program construction by parts. - An initial-algebra approach to directed acyclic graphs. - Algebraic proof assistants in HOL. - Angelic termination in Dijkstra's calculus. - Extracting programs with exceptions in an impredicative type system. - Synthesizing proofs from programs in the Calculus of Inductive Constructions. - A general scheme for breadth-first graph traversal. - Specware: Formal support for composing software. - A refinement relation supporting the transition from unbounded to bounded communication buffers. - ImpUNITY: UNITY with procedures and local variables.
Numerical Analysis for Relevant Features in Intrusion Detection (NARFid)

Abstract : This thesis evaluates the usefulness of good feature subsets for the general classification task of identifying cyber attacks and network services. The generality of the selected features elucidates the relevance or irrelevance for the classification task of intrusion detection. Additionally, the work provides an extension to assessing features by inter-class separability(Bhattacharyya Coefficient) for multiple class problems, which intends to select the best-performing features for all of the classes.
JTCP: una implementación de TCP orientada a la evaluación de técnicas de control de congestión

TCP is a widely spread transport protocol on the Internet; great part of the traffic comes from applications that use TCP. This feature indicates the importance of the rate to which TCP introduces their data in the network. The rate of transmission must adapt to the requirements of the application, without saturating the network. Data rates that do not adapt to the conditions of the network could make it collapse. TCP has been adapted successful to fulfill their objectives: to obtain an efficient use of the network and to offer a suitable service to the users. This adaptation has been consequence of a considerable research activity, consistent mainly in the development of congestion control mechanisms. This work presents the development of JTCP, a protocol with the basic functionality of TCP, portable and easily modifiable. JTCP is totally implemented in Java, and is independent of the operating system that supports it. JTCP design allows to easily interchange congestion control techniques used by the protocol. Its portability facilitates the test of those congestion control techniques between any pair of hosts connected to the Internet. The objective of the present work is to make possible the evaluation of alternatives for congestion control in TCP, in different operation environments, such as those with high bandwidth (optic fiber links) or those with a high rate of errors (wireless links).
Simulating the Inverse Kinematic Model of a Robot through Artificial Neural Networks： Complementing the Teaching of Robotics

Abstract: Teaching robotics necessarily involves the study of the kinematic models of robot manipulators. In turn, the kinematics of a robot manipulator can be described by its forward and reverse models. The inverse kinematic model, which provides the status of the joints according to the desired position for the tool of the robot, is typically taught and described in robotics classes through an algebraic way. However, the algebraic representation of this model is often difficult to obtain. Thus, although it is unquestionable the need for the accurate determination of the inverse kinematic model of a robot, the use of ANNs (artificial neural networks) in the design stage can be very attractive, because it allows us to predict the behavior of the robot before the formal development of its model. In this way, this paper presents a relatively quick way to simulate the inverse kinematic model of a robot, thereby allowing the student to have an overview of the model, coming to identify points that should be corrected, or that can be optimized in the structure of a robot.
Mitosis based speculative multithreaded architectures

In the last decade, industry made a right-hand turn and shifted towards multi-core processor designs, also known as Chip-Multi-Processors (CMPs), in order to provide further performance improvements under a reasonable power budget, design complexity, and validation cost. Over the years, several processor vendors have come out with multi-core chips in their product lines and they have become mainstream, with the number of cores increasing in each processor generation. Multi-core processors improve the performance of applications by exploiting Thread Level Parallelism (TLP) while the Instruction Level Parallelism (ILP) exploited by each individual core is limited. These architectures are very efficient when multiple threads are available for execution. However, single-thread sections of code (single-thread applications and serial sections of parallel applications) pose important constraints on the benefits achieved by parallel execution, as pointed out by Amdahl’s law. Parallel programming, even with the help of recently proposed techniques like transactional memory, has proven to be a very challenging task. On the other hand, automatically partitioning applications into threads may be a straightforward task in regular applications, but becomes much harder for irregular programs, where compilers usually fail to discover sufficient TLP. In this scenario, two main directions have been followed in the research community to take benefit of multi-core platforms: Speculative Multithreading (SpMT) and Non-Speculative Clustered architectures. The former splits a sequential application into speculative threads, while the later partitions the instructions among the cores based on data-dependences but avoid large degree of speculation. Despite the large amount of research on both these approaches, the proposed techniques so far have shown marginal performance improvements. In this thesis we propose novel schemes to speed-up sequential or lightly threaded applications in multi-core processors that effectively address the main unresolved challenges of previous approaches. In particular, we propose a SpMT architecture, called Mitosis, that leverages a powerful software value prediction technique to manage inter-thread dependences, based on pre-computation slices (p-slices). Thanks to the accuracy and low cost of this technique, Mitosis is able to effectively parallelize applications even in the presence of frequent dependences among threads. We also propose a novel architecture, called Anaphase, that combines the best of SpMT schemes and clustered architectures. Anaphase effectively exploits ILP, TLP and Memory Level Parallelism (MLP), thanks to its unique finegrain thread decomposition algorithm that adapts to the available parallelism in the application.
Investigation of the Processing Time of Dynamic Routing and Wavelength Assignment (DRWA) Algorithms

In the continuous vacuum forming of articles from a fibrous slurry, e.g. from paper pulp, a plurality of two-piece hinged moulds are mounted on a transport apparatus 1 which transports the moulds stepwise in a loop. The internal surfaces of the moulds are defined by wire gauze of mesh 107,109 and the moulds are connected to a source of suction. The moulds, with the suction applied, are moved through the fibrous slurry contained in a tank 43, whereupon fibres are deposited on the mesh 107,109, much of the water being drawn off by the suction. The mould passes through a drying station, where warm air is sucked through the mould, further drying the article. The transport apparatus 1 is movable pivotably about an axis 6 by means of a fluid-operated ram 25. At the top of the path, the mould and the article therein are lowered onto a pin 61, a plurality of which are situated on an endless conveyor 59. By means of rods 81,81', attached to the mould pieces, the mould is opened, and the transport apparatus is lifted, leaving the article on the pin 61. After cleaning with a spray 65, the mould is then ready to undergo another cycle.
John Hines / Alex Bayliss (Hrsg.), Anglo-Saxon Graves and Grave Goods of the 6th and 7th Centuries AD. A Chronological Framework

Rezension zu: John Hines / Alex Bayliss (Hrsg.), Anglo-Saxon Graves and Grave Goods of the 6th and 7th Centuries AD. A Chronological Framework. The Society for Medieval Archaeology Monograph Band 33. The Society for Medieval Archaeology, London 2013. ISBN 978-1- 909662-06-3. XIX + 595 Seiten mit 480 Abbildungen, 129 Tabellen und 24 Abbildungen
STUDIES OF THE EARLY MATH STRATEGY: A LONGITUDINAL STUDY OF TEACHER DEVELOPMENT

Christine Suurtamm, Nancy Vezina, Barbara Graves, Marie Josee Berger, Renee Forgette-Giroux and Claire Maltais Faculty of Education, University of OttawaStudies of the Early Math Strategy is an examination of a province-wide implementation of a teacher development strategy designed by the Ontario Ministry of Education. This program is designed to increase the elementary teacher’ understanding of mathematics and to model and develop effective instructional practices. This paper presents a discussion of the preliminary stages of a large-scale research project aimed at studying this implementation process. Mathematics education poses substantial challenges for elementary teachers, who often lack the knowledge of mathematics required to effectively implement reform-oriented mathematics programs (Ball, 1990; Ball, Lubienski & Mewborn, 2001). Teachers need a sound understanding of mathematics and of how children learn mathematics to probe student thinking and to recognize the important concepts that are inherent in students’ mathematical activity (Ball, 1990; Kahan, Cooper & Bethea, 2003). Recognizing and developing teachers’ understanding of mathematics and of how children develop mathematics concepts is essential to improving student learning. The important role of teachers is a message that resonates in the implementation plan of this initiative. The implementation plan aims to develop teacher expertise and to provide opportunities for teachers to connect new understanding with work in their own classrooms. Our research project gathers both quantitative and qualitative data through questionnaires, interviews, analysis of training, and case studies. It is aimed at understanding the teaching of mathematics, the instructional strategies that teachers use, and the types of professional development and resources they find useful. As this project is in its initial stages, we plan to present a research report that will discuss the research design in further detail and will provide preliminary results of the analysis of the initial questionnaire and training sessions.References:
Developing an Ontology for Wood-related Industry : An Experience Report

Ontologies are widely used as a technique for representation and reuse of knowledge. This paper summarizes experiences and results of a project within ontology development, with wood-related industry as application sector. One major aspect of the project was the selection of a suitable methodology for ontology development. In a literature study existing methodologies were analyzed with respect to their suitability for small-scale application contexts. As no existing methodology was fully adequate, an improved methodology was proposed. The main intention was to reduce development time and effort to meet the demands of small-scale application contexts. The improved methodology was applied and evaluated in the project, i.e. in the development of an ontology for wood-related industry. The main conclusion is that the methodology was adequate for the project, but some aspects could be elaborated and further investigated, such as reuse of already existing ontologies.
A Dependency Projection Model for Phrase-Based SMT

Much of the information that is relevant for linguistic correctness in a sentence is best represented in hierarchical structures such as syntax trees. By contrast, the strongest models in statistical machine translation (SMT) represent sentences as linear sequences of words. This is especially true of phrase-based SMT (Koehn et al., 2003), an approach to SMT that delivers state-of-the-art performance for many language pairs, but treats sentences as mere sequences of words with no internal structure. While phrase-based SMT is competitive with SMT approaches using context-free grammars to represent translation units (Chiang, 2007), it has notorious difficulties with linguistic features that depend on hierarchical relations such as number and gender agreement, especially if the two words that should agree with each other are separated by some intervening text. Here, we present some preliminary work on integrating syntactic knowledge into phrase-based SMT. Unlike previous work on syntactic language modelling such as that by Schwartz et al. (2011), we do not try to create parse trees for the machine translation output. Instead, we parse the input sentences with a dependency parser and use word alignments to link output words to input words. Our model then captures relations between the target language words corresponding to words engaged in particular source-side syntactic relations.