Miracle-dz/UniFAR-FTUs huggingface dataset:
Community based routing scheme for future Internet considering PLM systems

Internet plays an increasingly significant role in our modern life style for our society, educational institution, engineering systems and industrial applications. It serves billions of users worldwide every day by carrying an extensive range of traffic from sources to desired destinations. Along with these advances, inter-domain routing nodes of internet are facing challenging issues like scalability. Path vector routing scheme is not sufficient to cope with this issues for building future internet. There are many different Advance Routing schemes available in the literature for solving the problem. Thorup Zwick routing scheme (TZ scheme) is one of the promising Compact Routing scheme, offering many benefits such as guaranteeing sub-linear state growth with the size of the network by introducing cluster nodes, landmark routing and incurring path stretch. However, the extra burden of routing table size in landmark nodes is an important issue which can generate scalability issues for landmark nodes. This paper tries to solve the scalability problem of internet by making modification in Thorup Zwick (TZ) scheme. we introduce a new concept named community in the topology of internet, re-define cluster nodes and replace landmark nodes with proposed community nodes in the network. The proposal organizes internet in an efficient way by defining new set of rules for inter-domain nodes and reduce routing table size in a prominent amount. The proposal provides an organized, simpler and effective routing scheme. A discrete event simulation study is used to verify the benefits of new scheme. Our simulation results show that the proposed scheme is capable to cope scalability issues of inter-domain nodes, handle generated traffic considering PLM systems and build an efficient future Internet.
Performance metrics for table driven and on demand routing protocols in mobile adhoc network using NS-2

A mobile ad hoc network (MANET) is a set of movable devices that is established without wired medium forming with various topologies. Mantes are not using infrastructure as wired network use and anytime, anywhere can be established. The direction-finding algorithms are classified into two parts in this paper (1). proactive DSDV (table driven) and (2). reactive DSR (On demand) algorithms. We simulate various MANET routing algorithms in network simulator NS-2 and compare the performance metrics for each Routing protocol like throughput, packet delivery ratio and average end to end delay by varying the number of nodes (Node 20 and Node 30 Group)with different pause time by using cbr source traffic and node movement model.
The Origin , Potential Health Effects , and Environmentally Conscious Control of Airborne Particulate in Manufacturing Operations

In recent years, increased attention has been devoted to the environmental performance of products and their associated manufacturing processes. Toward this end, tools such as life cycle analysis are being used more frequently to quantify the environmental effects of decisions made during the engineering design process. In many cases, for the first time, decision-makers have begun to place emphasis on the material and energy flows throughout the life cycle of a product, such as that depicted in Figure 1. In this context, it is worth noting that the manufacturing design community has historically largely ignored the waste streams produced by manufacturing operations. One of these waste streams, process generated airborne particulate, has received much emphasis within the scientific literature of the industrial hygiene and safety engineering communities; but, all too often, the individuals who have the power to do something about these emissions, manufacturing decision-makers, have never effectively dealt with these issues. With this in mind, this chapter is aimed at the manufacturing R&D community, and endeavors to address a variety of topics related to airborne particulate arising from manufacturing processes. Emphasis will be placed on the origins of the particulate and the potential hazards that it represents; the role of traditional control technologies in addressing particulate and more environmentally conscious approaches that focus on dealing with particulate at its source are also examined.
Can Anyone Be "The" One? Field Evidence on Dating Behavior

Much empirical evidence shows that female and male partners look alike along a variety of attributes. It is however unclear whether this positive sorting is the result of either assortative or agreed-upon preferences or of meeting opportunities. We assess the nature of dating preferences and the relative importance of preferences and opportunities in dating behavior using unique new data from a large commercial speed dating agency. We find that both women and men value physical attributes, such as age and weight, and that preferences are assortative along age, height, and education. The role of preferences, however, is outplayed by that of opportunities. Along some attributes (such as education, occupation and smoking) opportunities explain more than two-thirds of the estimated variation in demand. Along other attributes (such as age), the role of preferences is more substantial, but never dominant. These results will have important implications for our understanding of the degree of social openness and mobility.
DP-FACT: Towards topological mapping and scene recognition with color for omnidirectional camera

