Miracle-dz/UniFAR-FTUs huggingface dataset:
E-LDAT: a lightweight system for DDoS flooding attack detection and IP traceback using extended entropy metric

Distributed denial-of-service DDoS attacks cause havoc by exploiting threats to Internet services. In this paper, we propose E-LDAT, a lightweight extended-entropy metric-based system for both DDoS flooding attack detection and IP Internet Protocol traceback. It aims to identify DDoS attacks effectively by measuring the metric difference between legitimate traffic and attack traffic. IP traceback is performed using the metric values for an attack sample detected by the detection scheme. The method uses a generalized entropy metric with packet intensity computation on the sampled network traffic with respect to time. The E-LDAT system has been evaluated using several real-world DDoS datasets and outperforms competing methods when detecting four classes of DDoS flooding attacks, including constant rate, pulsing rate, increasing rate and subgroup attacks. The IP traceback model is also evaluated using NetFlow data in near real-time and performs well in large-scale attack networks with zombies. Copyright © 2016 John Wiley & Sons, Ltd.
System Level Metrics for Software Development Estimation

Previous empirical observations on the development of software systems indicate that the effort required for developing software is primarily driven by the size of the software which is measured by either the source line of code (SLOC) or function based metrics, such as Function Points. However, since most large scale systems today are more software intensive, where with the growing complexity and coupling nature between hardware and software, estimating development effort for these systems requires metrics that go beyond software oriented sizing techniques. In this spirit we propose a set of four system level metrics that provide a better indication of software complexity and in turn software development effort. These metrics are (1) requirements, (2) interfaces, (3) algorithms, and (4) operational scenarios.
Functional and structural effects of seven-residue deletions on the coiled-coil cytoplasmic domain of a chemoreceptormmi

Chemoreceptors transmit signals from the environment to the flagellar motors via a histidine kinase that controls the phosphorylation level of the effector protein CheY. The cytoplasmic domain of chemoreceptors is strongly conserved and consists of a long alpha-helical hairpin that forms, in the dimer, a coiledcoil four-helix bundle. Changes in this domain during evolution are characterized by the presence of sevenresidue insertions/deletions located symmetrically with respect to the hairpin turn, suggesting that specific interactions between the helices that form the hairpin are required for function. We assessed the impact of seven-residue deletions on the signalling ability and higher-order organization of the serine chemoreceptor from Escherichia coli. Our results indicate that symmetry alterations between the two branches of the cytoplasmic hairpin seriously compromise chemoreceptor function. Shorter functional versions of Tsr with symmetrical deletions form mixed trimers of dimers when coexpressed with Tar, the aspartate receptor of E. coli. However, Tar function in those cells is impaired, suggesting that the length difference between receptors introduces nonfunctional distortions into the chemoreceptor cluster. This observation is reinforced by the analysis of coexpression of Tar with chemoreceptors from Rhodobacter sphaeroides that naturally belong to a shorter-length class.
Incremental Enhanced Artificial Bee Colony Algorithm with Local Search

Swarm intelligence is the collective problem solving behavior of groups of artificial agents. These agents local interaction with each other can be negative, positive or neutral. Here positive interaction helps agents to solve a problem while negative interaction block the agents for solving problem and neutral interaction does not affect the swarm‟s performance. In this work, incremental enhanced ABC algorithm with local search is used for reducing negative interaction without complexifying the agent‟s behavior. Here in the enhanced artificial bee colony algorithm, one additional phase in the form of mutation operator is used. With the help of mutation operator, algorithm may not be trapped into local optima due to the chance of changing local best position. The experimental results show that the performance of proposed algorithm and the proposed algorithm is compared with standard ABC algorithm, Artificial Bee Colony algorithm with mutation algorithm.
Appliance Commitment for Household Load Scheduling

This paper presents a novel appliance commitment algorithm that schedules thermostatically controlled household loads based on price and consumption forecasts considering users' comfort settings to meet an optimization objective such as minimum payment or maximum comfort. The formulation of an appliance commitment problem is described using an electrical water heater load as an example. The thermal dynamics of heating and coasting of the water heater load is modeled by physical models; random hot water consumption is modeled with statistical methods. The models are used to predict the appliance operation over the scheduling time horizon. User comfort is transformed to a set of linear constraints. Then, a novel linear-sequential-optimization-enhanced, multiloop algorithm is used to solve the appliance commitment problem. The simulation results demonstrate that the algorithm is fast, robust, and flexible. The algorithm can be used in home/building energy-management systems to help household owners or building managers to automatically create optimal load operation schedules based on different cost and comfort settings and compare cost/benefits among schedules.
Determination of Yarn Interlacing Frequency of Triangular Interlacing Nozzles through a Compressible Flow Simulation

