Miracle-dz/UniFAR-FTUs huggingface dataset:
A Network-Based Approach on Elucidating the Multi-Faceted Nature of Chronological Aging in S. cerevisiae

Background Cellular mechanisms leading to aging and therefore increasing susceptibility to age-related diseases are a central topic of research since aging is the ultimate, yet not understood mechanism of the fate of a cell. Studies with model organisms have been conducted to ellucidate these mechanisms, and chronological aging of yeast has been extensively used as a model for oxidative stress and aging of postmitotic tissues in higher eukaryotes. Methodology/Principal Findings The chronological aging network of yeast was reconstructed by integrating protein-protein interaction data with gene ontology terms. The reconstructed network was then statistically “tuned” based on the betweenness centrality values of the nodes to compensate for the computer automated method. Both the originally reconstructed and tuned networks were subjected to topological and modular analyses. Finally, an ultimate “heart” network was obtained via pooling the step specific key proteins, which resulted from the decomposition of the linear paths depicting several signaling routes in the tuned network. Conclusions/Significance The reconstructed networks are of scale-free and hierarchical nature, following a power law model with γ = 1.49. The results of modular and topological analyses verified that the tuning method was successful. The significantly enriched gene ontology terms of the modular analysis confirmed also that the multifactorial nature of chronological aging was captured by the tuned network. The interplay between various signaling pathways such as TOR, Akt/PKB and cAMP/Protein kinase A was summarized in the “heart” network originated from linear path analysis. The deletion of four genes, TCB3, SNA3, PST2 and YGR130C, was found to increase the chronological life span of yeast. The reconstructed networks can also give insight about the effect of other cellular machineries on chronological aging by targeting different signaling pathways in the linear path analysis, along with unraveling of novel proteins playing part in these pathways.
Environment sound recognition using zero crossing features and MPEG-7

In this paper, we perform several experiments focusing on the problems of environment recognition from audio particularly for forensic application. We investigated the effect of temporal zero crossing feature and some selected MPEG-7 audio low level descriptors on environment sound recognition. The performance is evaluated against varying number of training sounds and samples per each training file. Experimental results show that higher recognition accuracy is achieved by increasing the number of training files and by decreasing the number of samples per training file.
Controlling a Mobile Robot Herd: Theory and Practice

This paper discusses the difficulties of analyzing and synthesizing intelligent collective behaviors for a collection of mobile robots. It reviews available approaches and presents a bottom-up experimental alternative consisting of a set of robust global behaviors based on simple local rules. These basic behaviors are designed to be sufficient and additive, in order to be combined into more complex collective task achieving behaviors. The paper also describes the role of interaction in a multi-agent environment, and ways of analyzing and predicting it. Finally, we present the experimental set up, consisting of twenty physical mobile robots, on which the interference studies were performed and the basic behavior repertoire was developed and tested.
Design on space-time CDMA system over rayleigh fading wireless channel

By integrating space-time coding technology into LAS spread spectrum technology, the code division multiple access system can take both of their advantage. When many antennas are installed on the base station, the wireless communication system is possible to get full spatial diversity gain. Both the transmitter scheme and the receiver scheme of such space-time spread spectrum CDMA system using multiple transmitting antennas are proposed. Due to both the spectrum-spread operation and space-time operation, the temporal diversity gain can be acheived. Some simulation results of performance are given.
Dynamic Rectangle Zone-Based Collaboration Mechanism for Tracking Continuous Objects in Wireless Sensor Networks

Most existing routing protocols on the object detection and tracking in sensor networks concentrates on finding ways to detect and track one or more individual objects, such as people, animals, and vehicles, and not many protocols have been done on detecting and tracking continuous objects, such as poison gas, biochemical, and chemical liquid. These continuous objects are quite different from the individual objects in that they continuously distributed across a region and usually occupy a large area. Accordingly, they are detected and sensed by many sensor nodes, and their sensing data are redundant and highly correlated. Hence, there need any efficient scheme on collecting and aggregating locally their sensing data and generating the data report. The continuous objects also tend to diffuse, changes in shape, increases the size, even splits into multiple smaller continuous objects, or join together one continuous object. Accordingly, there also need any efficient scheme to manage efficiently the dynamic change of shape of the continuous objects. Therefore, we introduce dynamic rectangle zone-based collaboration mechanism for detecting, tracking, and monitoring the continuous objects taking into account their properties. One center node in the zone collects and aggregates the sensing data from sensor nodes which detect the continuous object. The dynamic rectangle zone change newly according to dynamic change of the continuous object and the center node is also altered by another node to minimize the energy consumption for collecting the sensing data.
On the Analysis of Reversible Booth's Multiplier