Topological mapping and scene recognition problems are still challenging, especially for online realtime vision-based applications. We develop a hierarchical probabilistic model to tackle them using color information. This work is stimulated by our previous work [1] which defined a lightweight descriptor using color and geometry information from segmented panoramic images. Our novel model uses a Dirichlet Process Mixture Model to combine color and geometry features which are extracted from omnidirectional images. The inference of the model is based on an approximation of conditional probabilities of observations given estimated models. It allows online inference of the mixture model in real-time (at 50Hz), which outperforms other existing approaches. A real experiment is carried out on a mobile robot equipped with an omnidirectional camera. The results show the competence against the state-of-art.
Binary particle swarm optimisation and rough set theory for dimension reduction in classification

Dimension reduction plays an important role in many classification tasks. In this work, we propose a new filter dimension reduction algorithm (PSOPRSE) using binary particle swarm optimisation and probabilistic rough set theory. PSOPRSE aims to maximise a classification performance measure and minimise a newly developed measure reflecting the number of attributes. Both measures are formed by probabilistic rough set theory. PSOPRSE is compared with two existing PSO based algorithms and two traditional filter dimension reduction algorithms on six discrete datasets of varying difficulty. Five continues datasets including a large number of attributes are discretised and used to further examine the performance of PSOPRSE. Three learning algorithms, namely decision trees, nearest neighbour algorithms and naive Bayes, are used in the experiments to examine the generality of PSOPRSE. The results show that PSOPRSE can significantly decrease the number of attributes and maintain or improve the classification performance over using all attributes. In most cases, PSOPRSE outperforms the first PSO based algorithm and achieves better or much better classification performance than the second PSO based algorithm and the two traditional methods, although the number of attributes is slightly large in some cases. The results also show that PSOPRSE is general to the three different classification algorithms.
Natural User Interfaces: Trend in Virtual Interaction

Based on the fundamental constraints of natural way of interacting such as speech, touch, contextual and environmental awareness,immersive 3D experiences-all with a goal of a computer that can see listen, learn talk and act. We drive a set of trends prevailing for the next generation of user interface: Natural User Interface (NUI). New technologies are pushing the boundaries of what is possible without touching or clicking an interface- paving the way of interaction to information visualization and opportunities in human towards more natural interaction than ever before. In this paper we consider the trends in computer interaction through that must be taken into consideration to come up-in the near future with a well-designed-NUI.
First Contact to Odors: Our Current Knowledge about Odorant Receptors

Chemical senses – especially smell – are known to be important for the fundamental life events such as sensing predators, selecting mates, as well as finding food. The chemical senses are decoded in the olfactory system which is able to detect and differentiate thousands of odorous substances comprised of chemically divergent structures (i.e. odorants). The high selectivity of the olfactory system is heavily dependent on the receptors for each odorants (i.e. odorant receptors). Thus, studying odorant receptors may not only facilitate our understanding the initial events of olfaction but provide crucial knowledge for developing a novel, odorant receptor-based biosensor for chemical screening. Here we provide a review of recent advances in our understanding of odorant receptors.
Ticket-Based Authentication Mechanism for Proxy Mobile IPv6 Environment

In the current specification of Proxy Mobile IPv6, there is no attempts for optimized authentication mechanism. In this paper, we propose a ticket-based authentication mechanism in where the security information are reused for fast authentication during mobile nodes hand off between different links. According to the performance evaluation, the proposed mechanism shows the improved performance up to 89.2% compared to EAP-TLS and Kerberos. In addition, we provide the validity of the proposed mechanism through BAN logic.
Single-Cell Dynamics Reveals Sustained Growth during Diauxic Shifts

Stochasticity in gene regulation has been characterized extensively, but how it affects cellular growth and fitness is less clear. We study the growth of E. coli cells as they shift from glucose to lactose metabolism, which is characterized by an obligatory growth arrest in bulk experiments that is termed the lag phase. Here, we follow the growth dynamics of individual cells at minute-resolution using a single-cell assay in a microfluidic device during this shift, while also monitoring lac expression. Mirroring the bulk results, the majority of cells displays a growth arrest upon glucose exhaustion, and resume when triggered by stochastic lac expression events. However, a significant fraction of cells maintains a high rate of elongation and displays no detectable growth lag during the shift. This ability to suppress the growth lag should provide important selective advantages when nutrients are scarce. Trajectories of individual cells display a highly non-linear relation between lac expression and growth, with only a fraction of fully induced levels being sufficient for achieving near maximal growth. A stochastic molecular model together with measured dependencies between nutrient concentration, lac expression level, and growth accurately reproduces the observed switching distributions. The results show that a growth arrest is not obligatory in the classic diauxic shift, and underscore that regulatory stochasticity ought to be considered in terms of its impact on growth and survival.
Prevalence of M75 Streptococcus pyogenes Strains Harboring slaA Gene in Patients Affected by Pediatric Obstructive Sleep Apnea Syndrome in Central Italy

