Miracle-dz/UniFAR-FTUs huggingface dataset:
Towards realistic vehicular network simulation models

Recently, testbed deployments using real IEEE 802.11p devices have allowed making performance measurements using this technology. The results obtained in those experiments evidence that lots of factors influence wireless communications: small obstacles like trees, small moving obstacles like cars, or large obstructions like buildings. All of them affect the transmission range, reducing the communication possibilities. Based on the insight provided by these results, in this work we propose a propagation model that attempts to replicate all these effects in simulation in order to increase the accuracy of experiments. Our solution combines (i) an attenuation model that replicates transmission range and fading behavior of real 802.11p devices, both in line-of-sight conditions and when obstructed by small obstacles, and (ii) a visibility model to deal with large architectonic obstacles, such as buildings. Our model was evaluated using the OMNeT++ platform, and results show that having the exact building positions and shapes is a critical parameter, introducing performance differences of up to 50% compared to simpler models.
An EFSM-based test generation for validation of SDL specifications

Existing techniques for testing an SDL specification mainly allow for either black box simulation or conformance testing to verify that the behavior of an implementation matches its corresponding model. However, this relies on the potentially hazardous assumption that the model is completely correct. We propose a test generation framework that can accomplish conformance verification as well as coverage criteria-driven white box testing of the specification itself. This approach builds on earlier work which established how to translate SDL processes into standard EFSMs and identify "hot spots" - nodes or edges in the EFSM which should be prioritized during testing to effectively increase coverage. Our technique generates test sequences intended to cover selected hot spots; we address the possible infeasibility of such a test sequence by allowing for its rejection decided by a constraint solver and re-generation of an alternate test sequence to the hot spot. In this paper, we present our EFSM translation and test generation tool and provide a case study demonstrating the effectiveness of our coverage-based test sequence selection.
Minecraft as an Experimental World for AI in Robotics

Performing experimental research on robotic platforms involves numerous practical complications, while studying collaborative interactions and efﬁciently collecting data from humans beneﬁt from real time response. Roboticists can circumvent some complications by using simulators like Gazebo (Koenig and Howard 2004) to test algorithms and building games like the Mars Escape game to collect data (Chernova, DePalma, and Breazeal 2011). Making use of existing resources for simulation and game creation requires the development of assets and algorithms along with the recruitment and training of users. We have created a Minecraft mod called BurlapCraft which enables the use of the reinforcement learning and planning library BURLAP (MacGlashan 2015) to model and solve different tasks within Minecraft. BurlapCraft makes AI-HRI development easier in three core ways: the underlying Minecraft environment makes the construction of experiments simple for the developer and so allows the rapid prototyping of experimental setup; BURLAP contributes a wide variety of extensible algorithms for learning and planning, allowing easy iteration and development of task models and algorithms; and the fa-miliarity and ubiquity of Minecraft trivializes the recruitment and training of users. To validate BurlapCraft as a platform for AI development, we demonstrate the execution of A* (Hart, Nilsson, and Raphael 1968), BFS, RMax (Brafman and Tennenholtz 2003), language understanding, and learning language groundings from user demonstrations in ﬁve Minecraft “dungeons. ”
Variability of young stars: determination of rotational periods of weak-line T Tauri stars in the Cepheus-Cassiopeia star-forming region

We report on observation and determination of rotational periods of ten weak-line T Tauri stars in the Cepheus-Cassiopeia star-forming region. Observations were carried out with the Cassegrain-Teleskop-Kamera (CTK) at University Observatory Jena between 2007 June and 2008 May. The periods obtained range between 0.49 d and 5.7 d, typical for weak-line and post T Tauri stars (© 2009 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)
Deep inelastic scattering off a N=4 SYM plasma at strong coupling

By using the AdS/CFT correspondence we study the deep inelastic scattering of an R-current off a N=4 supersymmetric Yang-Mills (SYM) plasma at finite temperature and strong coupling. Within the supergravity approximation valid when the number of colors is large, we compute the structure functions by solving Maxwell equations in the space-time geometry of the AdS_5 black three-brane. We find a rather sharp transition between a low energy regime where the scattering is weak and quasi-elastic, and a high-energy regime where the current is completely absorbed. The critical energy for this transition determines the plasma saturation momentum in terms of its temperature T and the Bjorken x variable: Q_s=T/x. These results suggest a partonic picture for the plasma where all the partons have transverse momenta below the saturation momentum and occupation numbers of order one.
Privacy vs Location Awareness

The usage of location information to adapt the applications to the current location and provide the user information that is relevant to the current situation is a fascinating concept. It is based on the fact that the relevance of the information is closely related to the location. Privacy of the location information is a very important question in combination with the location awareness. Failure to protect the privacy of the location information of the users can have enormous consequences, and even lead to an Orwellian society.
Generically extending anonymization algorithms to deal with successive queries