Reversible logic attains the attraction of researchers in the last decade mainly due to low-power dissipation. Designers' endeavors are thus continuing in creating complete reversible circuits consisting of reversible gates. This paper presents a design methodology for the realization of Booth's multiplier in reversible mode. Booth's multiplier is considered as one of the fastest multipliers in literature and we have shown an efficient design methodology in reversible paradigm. The proposed architecture is capable of performing both signed and unsigned multiplication of two operands without having any feedbacks, whereas existing multipliers in reversible mode consider loop which is strictly prohibited in reversible logic design. Theoretical underpinnings, established for the proposed design, show that the proposed circuit is very efficient from reversible circuit design point of view.
Medical Image Intelligent Access Integrated with Electronic Medical Records System for Brain Degenerative Disease

Mei-Ju Sua, Po-Hsun Chengb, Sao-Jie Chena, Chung-Yi Yangd, Ping-Kung Yipf, Daniel Racoceanugh and Heng-Shuen Chence* aGraduate Institute of Electronics Engineering, College of Electrical Engineering and Computer Science, National Taiwan University Department of Software Engineering, National Kaohsiung Normal University bDepartment of Medical Informatics, College of Medicine, National Taiwan University cDepartment of Family Medicine, National Taiwan University Hospital dDepartment of Medical imaging, National Taiwan University Hospital eInformation System Office, National Taiwan University Hospital fDepartment of Neurology, National Taiwan University Hospital gIPAL-UMI CNRS 2955, French National Research Center , I2R, A*STAR, NUS, Singapore hFaculty of Sciences, University of Besancon, France *Email: chenhs@ntu.edu. tw National Taiwan University, Taipei, Taiwan
Traffic-Related Air Pollution and Asthma Onset in Children: A Prospective Cohort Study with Individual Exposure Measurement

Background The question of whether air pollution contributes to asthma onset remains unresolved. Objectives In this study, we assessed the association between asthma onset in children and traffic-related air pollution. Methods We selected a sample of 217 children from participants in the Southern California Children’s Health Study, a prospective cohort designed to investigate associations between air pollution and respiratory health in children 10–18 years of age. Individual covariates and new asthma incidence (30 cases) were reported annually through questionnaires during 8 years of follow-up. Children had nitrogen dioxide monitors placed outside their home for 2 weeks in the summer and 2 weeks in the fall–winter season as a marker of traffic-related air pollution. We used multilevel Cox models to test the associations between asthma and air pollution. Results In models controlling for confounders, incident asthma was positively associated with traffic pollution, with a hazard ratio (HR) of 1.29 [95% confidence interval (CI), 1.07–1.56] across the average within-community interquartile range of 6.2 ppb in annual residential NO2. Using the total interquartile range for all measurements of 28.9 ppb increased the HR to 3.25 (95% CI, 1.35–7.85). Conclusions In this cohort, markers of traffic-related air pollution were associated with the onset of asthma. The risks observed suggest that air pollution exposure contributes to new-onset asthma.
Are Paid Subscriptions on Music Social Networks Contagious ? A Randomized Field Experiment

Demonstrating compelling causal evidence of the existence and strength of peer to peer influence in online social networks has become the holy grail of the modern research in online social networks. While it has been consistently demonstrated that user characteristics and behavior tend to cluster inside social networks both in space and in time, there are several different mechanisms that can cause this observed clustering. Among the most frequently cited explanations for this effect are two rival mechanisms: peer influence and homophily. While both peer influence and homophily mechanisms can each lead to very similar observational data, the policy implications of each of these mechanisms are significantly different: under peer influence an effective policy might be to identify “influential” people and induce the desired behavior among them, while under homophily mechanism this policy may have no effect and a different type of action is needed. Considering the massiveness and continuing growth of online social networks, it is therefore of critical importance both for research and for businesses to reliably identify presence of each of these mechanisms in the general population of online social networks and quantify the strength of them. Traditionally, the econometric identification of peer influence from purely observational data has proven to be a hard challenge. In this paper, we present a novel randomized experiment that tests the existence of causal peer influence in the general population of a particular large-scale online social network. We present our findings starting with insights learned from observational data, followed by a quasi-experiment based on observational data and concluding with the randomized field trial. Both quasi-experiment and randomized experiment demonstrated that new adoptions were significantly higher in the treatment group vs. control group. The quasi-experiment allowed us to determine the adequate sample size for our randomized trial as well as provided an interesting baseline to compare our results against. Both simple t-test and logistic regression indicate that user’s adoption of a product causes her online friends to pay for it and adopt it as well. Our point estimates show that, for a median social network user, the odds of adopting the paid subscription increase by 116% due to peer influence when her friend adopts it. In addition, we find that peer influence is significantly stronger for users with smaller number of friends as compared to the ones with large number of friends. Finally, we find that the quasi-experiment tends to produce the results similar to randomized trial, somewhat over-estimating the effect on users with larger number of friends and under-estimating it for the users with smaller number of friends, thus providing the first insights about the nature of bias in estimating peer-effects by the models with self-selected populations.
ON MIXED BRIESKORN VARIETY

