Miracle-dz/UniFAR-FTUs huggingface dataset:
Privacy Preserving Data Mining

With the rapid growth of the Internet, there is much need to cooperate mining data on the joint databases of multi-participants. Data mining is the extraction of hidden predictive information from large databases and also a powerful new technology with great potential to analyze important information in their data warehouses. Privacy preserving data mining is a latest research area in the field of data mining which generally deals with the side effects of the data mining techniques. Privacy is defined as ―protecting individual's information‖. Protection of privacy has become an important issue in data mining research. Sensitive outlier protection is novel research in the data mining research field. Privacy Preserving Data mining techniques depends on privacy, which captures what information is sensitive in the original data and should therefore be protected from either direct or indirect disclosure. Secrecy and anonymity are useful ways of thinking about privacy. This privacy should be measureable and entity to be considered private should be valuable. In this paper, we discuss the various techniques that can be used for privatizing data. The goal is to secure access to confidential information while at the same time releasing aggregate information to the public. The challenge in each of the techniques is to protect data so that they can be published without revealing confidential information that can be linked to specific individuals. Also protection is to be achieved with minimum loss of the accuracy sought by database users. Different data partitioned have been discussed and a comparison of the same has been provided.
PTPv2-based network load estimation and its application to QoE monitoring for Over-the-Top services

The recently-standardized Precision Time Protocol v2 (PTPv2) aims at achieving sub-microsecond-level synchronization between network clocks. In this work, we make the case for an alternative use of it: Adopting a learning approach, we observe its delay behavior during the protocol message exchange, derive models of its dependence on network load and build a real-time load estimation service. Then, as an application scenario of this service, we turn our attention to the provision of Over-the-Top (OTT) services. In such an environment, and assuming a level of cooperation between the ISP and the OTT provider, we demonstrate how our service can be used for estimating user experience for web applications. To this end, we establish quantitatively the link between network load and user experience using a state-of-the-art web QoE monitoring framework, and show how our PTPv2-based load estimation scheme can be integrated in an OTT service architecture and be utilized for load-aware, QoE-optimized content delivery decisions.
The multiplier ideal is a universal test ideal

Two different ideals have been defined during the last decade, each of which has played an important role in its respective area. In commutative algebra, the test ideal defined by Hochster and Huneke [HHl] plays a central role in the theory of tight closure. In algebraic geometry, multiplier ideals, defined by Nadel [Na] and reinterpreted by others (see, e.g. [Ei]), have refined various vanishing theorems and have had interesting applications, for example, to the existence of Kahler-Einstein metrics on certain Fano varieties. These two different types of ideals have arisen independently, are defined differently, and are motivated by different concerns. The purpose of this note is to show that, in fact, test ideals and multiplier ideals are closely related. With recent advances in commutative algebra, tying tight closure to singularity theory in algebraic geometry [W2], [S2], [Ha2], came good reason to suspect a connection between test ideals and multiplier ideals. The test ideal 7 of a commutative ring R defines, a t least conjecturally, the locus of non-F-regular points in Spec Rin other words, a prime idea! P contains r if and only if some ideal of the local ring Rp is not tightly closed. Likewise, the multiplier ideal N of R defines the locus of non-log-terminal points of Spec R. Because F-regularity is equivalent to logterminal singularities (for QGorenstein rings of characteristic zero), the test ideal and the multiplier ideal must have the same radical, and it is natural to investigate whether they are indeed the same ideal. Theorem 3.1 in this paper establishes, roughly speaking, that the test ideal and the multiplier ideal are indeed equal for every normal local QGorenstein ring
Peopletones: a system for the detection and notification of buddy proximity on mobile phones

Mobile phones have the potential to be useful agents for their owners by detecting and reporting situations that are of interest. Several challenges emerge in the case of detecting and reporting nice to know situations. Being alerted of these events may not be of critical importance but may be useful if the user is not busy. For detection, the precision of sensing must be high enough to minimize annoying false notifications, despite the constraints imposed by the inaccuracy of commodity sensors and the limited battery power available on mobile phones. For reporting, the notifications cannot be too obtrusive to the user or those in the vicinity. Peripheral cues are appropriate for conveying information like proximity, but have been studied primarily in settings like offices where sensors and cueing mechanisms can be controlled. We explore these issues through the design of PeopleTones, a buddy proximity application for mobile phones. We contribute (1) an algorithm for detecting proximity, (2) techniques for reducing sensor noise and power consumption, and (3) a method for generating peripheral cues. Empirical measurements demonstrate the precision and recall characteristics of our proximity algorithm. A two-week study of three groups of friends using PeopleTones shows that our techniques were effective, enabling the study of how people respond to peripheral cues in the wild. Our qualitative findings underscore the importance of cue selection and personal control for peripheral cues.
Dynamic model predictive voltage control for single-input dual-output flyback converter