A numerical approach to predict the yarn interlacing frequency of triangular interlacing nozzle is discussed in this paper. The inviscid, compressible flow field inside air nozzles is computed through solving the steady continuity, momentum and energy equations with a finite volume method. A mathematical model for the prediction of yarn interlacing frequency of air nozzle is proposed, which is determined by the vorticity strength, air density, yarn density and yarn feed speed. The influences of inlet size, inlet pressure and inlet angle on the yarn interlacing frequency of an air nozzle series are studied. The numerical results are validated by experimental measurements and show good prediction accuracy for yarn interlacing frequency. The shock interaction inside the expansion chamber explains the nonlinear behavior of the yarn interlacing frequency curve under various operation conditions. For air nozzles only differing in their inlet diameter, an optimal size of inlet diameter can be attained for a given pressure. Insufficient or excessive size of inlet opening leads to a weak interaction of shock surface inside the expansion chamber, and results in a lower number of knots per unit length. For a given nozzle, an optimal inlet pressure can be obtained, which yields the largest yarn interlacing frequency per unit pressure. A minor increase in the yarn interlacing frequency is achieved for the inlet pressure greater than the critical pressure because the upper-lower shock surface has been completely developed. For air nozzles only differing in their inlet angle, an optimal inlet angle can be found at a given pressure, which seems insensitive to the inlet pressure. The proposed approach is proven to be effective and accurate in predicting the yarn interlacing frequency of air-jet nozzles, and also very promising for the design of air-jet interlacing nozzles to evaluate yarn interlacing frequency under different working conditions.
Planar Drawings of Plane Graphs

Given a plane graph G, we wish to nd a drawing of G in the plane such that the vertices of G are represented as grid points, and the edges are represented as straight-line segments between their endpoints without any edge-intersection. Such drawings are called planar straight-line drawings of G. An additional objective is to minimize the area of the rectangular grid in which G is drawn. In this paper rst we review known two methods to nd such drawings, then explain a hidden relation between them, and nally survey related results. key words: planar graph, graph drawing, algorithm, graph theory
Robust Pedestrian Detection by Combining Visible and Thermal Infrared Cameras

With the development of intelligent surveillance systems, the need for accurate detection of pedestrians by cameras has increased. However, most of the previous studies use a single camera system, either a visible light or thermal camera, and their performances are affected by various factors such as shadow, illumination change, occlusion, and higher background temperatures. To overcome these problems, we propose a new method of detecting pedestrians using a dual camera system that combines visible light and thermal cameras, which are robust in various outdoor environments such as mornings, afternoons, night and rainy days. Our research is novel, compared to previous works, in the following four ways: First, we implement the dual camera system where the axes of visible light and thermal cameras are parallel in the horizontal direction. We obtain a geometric transform matrix that represents the relationship between these two camera axes. Second, two background images for visible light and thermal cameras are adaptively updated based on the pixel difference between an input thermal and pre-stored thermal background images. Third, by background subtraction of thermal image considering the temperature characteristics of background and size filtering with morphological operation, the candidates from whole image (CWI) in the thermal image is obtained. The positions of CWI (obtained by background subtraction and the procedures of shadow removal, morphological operation, size filtering, and filtering of the ratio of height to width) in the visible light image are projected on those in the thermal image by using the geometric transform matrix, and the searching regions for pedestrians are defined in the thermal image. Fourth, within these searching regions, the candidates from the searching image region (CSI) of pedestrians in the thermal image are detected. The final areas of pedestrians are located by combining the detected positions of the CWI and CSI of the thermal image based on OR operation. Experimental results showed that the average precision and recall of detecting pedestrians are 98.13% and 88.98%, respectively.
Msb1 Interacts with Cdc42, Boi1, and Boi2 and May Coordinate Cdc42 and Rho1 Functions during Early Stage of Bud Development in Budding Yeast