Let $f_{{\bf a},\{bf b}}({\bf z},\bar{\bf z})=z_1^{a_1+b_1}\bar z_1^{b_1}+. +z_n^{a_n+b_n}\bar z_n^{b_n}$ be a polar weighted homogeneous mixed polynomial with $a_j>0,b_j\ge 0$, $j=1,. , n$ and let $f_{{\bf a}}({\bf z})=z_1^{a_1}+. +z_n^{a_n}$ be the associated weighted homogeneous polynomial. Consider the corresponding link variety $K_{{\bf a},{\bf b}}=f_{{\bf a},{\bf b}}\inv(0)\cap S^{2n-1}$ and $K_{{\bf a}}=f_{{\bf a}}\inv(0)\cap S^{2n-1}$. Ruas-Seade-Verjovsky \cite{R-S-V} proved that the Milnor fibrations of $f_{{\bf a},{\bf b}}$ and $f_{{\bf a}}$ are topologically equivalent and the mixed link $K_{{\bf a},{\bf b}}$ is homeomorphic to the complex link $K_{{\bf a}}$. We will prove that they are $C^\infty$ equivalent and two links are diffeomorphic. We show the same assertion for $ f({\bf z},\bar{\bf z})=z_1^{a_1+b_1}\bar z_1^{b_1}z_2+. +z_{n-1}^{a_{n-1}+b_{n-1}}\bar z_{n-1}^{b_{n-1}}z_n+z_n^{a_n+b_n}\bar z_n^{b_n}$ and its associated polynomial $ g({\bf z})=z_1^{a_1}z_2+. + z_{n-1}^{a_{n-1}}z_n+z_n^{a_n}$.
Modified gravitational search algorithm

In this paper, we present an efficient algorithm for solving optimization problems, which is based on gravitational search algorithm. In the proposed algorithm, called Member-Satellite algorithm, satellites have been appointed to all the agents which called as members in proposed algorithm. Members and their satellites are used to find a near optimal solution all together. The algorithm is continued with members or satellites with the best fitness value. Three benchmark functions are used to evaluate and to compare performance of the presented algorithm with GSA. The obtained results confirm the high performance of the proposed method in solving various nonlinear functions.
Norm development in outsourcing relationships

This paper considers the role of norms within networks by describing how BP Exploration outsourced its information technology function – a major business activity. This outsourcing venture led to the formation of a consortium. However, this attempt was found to have failed. It is suggested here that central to the failure of the consortium as an outsourcing arrangement was the issue of ‘norms’.
Quality Requirement Coordination in Rate Adaptation of Multiple Layered Videos

In this paper, we propose a layer adaptation scheme for multiple layered video multicast distribution. Assuming that each user has his/her own quality requirement for the multiple videos, a “quality coordinator” determines the set of layers of videos to be dropped by those users who have detected network congestion on their common bottle-neck link so that their requirements are satisﬁed as much as possible. Based on the proposal scheme, MPEG1 layered video distribution system has been designed and implemented. Through an experiment on an IP multicast network, we have conﬁrmed that the recovery time from network congestion was less than half time and the satisﬁed requirements are higher than a simple layer adaptation where each user drops layers according to his/her requirement independently of the others.
Authenticating Privately over Public Wi-Fi Hotspots

Wi-Fi connectivity using open hotspots hosted on untrusted Access Points (APs) has been a staple of mobile network deployments for many years as mobile providers seek to offload smartphone traffic to Wi-Fi. Currently, the available hotspot solutions allow for mobility patterns and client identities to be monitored by the parties hosting the APs as well as by the underlying service provider. We propose a protocol and system that allows a service provider to authenticate its clients, and hides the client identity from both AP and service provider at the time of authentication. Particularly, the client is guaranteed that either the provider cannot do better than to guess their identity randomly or they obtain proof that the provider is trying to reveal their identity by using different keys. Our protocol is based on Private Information Retrieval (PIR) with an augmented cheating detection mechanism based on our extensions to the NTRU encryption scheme. The somewhat-homomorphic encryption makes auditing of multiple rows in a single query possible, and optimizes PIR for highly parallel GPU computations with the use of the Fast Fourier Transform (FFT). In this work we lay out the operation of our protocol in detail, its security analysis, and propose an implementation compatible with the Wi-Fi Extensible Authentication Protocol (EAP) along with optimizations for deployments of over 10 million clients. We evaluate the performance of its mobile and provider components, and show that a client can be authenticated in 43.9 milliseconds on a GPU platform, giving an end-to-end authentication of 1.12 seconds.
Congenital Tuberculosis: A Newborn Case Report With Rare Manifestation