This paper presents a dynamic model predictive voltage control (DMPVC) method for the single-input dualoutput (SIDO) flyback converter. In this converter, cross regulation is one of the most critical issues because its primary winding is shared by its secondary windings so that the two output voltages are interacted with each other. The proposed method has the ability to reduce cross regulation significantly, i.e., the two output voltages can be regulated individually. The statespace models of the converter for the DMPVC method are formulated, as well as the corresponding cost function which determines the optimal control actions. In order to verify the performance of the DMPVC method, simulation platform is built in the MATLAB/Simulink environment. The results indicate that the DMVPC method is capable of controlling the SIDO flyback converter with expected line and cross regulations along with seamless mode transition among various operation modes, including buck-buck mode, buck-boost mode and boost-boost mode.
Antitumor Effect of the Mannich Base(1,3-bis-((3-Hydroxynaphthalen-2-yl)phenylmethyl)urea) on Hepatocellular Carcinoma

The present study was designed to evaluate the antitumor effects of the synthetic Mannich base 1,3-bis-((3-hydroxynaphthalen-2-yl)phenylmethyl)urea (1,3-BPMU) against HEP-G2 hepatoma cells and diethylnitrosamine (DEN)-induced hepatocarcinoma (HCC) in albino rats. In vitro analysis results revealed that 1,3-BPMU showed significant cytotoxicity and cell growth inhibition in HEP-G2 hepatoma cells in a concentration-dependent manner. Furthermore, flow cytometry results indicated that 1,3-BPMU enhanced early and late apoptosis. The maximum apoptosis was exhibited at a concentration of 100 μg/mL of 1,3-BPMU. In in vivo analysis, DEN treatment increased the content of nucleic acids, LPO and the activities of AST, ALT, ALP, LDH, γGT and 5’NT with decreased antioxidant activity as compared to control rats. However, 1,3-BPMU treatment to DEN-induced rats decreased the content of nucleic acids, LPO and the activities of AST, ALT, ALP, LDH, γGT and 5’NT and increased the activities of SOD, CAT, GPx, GST and GR (p < 0.05). Furthermore, 1,3-BPMU enhanced the apoptosis via upregulation of caspase-3 and caspase-9 and the downregulation of Bcl-2 and Bcl-XL mRNA expression as compared to DEN-induced rats. Histological and ultrastructural investigation showed that 1,3-BPMU treatment renovated the internal architecture of the liver in DEN-induced rats. In this study, the molecular and pre-clinical results obtained by treatment of DEN-induced rats with 1,3-BPMU suggested that 1,3-BPMU might be considered as an antitumor compound in the future.
Time to Redefine PD? Introductory Statement of the MDS Task Force on the Definition of Parkinson's Disease

With advances in knowledge disease, boundaries may change. Occasionally, these changes are of such a magnitude that they require redefinition of the disease. In recognition of the profound changes in our understanding of Parkinson's disease (PD), the International Parkinson and Movement Disorders Society (MDS) commissioned a task force to consider a redefinition of PD. This review is a discussion article, intended as the introductory statement of the task force. Several critical issues were identified that challenge current PD definitions. First, new findings challenge the central role of the classical pathologic criteria as the arbiter of diagnosis, notably genetic cases without synuclein deposition, the high prevalence of incidental Lewy body (LB) deposition, and the nonmotor prodrome of PD. It remains unclear, however, whether these challenges merit a change in the pathologic gold standard, especially considering the limitations of alternate gold standards. Second, the increasing recognition of dementia in PD challenges the distinction between diffuse LB disease and PD. Consideration might be given to removing dementia as an exclusion criterion for PD diagnosis. Third, there is increasing recognition of disease heterogeneity, suggesting that PD subtypes should be formally identified; however, current subtype classifications may not be sufficiently robust to warrant formal delineation. Fourth, the recognition of a nonmotor prodrome of PD requires that new diagnostic criteria for early‐stage and prodromal PD should be created; here, essential features of these criteria are proposed. Finally, there is a need to create new MDS diagnostic criteria that take these changes in disease definition into consideration. © 2014 The Authors. Movement Disorders published by Wiley Periodicals, Inc. on behalf of International Parkinson and Movement Disorder Society.
On Minimum Duration Project Schedule