Recently we reported an association between pediatric obstructive sleep apnea syndrome (OSAS) and Group A streptococcus (GAS) sub-acute chronic tonsil colonization. We showed that GAS may contribute to tonsil hyperplasia via a streptolysin O (SLO)-dependent cysteinyl leukotrienes (CysLTs) production, which can trigger T and B cell proliferation. In the present study, we characterized the GAS strains isolated from pediatric OSAS patients in comparison with a panel of age and sex matched GAS strains unrelated to OSAS, but isolated in the same area and during the same period ranging from 2009 to 2013. We found that slaA gene, previously reported to be associated to CysLTs production pathway, was significantly associated to GAS OSAS strains. Moreover, the most numerous group (32%) of the GAS OSAS strains belonged to M75 type, and 6 out of 7 of these strains harbored the slaA gene. Multilocus Sequence Typing (MLST) experiments demonstrated that the clone emm75/ST49/ smeZ, slaA was associated to OSAS cases. In conclusion, we found an association between slaA gene and the GAS OSAS strains, and we showed that the clone emm75/ST49 harboring genes smeZ and slaA was exclusively isolated from patients affected by OSAS, thus suggesting that this genotype might be associated to the pathogenesis of OSAS, although further studies are needed to elucidate the possible role of SlaA in tonsil hypertrophy development.
Successful treatment of autoimmunity in NZB/NZW F1 mice with monoclonal antibody to L3T4

Autoimmune NZB/NZW mice were treated with weekly injections of monoclonal antibody (mAb) to L3T4, an antigen expressed on a distinct subpopulation of T cells that respond to class II major histocompatibility antigens. Treatment with anti-L3T4 depleted circulating target cells, reduced autoantibody production, retarded renal disease, and prolonged life relative to control mice treated either with saline or with purified nonimmune rat IgG. These findings establish that autoimmune disease in NZB/NZW mice is regulated by T cells. In contrast to mice treated with nonimmune rat IgG, mice treated with rat anti-L3T4 mAb developed little or no antibody to rat Ig. Thus, the benefits of treatment with anti-L3T4 were achieved while minimizing the risks associated with a host immune response to therapy. This study raises the possibility that treatment with mAb against Leu-3/T4, the human homologue for L3T4 might be effective in the treatment of certain autoimmune diseases in people.
Cryptanalysis of the random number generator of the Windows operating system

The PseudoRandom Number Generator (PRNG) used by the Windows operating system is the most commonly used PRNG. The pseudorandomness of the output of this generator is crucial for the security of almost any application running in Windows. Nevertheless, its exact algorithm was never published. We examined the binary code of a distribution of Windows 2000. This investigation was done without any help from Microsoft. We reconstructed the algorithm used by the pseudorandom number generator (namely, the function CryptGenRandom). We analyzed the security of the algorithm and found a nontrivial attack: Given the internal state of the generator, the previous state can be computed in 223 steps. This attack on forward security demonstrates that the design of the generator is flawed, since it is well known how to prevent such attacks. After our analysis was published, Microsoft acknowledged that Windows XP is vulnerable to the same attack. We also analyzed the way in which the generator is used by the operating system and found that it amplifies the effect of the attack: The generator is run in user mode rather than in kernel mode; therefore, it is easy to access its state even without administrator privileges. The initial values of part of the state of the generator are not set explicitly, but rather are defined by whatever values are present on the stack when the generator is called. Furthermore, each process runs a different copy of the generator, and the state of the generator is refreshed with system-generated entropy only after generating 128KB of output for the process running it. The result of combining this observation with our attack is that learning a single state may reveal 128KB of the past and future output of the generator. The implication of these findings is that a buffer overflow attack or a similar attack can be used to learn a single state of the generator, which can then be used to predict all random values, such as SSL keys, used by a process in all its past and future operations. This attack is more severe and more efficient than known attacks in which an attacker can only learn SSL keys if it is controlling the attacked machine at the time the keys are used.
AUTOMATED TARGET-FREE CAMERA CALIBRATION