This paper addresses the scenario of multi-release anonymization of datasets. We consider dynamic datasets where data can be inserted and deleted, and view this scenario as a case where each release is a small subset of the dataset corresponding, for example, to the results of a query. Compared to multiple releases of the full database, this has the obvious advantage of faster anonymization. We present an algorithm for post-processing anonymized queries that prevents anonymity attacks using multiple released queries. This algorithm can be used with several distinct protection principles and anonymization algorithms, which makes it generic and flexible. We give an experimental evaluation of the algorithm and compare it to $m$-invariance both in terms of efficiency and data quality. To this end, we propose two data quality metrics based on Shannon's entropy, and show that they can be seen as a refinement of existing metrics.
The rank convergence of HITS can be slow

We prove that HITS, to "get right" h of the top k ranked nodes of an N>=2k node graph, can require h^(Omega(N h/k)) iterations (i.e. a substantial Omega(N h log(h)/k) matrix multiplications even with a "squaring trick"). Our proof requires no algebraic tools and is entirely self-contained.
GMM for Discrete Choice Models: A Capital Accumulation Application

This paper studies capital adjustment costs. Our goal here is to characterize these adjustment costs, which are important for understanding both the dynamics of aggregate investment and the impact of various policies on capital accumulation. Our estimation strategy searches for parameters that minimize ex post errors in an Euler equation. This strategy is quite common in models for which adjustment occurs in consecutive periods. Here, we extend that logic to the estimation of parameters of dynamic optimization problems in which non-convexities lead to extended periods of investment inactivity.
An Effective Scheme for Location Privacy in VANETs

Location privacy is an important concern in VANETs(Vehicular Ad hoc Networks). Anonymity is one of commonly adopted solution to protect location privacy. In this paper, we present a mechanism based on an ID-based cryptosystem in order to ensure vehicles’ anonymity by pseudonyms. In this mechanism, we adopt Pseudonyms Synchronously Change ( ) scheme, which improves anonymity. In the schemes, vehicles change pseudonym at different times and locations. Simulation result demonstrates our schemes have superior performance on location privacy preservation
Two-stage multivariable IMC Antiwindup (TMIA) control of a Quadruple Tank process using a PLC

Actuator saturation is a common phenomenon in the control of multivariable systems which causes two major problems for control engineers, namely windup and directionality. This paper focuses on a Two-stage Multivariable IMC Antiwindup (TMIA) structure for open-loop stable plants. This IMC-based control structure is of interest because it tackles the aforementioned problems in an intuitive and easy to tune way. The highlight of this structure is the solution of two low-order quadratic programs to control both steady-state and transient behaviours of the plant. The controller is tested by application to a multivariable Quadruple Tank process controlled by a PLC. The TMIA structure is found to outperform its IMC counterparts in handling windup and directionality. Results obtained demonstrate the realizability of the advanced control technique on an off-the-shelf industrial PLC. Thus the TMIA structure is presented as a competitive alternative in terms of tuning transparency and reduced computations to other advanced control techniques such as MPC which are limited by the low computational power offered by standard PLCs.
Abstracting access patterns of dynamic memory using regular expressions

Unless the speed gap between CPU and memory disappears, efficient memory usage remains a decisive factor for performance. To optimize data usage of programs in the presence of the memory hierarchy, we are particularly interested in two compiler techniques: pool allocation and field layout restructuring. Since foreseeing runtime behaviors of programs at compile time is difficult, most of the previous work relied on profiling. On the contrary, our goal is to develop a fully automatic compiler that statically transforms input codes to use memory efficiently. Noticing that regular expressions, which denote repetition explicitly, are sufficient for memory access patterns, we describe how to extract memory access patterns as regular expressions in detail. Based on static patterns presented in regular expressions, we apply pool allocation to repeatedly accessed structures and exploit field layout restructuring according to field affinity relations of chosen structures. To make a scalable framework, we devise and apply new abstraction techniques, which build and interpret access patterns for the whole programs in a bottom-up fashion. We implement our analyses and transformations with the CIL compiler. To verify the effect and scalability of our scheme, we examine 17 benchmarks including 2 SPECINT 2000 benchmarks whose source lines of code are larger than 10,000. Our experiments demonstrate that the static layout transformations for dynamic memory can reduce L1D cache misses by 16% and execution times by 14% on average.
A Blind Post-FFT User-by-user Beamforming Algorithm for Multiuser OFDM Systems