In order to facilitate building decision support system relative to project crashing, Minimum Duration Project Schedule Problem (MDPSP) is worthy of further research as a case of project crashing. In this paper, MDPSP is formulated using a bi-level programming model, and an algorithm named mfmc-A is presented to find maximum flow & minimum cut set in network with lower & upper arc capacities. Based on mfmc-A and the algorithm presented by Kamburowski for finding minimum cost project schedule, an algorithm named MDPS-A is proposed to solve MDPSP. The theory, on which MDPS-A is based, is presented. MDPS-A not only can find the optimal solution to MDPSP, but also has a good performance in the sense of being implemented on computer, computational time and required memory for computation. Numerical experiments demonstrate that MDPS-A is an efficient and robust method to solve MDPSP, and especially applicable to larger and more complex project.
INDIGO: An In-Situ Distributed Gossip System Design and Evaluation

Distributed Gossip in networks is a well studied and observed problem which can be accomplished using diﬀerent gossiping styles. This work focusses on the development, analysis and evaluation of a novel in-situ distributed gossip protocol framework design called (INDIGO). A core aspect of INDIGO is its ability to execute on a simulation setup as well as a system testbed setup in a seamless manner allowing easy portability. The evaluations focus on application of INDIGO to solve problems such as distributed average consensus, distributed seismic event location and lastly distributed seismic tomography. The results obtained herein validate the eﬃcacy and reliability of INDIGO.
Lane detection based on classification of lane geometrical model

As is known to all, there are thousands of people died in traffic accidents in the world every year and 80% of the traffic accidents are due to the drivers' inattention. In order to reduce the occurrence of car accidents, the design of Cognitive Vehicle Safety (CVS) system has attracted wide attention. As an important functional system of the CVS system, Lane Departure Warning system's function is to warn the driver when the vehicle changes the lane without the driver's intention. In this paper, we present a method of lane detection which based on Lane geometric model and image connected region process. The model of the lane is produced by the projection of camera, which makes the parallel lane lines in real world become intersect. The lines on the same side of lane have the same geometric feature that can be used to build lane line geometric model for detection. The lane line can be classified as different lane line models by the geometric feature of it. In this paper, due to the different features of lane line in different images, the operation and the classification of modeling performs at the same time. But before that, we go through some process to pre-process the image, such as the image connected region process, morphology tophat filter, etc. The combination of these modules can overcome the universal lane detection problems, such as the road in different light conditions. Experimental results on real road will be presented to prove the effectiveness of the proposed lane detection algorithm.
Statistical Analysis of Signal Integrity Issues in CNT Interconnects due to Contact Resistance Variations

Carbon nanotubes have recently been proposed as a possible replacement of metal interconnects in future technologies. These interconnects are supposed to carry signal frequencies above 20GHz by the year 2020. Hence signal integrity analysis is inevitable under real life process conditions. Contact resistance of CNT interconnects are reported to be varying between 0KΩ to 120KΩ. However, no study has been extensively analysed its effect on signal integrity issues for these interconnects. This work aims to fill that gap by Statistical analysis of the impact of contact resistance variations on signal integrity issues of bundles of SWCNTs. This work revealed that the signal integrity issues due to contact resistance variations are more severely effecting signal timing variations than the crosstalk induced signal overshoots and undershoots.
Application of Incremental SVM Learning for Infant Cries Recognition

Crying is the infant's first communication. Before learning how to express the emotions or physiological/ psychological requirements with language, infants usually express how they feel to parents through crying. Infants have very strong curiosity and learning ability to mimic parent's habits and reactions, thus, infants will express their needs by changing crying. To accurately determine the meanings of the newborn cries, we proposed a novel method that constructs personalize crying models for different infants. In this paper, the incremental learning support vector machine (SVM) is used for infant cry recognition system. Fifteen features were extracted from crying. Four significant features were finally selected to identify three kinds of crying. Experimental results show that the proposed method achieves higher accuracy than that of our prior work.
Asymptotic optimality of randomized peer-to-peer broadcast with network coding