Msb1 is not essential for growth in the budding yeast Saccharomyces cerevisiae since msb1Δ cells do not display obvious phenotypes. Genetic studies suggest that Msb1 positively regulates Cdc42 function during bud development, since high-copy MSB1 suppressed the growth defect of temperature-sensitive cdc24 and cdc42 mutants at restrictive temperature, while deletion of MSB1 showed synthetic lethality with cdc24, bem1, and bem2 mutations. However, the mechanism of how Msb1 regulates Cdc42 function remains poorly understood. Here, we show that Msb1 localizes to sites of polarized growth during bud development and interacts with Cdc42 in the cells. In addition, Msb1 interacts with Boi1 and Boi2, two scaffold proteins that also interact with Cdc42 and Bem1. These findings suggest that Msb1 may positively regulate Cdc42 function by interacting with Cdc42, Boi1, and Boi2, which may promote the efficient assembly of Cdc42, Cdc24, and other proteins into a functional complex. We also show that Msb1 interacts with Rho1 in the cells and Msb1 overproduction inhibits the growth of rho1-104 and rho1-3 but not rho1-2 cells. The growth inhibition appears to result from the down-regulation of Rho1 function in glucan synthesis, specifically during early stage of bud development. These results suggest that Msb1 may coordinate Cdc42 and Rho1 functions during early stage of bud development by promoting Cdc42 function and inhibiting Rho1 function. Msb1 overproduction also affects cell morphology, septin organization, and causes increased, aberrant deposition of 1,3-β-glucan and chitin at the mother-bud neck. However, the stimulation of glucan synthesis mainly occurs during late, but not early, stage of bud development.
Muons and thermal neutrons SEU characterization of 28nm UTBB FD-SOI and Bulk eSRAMs

This work reports the complete SEU experimental characterization in 28nm commercial UTBB FDSOI and Bulk technologies subjected to low-energy muons (μ+) and thermal neutrons. FDSOI technology demonstrates a 10x SER decrease for thermal neutrons and a more than 10x SEU occurrence reduction for muons with respect to Bulk technology, evidencing the beneficial role of the UTBB architecture on its radiation hardness level.
The Effect of Optic Disc Center Displacement on Retinal Nerve Fiber Layer Measurement Determined by Spectral Domain Optical Coherence Tomography

Purpose To investigate the effect of optic disc center displacement on retinal nerve fiber layer (RNFL) measurement determined by spectral domain optical coherence tomography (SD-OCT). Methods The optic disc center was manipulated at 1-pixel intervals in horizontal, vertical, and diagonal directions. According to the manipulated optic disc center location, the RNFL thickness data were resampled: (1) at a 3.46-mm diameter circle; and (2) between a 2.5-mm diameter circle and 5.4-mm square. Error was calculated between the original and resampled RNFL measurements. The tolerable error threshold of the optic disc center displacement was determined by considering test-retest variability of SD-OCT. The unreliable zone was defined as an area with 10% or more variability. Results The maximum tolerable error thresholds of optic disc center displacement on the RNFL thickness map were distributed from 0.042 to 0.09 mm in 8 directions. The threshold shape was vertically elongated. Clinically important unreliable zones were located: (1) at superior and inferior region in the vertical displacement; (2) at inferotemporal region in the horizontal displacement, and (3) at superotemporal or inferotemporal region in the diagonal displacement. The unreliable zone pattern and threshold limit varied according to the direction of optic disc displacement. Conclusions Optic disc center displacement had a considerable impact on whole RNFL thickness measurements. Understanding the effect of optic disc center displacement could contribute to reliable RNFL measurements.
Ellipsoidal set based robust particle filtering for recursive Bayesian state estimation

Particle filters have become an increasingly useful tool for recursive Bayesian state estimation, especially for nonlinear and non-Gaussian problems. Despite the large number of papers published on particle filters in recent years, one issue that has not been addressed to any significant degree is the robustness. This paper presents a deterministic approach that has emerged in the area of robust filtering, and incorporates it into particle filtering framework. In particular, an ellipsoidal set membership approach is used to define a feasible set for particle sampling that contains the true state of the system, and makes the particle filter robust against unknown but bounded uncertainties. Simulation results show that the proposed algorithm is more robust than the regular particle filter and its variants such as the extended Kalman particle filter.
Aspects of quality evaluation in linguistic descriptions of data

Quality evaluation is a fundamental problem in the field of linguistic description of data. In this work, we analyze the concept of quality and study different approaches to measure quality. Although most of the approaches considered focused on time series data, that are one of the most frequent datasets in real application domains, they can be used for quality assessment of linguistic descriptions generated for any type of data.
Check-ins in “Blau Space”: Applying Blau’s Macrosociological Theory to Foursquare Check-ins from New York City