Recently, Peng and Chi et al. proposed a block-by-block blind post-FFT multistage beamforming algorithm (MSBFA) based on subcarrier averaging for a multiuser orthogonal frequency division multiplexing (OFDM) system, which works well under multipath block fading channels even in the presence of correlated paths. However, the MSBFA is a sequential path-by-path detection algorithm, thereby resulting in long detection latency as the total number of paths of all the active users is large. In this paper, a blind multistage user-by- user beamforming algorithm (UUBFA) is proposed, which, in contrast to the MSBFA, detects all the path signals for one individual user and meanwhile achieves the maximum diversity gain through a blind maximum ratio combining processing at each stage. In addition to achieving the same performance as the MSBFA, the parallel signal processing structure of the proposed UUBFA is well suited to software and hardware implementations.
Wii Remote calibration using the sensor bar

Wii Remote is the standard controller of the game console Nintendo Wii®. Despite its low cost, it has a very high performance and high resolution infrared camera. It also has a built-in chip for tracking up to 4 points from the infrared images. With these properties, the Wii Remote has attracted several attempts to calibrate and use them for metric 3D information. Thanks to Wii Remote's 4 point tracking hardware, people were able to calibrate Wii Remotes using carefully designed square patterns with infrared LEDs at each corner. However, it is not easy for average Wii Remote users to implement such calibration tools. In this paper, we give an overview of the current Wii Remote calibration implementations and present a novel method to fully calibrate multiple Wii Remotes using only two points, such as the LEDs of the Sensor Bar that comes with the Wii console. For the 3D reconstruction, only two Wii Remotes and a PC is needed. We also demonstrate the usability of a full 3D tracker with a multiplayer game that receives inputs from up to 4 users with only two Wii Remotes.
Lesion in Scalp and Skull as the First Manifestation of Hepatocellular Carcinoma

Hepatocellular carcinoma (HCC) is the most common primary tumor of the liver and the fifth most common cancer in the world. The lungs, bone, and lymph nodes are frequent sites of metastasis of HCC. The purpose of the present study is show that metastases, although rare, must be among the differential diagnosis of skin lesions and that a diagnostic research based on these findings can be conducted. The authors report a rare case of metastatic hepatocellular injury to the scalp and skull treated by a radical surgical approach. Excision of the lesion in the scalp was performed “en bloc. ” The tumor was supplied by the frontal branch of the superficial temporal artery. There are few case reports of metastatic HCC to scalp and skull; treatment of these lesions should be individualized in order to control symptoms, improve quality of life, and promote an increase in survival.
A Wide-Field Survey of the Fornax Dwarf Spheroidal Galaxy

The results of a photometric survey of the Fornax dwarf spheroidal galaxy are presented herein. Accurate photometry in two colors (V and I) was collected over a 10 deg2 area centered on the Fornax system with the aim of searching for extratidal structure. The data were complete to a magnitude of V = 20, or approximately 1 mag brighter than the Fornax red clump stars. Stars were selected with a color and magnitude lying near the Fornax red giant branch, thereby reducing contamination from the field-star population. We were thus able to probe the outer structure of this dwarf galaxy. Immediately visible was a shell-like structure located 1. °3 northwest from the center of Fornax, approximately 30′ beyond the nominal tidal radius at this position angle. We have measured the absolute visual magnitude of this feature to be MV ∼ -7. The feature is aligned with a previously reported shell (age ∼ 2 Gyr) located near the core radius of Fornax. A statistical analysis of the extratidal stellar distribution further revealed two lobes situated on the Fornax minor axis that are aligned with the two shell-like features. The two-lobed structure combined with the two shells provide strong evidence that Fornax has experienced a merger event in the relatively recent past.
XML Stream Processing Using a Lazy Concurrent Language

Motivated by previous work on XML stream processing, we noticed that programmers need concurrency to save space, especially in a lazy language. User-controllable concurrency provides the possibility of reducing space usage in many programs. With lower garbage-collection overhead resulting from concurrent execution, the elapsed time of programs, stream processing ones in particular, is tremendously decreased. The challenge is how to encapsulate concurrency without compromising expressiveness and flexibility of languages. We propose the idea of pushing datatypes — when a pushing closure is demanded, all expressions referring to it are evaluated concurrently to weak head normal forms. The closure is no more alive and may thus be garbage collected. Semantically, it is a non-intruding extension because it does not change the denotational semantics of an expression. It is also easy to be implemented on top of a language providing concurrent threads and inter-thread synchronisation. We have developed a prototype using Haskell and showed pushing datatypes can be used to effectively reduce space usage and thus result in shorter elapsed time in many programs.
Maximizing the number of unused bins

We analyze the approximation behaviour of some of the best-known polynomial time approximation algorithms for bin-packing under an approximation criterion, called differential ratio. This measure has originally been introduced by Ausiello, D'Atri and Protasi and more recently revisited, in a more systematic way, by the first and the third authors of the present paper.
Attacker-Parametrised Attack Graphs