Introduction Congenital tuberculosis is an infrequently encountered condition and only 300 cases were reported in the literature till 1989. There are no specific signs and symptoms pathognomonic for congenital TB, and the devastating consequences in the absence of early therapy signify the importance of early diagnosis and treatment during the neonatal period. Case Presentation In this paper we report on a case of congenital TB in a newborn who was admitted to our clinic with seizures and intraventricular hemorrhage (IVH) due to TB meningitis. Her mother was diagnosed with active pulmonary TB and treated with a multi-drug anti-tuberculosis regimen. Her screening for human immunodeficiency virus (HIV) was negative. Cerebrospinal fluid was collected and showed protein levels at 300 mg/dL, glucose at 27 mg/dL (serum glucose level was 76 mg/dL), many RBC, and a positive result for acid-fast bacilli on smear microscopy, all of which were compatible with tuberculous meningitis. Conclusions It is important to consider TB meningitis in newborns with perinatal IVH and concomitant hydrocephalus particularly when the mother has a history of TB prior to or during pregnancy.
FRIF: Fast Robust Invariant Feature

Establishing robust visual correspondences is a fundamental component of many computer vision applications. However, it is very challenging to obtain high quality features while maintaining a low computational cost. This paper aims to tackle this problem by adopting a novel Fast Robust Invariant Feature (FRIF) for both feature detection and description. The basic idea is to employ a fast approximated LoG detector to select scale-invariant keypoints and incorporate local pattern and inter-pattern information to construct distinctive binary descriptors. A comprehensive evaluation on standard dataset shows that FRIF achieves quite a high performance with a computation time comparable to state-of-the-art real-time features.
Virtual machine based heterogeneous checkpointing

Checkpointing an application is the act of saving the application's state during its execution on stable storage so that if the application fails, it can be restarted from the last saved state, thereby avoiding loss of the work that was already done. A heterogeneous checkpoint/restart mechanism allows to restart an application from a saved state that was taken in a hardware architecture and/or operating system that can be different from those in the machine on which it is restarted. This paper explores how to construct such a mechanism at the virtual machine level. That, is, rather than dumping the entire state of the application process, the mechanism reported here dumps the state of the application w.r. t. a virtual machine. During restart, the saved state is loaded into a new copy of the virtual machine, which continues running from there. The heterogeneous checkpoint/restart mechanism reported here was developed for the OCaml variant of ML. The paper reports on the main issues encountered in building such a mechanism and the design choices made, presents performance evaluations, and discusses some lessons and ideas for extending the work to native code OCaml, and to Java Virtual Machines.
Optimal Voting in Groups with Convergent Interests

Decision-making is crucially important at all levels of biological complexity, from within single-celled organisms, through neural populations within the vertebrate brain, to collections of social organisms such as colonies of ants and honeybees, or societies of humans. What are the prospects for unifying the study of these apparently disparate systems? All can be conceptualised as voting systems at the appropriate level. In this review I will argue that optimality theory can be of fundamental importance in understanding all these systems. In particular I will argue that for groups without conflict of interests, such as neurons and social insect colonies, similar mechanisms could implement statistically optimal decision-making in apparently highly different systems at different levels of biological complexity. I will consider what currency these systems should optimize, and speculate about the possible application of this understanding to the design of voting systems where individual group members' interests are aligned, such as in certain types of human group, and in collectives of robots. I will also consider how established results from economics and political science, notably Arrow's Impossibility Theorem and Condorcet’s ‘jury theorem’, might relate to what we know of social insect voting systems, where interesting effects such as the emergence of collective rationality from the voting of irrational individuals have recently been demonstrated.
Maximizing Network Capacity in MANETs through Cooperative Communications

-Mobile Ad Hoc Networks are for many practical scenarios in the real world as it does not need any pre-established infrastructure. Nodes in the MANET are resource constrained. Communications over network consume energy resources of the network gradually. Therefore it is essential to have mechanisms that consume fewer resources over network. Cooperative communication is the strategy that can improve the life of MANET as it can save resources of the network. Many existing techniques that focused on cooperative communications gave importance to the issues related to link level physical layer. They mostly ignored the problems pertaining to upper layer like topology control, routing and network capacity. To overcome this problem, recently GUAN et al. came up with a scheme that ensures cooperative communications by controlling topology of the network. In this paper we implement that scheme practically using a prototype application that simulates the proof of concept. The empirical results revealed that in upper layer topology control can improve network capacity of MANET. Index Terms – Mobile Ad Hoc Network, cooperative communications, physical layer, topology control