We consider the problem of distributing k blocks from a source to N nodes in a peer-to-peer (P2P) network with both node upload and download capacity constraints. As k scales up, we prove for homogeneous networks that if network coding is allowed, randomly matching senders and receivers in each time slot asymptotically achieves the maximum downloading rate at each node. For heterogeneous networks with network coding allowed, we show that a fair and optimal downloading rate at each node can be asymptotically approached, if in each time slot, each node randomly allocates its upload bandwidth to its receivers that have available download bandwidth. We also give a performance lower bound of the above randomized coded dissemination when both k and N scale under certain conditions. These results demonstrate that with network coding, simple randomized receiver selection and rate allocation suffice to achieve P2P broadcast capacity, forming a theoretical foundation for mesh-based P2P networks with network coding.
Community policing through local collective action in Tanzania: Sungusungu to Ulinzi Shirikishi

Community policing (polisi jamii) was officially introduced in Tanzania in 2006 as part of an ongoing police reform programme. In addition to attempting to improve communication between police and the public, the police have promoted ulinzi shirikishi (participatory security), whereby citizens are encouraged to form neighbourhood policing institutions to prevent and detect crime. This thesis presents the findings of research conducted in the city of Mwanza that explored the extent to which community policing has improved residents’ perceptions of local security and constitutes a form of policing which is responsive, accountable and sustainable. Whilst ulinzi shirikishi is widely credited with having improved local safety, it has proved difficult to sustain collective action through community policing and the costs and benefits of participation have been unequally distributed across ‘communities’. These outcomes should be understood in terms of the context of how local development is organised and understood in Tanzania. Firstly, existing local governance institutions lack transparency and meaningful accountability mechanisms and are highly dependent upon personal preferences and capacity. Secondly, local development is politicised and liable to become subject to inter-party competition. Thirdly, historical understandings of ‘participation’ in Tanzania tend to emphasise obligation and material contributions rather than popular influence over initiatives, however this is increasingly being contested in today’s multiparty context. The apparent shortcomings of community policing are not necessarily inconsistent with police objectives for the reform, which often prioritise cost-effective crime prevention rather than the reorientation and ‘democratisation’ of policing envisaged by advocates of community policing.
Clathrin light chain directs endocytosis by influencing the binding of the yeast Hip1R homologue, Sla2, to F-actin

The clathrin light-chain (LC) N-terminal region interacts with the Sla2/Hip1/Hip1R family of ANTH/talin–like proteins. In vivo evidence shows that LC–Sla2 binding is important for releasing Sla2 attachments to actin in the endocytic coat. Loss of this regulation can suppress major actin defects during endocytosis.
Extracting the Parallelism in Program with Non-structured Statements Extracting the Parallelism in Program with Non-structured Statements

Non-structured programs are diicult to parallelize. First, the scope of the non-structured statements may interact and the execution trajectories can overlap, preventing the unique determination of the scope of a control statement. Second, even if the scope of a non-structured statement is determined and is converted into a while loop, this while loop is still diicult to parallelize due to the loop carried dependencies of the control variables. In this paper, a method of program structuring is proposed, which is based on a hammock transformation of the ow graph, and converts non-structured statements into block if-statements and while loops. Furthermore, an algorithm was developed to transform a common type of while loops into do loops. The technique works for while loops of which the control variables appear as a linear recurrence relation. As a result, the loop carried dependencies generated by the control variables are removed. If there are no other loop carried dependencies, the do loop may then be converted into a doall loop. The algorithm was used to test and convert a significant number of while loops into doall loops for a suite of well-known numerical algorithms. Abstract Non-structured programs are diicult to parallelize. First, the scope of the non-structured statements may interact and the execution trajectories can overlap, preventing the unique determination of the scope of a control statement. Second, even if the scope of a non-structured statement is determined and is converted into a while loop, this while loop is still diicult to parallelize due to the loop carried dependencies of the control variables. In this paper, a method of program structuring is proposed, which is based on a hammock transformation of the ow graph, and converts non-structured statements into block if-statements and while loops. Furthermore, an algorithm was developed to transform a common type of while loops into do loops. The technique works for while loops of which the control variables appear as a linear recurrence relation. As a result, the loop carried dependencies generated by the control variables are removed. If there are no other loop carried dependencies, the do loop may then be converted into a doall loop. The algorithm was used to test and convert a significant number of while loops into doall loops for a suite of well-known numerical algorithms.
The effect of limiting the number of retransmission trials on the stability of slotted ALOHA systems

We investigate the effect of limiting the number of retransmission trials on the stability of slotted ALOHA systems with no capture effect. Using an argument of the catastrophe theory, we a prove that a slotted ALOHA system is mono-stable, if the number of retransmission trials is limited to, at most, eight. We also show how the bistable region is enlarged, as the number of retransmission trials grows over eight.