Automatic camera calibration is now a well-established procedure. The process generally involves photographing a target array to form a network of images in a geometric configuration suited to self-calibration. Full automation can be implemented if coded targets are employed, as these provide initial image point correspondences necessary for network exterior orientation. While the use of coded and indeed any artificial targeting facilitates high accuracy recovery of camera calibration parameters, it is also fair to say that the employment of targets can be inconvenient in some practical circumstances, for example when attempting calibration from low-level aerial imagery, as with UAVs, or when calibrating long-focal length lenses where small image scales call for inconveniently large coded targets. Fortunately, accompanying the adoption of so-called structure-from-motion (SfM) approaches in photogrammetric network orientation, there is the prospect of fully automated camera calibration without the need for artificial targets. Instead of the image-point correspondence problem being overcome through the use of coded targets, feature-based matching is employed to provide the necessary point matches to support exterior orientation. Whereas it is not uncommon to achieve an accuracy of camera calibration of 0.1 pixel or better through the use of coded targets, the resolution from the feature-based matching process is generally closer to 0.3 pixel. This difference is offset, however, by the fact that whereas 100 or so targets might be employed, the SfM approach can easily involve 10,000 or more feature points on a feature-rich object, thus leading to a very comprehensive calibration result. This paper reports on the application of the SfM approach to automated target-free camera self-calibration and discusses the process via practical examples.
Block-based Illumination Compensation and Search Techniques for Multiview Video Coding

We consider block-based interview coding techniques for multiview video sequences that are robust to illumination variations across views. We consider both global illumination differences which could be due to lack of camera calibration or heterogeneity, as well as local ilumination changes caused by lack of camera aligment. We propose a two-parameter model for illumination compensation (IC) that is used at the block matching search step and can be adaptively applied by taking into account the rate-distortion characteristics of each block. We also present a modified search (MS) method for block-based interview disparity estimation that makes use of feature points in each frame in order to provide a good prediction of likely disparity vectors. We present coding experiments on different multiview sequences based on the H.264/AVC reference codec. The proposed techniques show significant coding gains for interview coded frames, as compared to methods that do not employ IC and MS.
A Survey of Media Access Control ( MAC ) Protocols for Vehicular Ad-hoc NETworks ( VANETs )

Recent advances of various wireless communication technologies and the emergence of computationally rich vehicles are pushing Vehicular Ad-hoc NETwork (VANET) research to the forefront in academia and industry. A lot of research results have been published in various areas (such as routing, broadcasting, security, and others) of VANET in the last decade covering both Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) scenarios. One specific area of VANET that still faces significant challenges is the design of reliable and robust Media Access Control (MAC) protocols for V2V communications. We present a survey of V2V MAC methods (including various VANET standards) that have been proposed for VANETs over the last few years. We focus on the benefits and limitations of the proposed MAC techniques as well as their ease of implementation in practice and future deployment. We also discuss some of the challenges that still need to be addressed to enable the implementation of highly efficient and high performance MAC protocols for V2V communications. Finally, we propose some innovative solutions that can be developed to address these challenges.
On throughput optimality with delayed network-state information

We study the problem of routing/scheduling in a wireless network with partial/delayed Network (channel and queue) State Information (NSI). We consider two cases: (i) A network with a centralized controller with heterogeneous delays from each of the nodes to the controller and with arbitrary topology (thus, the controller has NSI with different delays from different nodes), (ii) Decentralized routing/scheduling, where each node makes a decision based on its current channel and queue state along with homogeneous delayed NSI from other nodes. For each of the cases (with additional flow restrictions for the decentralized routing/scheduling case), we first characterize the optimal network throughput region under the above described NSI model and show that the throughput region shrinks with the increase of delay. Further, we propose channel and queue length based routing/scheduling algorithms that achieve the above throughput region.
Palm Geometry Biometrics: A Score-based Fusion Approach

In this paper we present an identification and authentication system based on hand geometry. First, we examine the performance of three different methods that are based on hand silhouette and on binarized hand images and then we investi- gate approaches for combining the feature vectors, identification-verification scores, and individual acceptance-rejections decisions taken by using each one of the pro- posed methods individually. The proposed system has been tested on the POLYBIO hand database which consists of 180 hand images from 45 individuals. The exper- iments show that fusion of feature vectors results in a slightly better performance in both identification and authentication tests while combination of scores and de- cisions leads to a significant improvement in authentication performance and minor improvement in identification.