—Computer network attackers chain system exploits together to achieve their goals, which range from stealing data to corrupting systems. Attack graphs represent these paths through the network, and provide the basis for calculating many security metrics. In this paper, we seek to extend graph-based analysis from the consideration of single graphs to the consideration of multiple. By performing analysis on many graphs at once, we consider the range of threats faced and avoid the downsides of several current techniques, which focus purely on known and expected attackers. In particular, we propose a novel method of generating a set of attack graphs, parametrised by attacker proﬁles. Our technique would enable security analysts to consider the security of their network from the perspective of many attackers simultaneously. This contrasts with existing techniques, which typically analyse attacker-independent graphs or graphs constructed around predeﬁned attacker proﬁles. We analyse the resulting set of graphs ﬁrst through deterministic methods and then using a probability measure.
Feedback Given By The Teacher On Students' Writing At The Seventh Grade Of Smp Negeri 2 Juwiring

The objectives of the study are to describe the types of teacher’s feedback on the students’ writing at the seventh grade of SMP Negeri 2 Juwiring and the students’ responses toward the teacher’s feedback. This study was qualitative research that the data were from field note and transcripts containing the information about the types of teacher’s feedback and students’ responses to the teacher’s feedback. And the data source was teaching learning process, English teacher, and the students in class A. Method of collecting the data was observation and interview. Technique for analyzing the data was data reduction, data display, and drawing conclusion and verification. The results of this study showed that the teacher used oral and written feedback and both were including corrective feedback. The feedback was given directly and indirectly. The students’ responses towards teacher’s feedback were by asking, accepting, and ignoring teacher’s feedback.
Formation of Copper Nickel Bimetallic Nanoalloy Film Using Precursor Inks

Precursor (Metal-organic decomposition (MOD)) inks are used to fabricate 2D and 3D printed conductive structures directly onto a substrate. By formulating a nanoalloy structure containing multiple metals, the opportunity to modify chemical and physical properties exists. In this paper, a copper-nickel bimetallic nanoalloy film was fabricated by mixing copper and nickel precursor inks and sintering them in vacuum. The individual elemental inks were formulated and characterized using SEM, EDS, and XRD. During thermal processing, elemental copper forms first and is followed by the formation of bimetallic copper-nickel alloy. The encapsulation of the underlying copper by the nickel-rich alloy provides excellent oxidation resistance. No change in film resistance was observed after the film was exposed to an oxygen plasma. Nanoalloy films printed using reactive metallic inks have a variety of important applications involving local control of alloy composition. Examples include facile formation of layered nanostructures, and electrical conductivity with oxidative stability.
ELECTRON MICROSCOPE RADIOAUTOGRAPHIC STUDY OF GLYCOGEN SYNTHESIS IN THE RABBIT RETINA

Glycogen is present in the rabbit retina in monoparticulate form. Beta particles ( approximately 229 A) are abundant in Müller cell cytoplasm, particularly in its inner portion, decreasing in number outwards along the cell. They are slightly larger ( approximately 250 A) and much scarcer in neurons, though regularly present in the juxtanuclear Golgi region of ganglion cells. When the retina was incubated in a glucose-free medium, it was rapidly depleted of native glycogen. On further incubation in medium containing glucose-(3)H plus unlabeled glucose, glycogen reappeared in the form of beta particles of the same size and distribution as native ones, while radioautography revealed the appearance of amylase-labile radioactivity in the same locations. This newly formed glycogen was not associated with any particular organelle. The rate of synthesis, as judged from the amount of radioactivity, was high in the inner portion of Müller cells and declined uniformly toward the cell outer end, following a logarithmic gradient. The rate of synthesis was low in ganglion cells, at best approaching values in the outer portion of Müller cells. The concentration of glycogen in the inner portion of Müller cells is consistent with the view that it may be the source of glucose for the anaerobic glycolysis prevailing in the inner retina.
Similarity-Based Alignment of Monolingual Corpora for Text Simplification Purposes

Comparable or parallel corpora are beneficial for many NLP tasks. The automatic collection of corpora enables large-scale resources, even for less-resourced languages, which in turn can be useful for deducing rules and patterns for text rewriting algorithms, a subtask of automatic text simplification. We present two methods for the alignment of Swedish easy-to-read text segments to text segments from a reference corpus. The first method (M1) was originally developed for the task of text reuse detection, measuring sentence similarity by a modified version of a TF-IDF vector space model. A second method (M2), also accounting for part-of-speech tags, was developed, and the methods were compared. For evaluation, a crowdsourcing platform was built for human judgement data collection, and preliminary results showed that cosine similarity relates better to human ranks than the Dice coefficient. We also saw a tendency that including syntactic context to the TF-IDF vector space model is beneficial for this kind of paraphrase alignment task.