Peter Blau was one of the first to define a latent social space and utilize it to provide concrete hypotheses. Blau defines social structure via social “parameters” (constraints). Actors that are closer together (more homogenous) in this social parameter space are more likely to interact. One of Blau’s most important hypotheses resulting from this work was that the consolidation of parameters could lead to isolated social groups. For example, the consolidation of race and income might lead to segregation. In the present work, we use Foursquare data from New York City to explore evidence of homogeneity along certain social parameters and consolidation that breeds social isolation in communities of locations checked in to by similar users. More specifically, we first test the extent to which communities detected via Latent Dirichlet Allocation are homogenous across a set of four social constraints—racial homophily, income homophily, personal interest homophily and physical space. Using a bootstrapping approach, we find that 14 (of 20) communities are statistically, and all but one qualitatively, homogenous along one of these social constraints, showing the relevance of Blau’s latent space model in venue communities determined via user check-in behavior. We then consider the extent to which communities with consolidated parameters, those homogenous on more than one parameter, represent socially isolated populations. We find communities homogenous on multiple parameters, including a homosexual community and a “hipster” community, that show support for Blau’s hypothesis that consolidation breeds social isolation. We consider these results in the context of mediated communication, in particular in the context of self-representation on social media.
Psychometric Properties of the Dutch National Prevalence Measurement of Care Problems Used to Measure Quality of Pressure Ulcer Care in Indonesian Hospitals

OBJECTIVE:To evaluate the psychometric properties of the Indonesian version of the Dutch National Prevalence Measurement of Care Problems. The questionnaire consists of 6 parts: patient characteristics (including pressure ulcer [PrU] risk; assessed by the Braden Scale) and care dependency (assessed by the Care Dependency Scale [CDS]), PrU categorization, prevention, treatment, and structural quality indicators at ward and hospital level. DESIGN, PARTICIPANTS, AND SETTING:A 3-phase design was used, including questionnaire translation and psychometric testing. The questionnaire was translated into Indonesian on March 2012. Content validity was assessed by 18 Indonesian experts on July 2012. The interrater agreement and reliability of the PrU categories, Braden Scale, and CDS were assessed on October 2012 in 4 Indonesian large public general hospitals. RESULTS:Most Indonesian experts (91.8%) rated the Indonesian version of the questionnaire as “good” on clarity of wording. The content validity indices of the questionnaire ranged from 0.50 to 1.00. The PrU categories assessed showed an interrater reliability of &kgr; = 0.92 (95% confidence interval [CI], 0.87–0.97) and an interrater agreement of po = 98.6% (95% CI, 97.5–99.3). The interrater reliability intraclass correlation coefficient (1,1) of the Braden Scale sum score was 0.90 (95% CI, 0.85–0.93). The exact proportion of agreement sum score was 39%. The interrater reliability intraclass correlation coefficient (1,1) of the CDS sum score was 0.88 (95% CI, 0.83–0.92). There was a 45% exact agreement on the CDS sum scores. CONCLUSIONS:The questionnaire can be used in Indonesian hospitals to measure the PrU prevalence and quality of PrU care.
Speculative Updates of Local and Global Branch History: A Quantitative Analysis

In today’s wide-issue processors, even small branch-misprediction rates introduce substantial performance penalties. Worse yet, inadequate branch prediction creates a bottleneck at the fetch stage, restricting other opportunities for improving performance. The choice of how to predict conditional-branch outcomes is the primary lever on prediction accuracy. But the choice of when to update the predictor with branch outcomes is a second powerful lever, and the subject of this paper. In history-based predictors like gshare , many mis-predictions result from commit-time update of the history: typical pipelined processors predict branches in the fetch stage, but update the predictor in the commit stage, making the predictor’s state temporarily out-of-date. As pipelines grow longer—in particular, when branches can spend many cycles in the instruction window waiting to issue—this problem becomes worse. Prior work on this subject has discussed the need for speculative update in a global-history-based predictor; this paper evaluates speculative history update for both global-history and local-history predictors of various conﬁgurations, using cycle-level simulation to show the effects of prediction accuracy and update time on overall performance. The results show the importance of speculative history update, but also that speculative update requires suitable ﬁxup mechanisms for repairing state that has been corrupted by mispredictions. A number of such mechanisms are discussed.
Evaluating the Yield of Repairable SRAMs for ATE

An accurate yield evaluation is essential in selecting redundancy allocation and testing strategies for memories. Yield evaluation can resolve the many issues revolving around cost-effective built-in self-test (BIST) and automatic test equipment (ATE)-based solutions for a higher test transparency. In this paper, two yield-calculation methodologies for SRAM arrays are proposed. General yield expressions for VLSI chips are initially presented. The regular and repetitive structure of an SRAM array is exploited, and substantial yield improvements can be achieved by the introduction of redundancy. Two repair yield-evaluation methods for one-dimensional redundant memory arrays are introduced and compared for ATE application. The first method is based on the sum of the probabilities of all repairable fault patterns; the second method is based on Markov modeling. Using industrial data, it is shown that these methods are applicable to ATE usage under different conditions of defect rate in the possible defects. Different features of the proposed methods are discussed