Miracle-dz/UniFAR-FTUs huggingface dataset:
Authorized Private Keyword Search over Encrypted Personal Health Records in Cloud Computing

Recently, personal health record (PHR) has emerged as a patient-centric model of health information exchange, which features storing PHRs electronically in one centralized place, such as a third-party cloud service provider. Although this greatly facilitates the management and sharing of patients’ personal health information (PHI), there have been serious privacy concerns about whether these service providers can be fully trusted in handling patients’ sensitive PHI. To ensure patients’ control over their own privacy, data encryption has been proposed as a promising solution. However, key functionalities of a PHR service such as keyword searches by multiple users become especially challenging with PHRs stored in encrypted form. Basically, users’ queries should be performed in a privacypreserving way that hides both the keywords in the queries and documents. More importantly, in order to prevent unnecessary exposure of patients’ PHI from unlimited query capabilities, each user’s query capability should be authorized and controlled in a fine-grained manner, which shall be achieved with a high level of system scalability. Existing works in searchable encryption are unable to meet the above requirements simultaneously. In this paper, we formulate and address the problem of authorized private keyword searches (APKS) on encrypted PHR in cloud computing environments. We first present a scalable and fine-grained authorization framework for searching on encrypted PHR, where users obtain query capabilities from localized trusted authorities according to their attributes, which is highly scalable with the user scale of the system. Then we propose two novel solutions for APKS based on a recent cryptographic primitive, hierarchical predicate encryption (HPE), one with enhanced efficiency and the other with enhanced query privacy. In addition to document privacy and query privacy, other salient features of our schemes include: efficiently support multi-dimensional, multiple keyword searches with simple range query, allow delegation and revocation of search capabilities. We implement our scheme on a modern workstation, and experimental results demonstrate its suitability for practical usage.
Depth error concealment based on decision making

One of the common form of representing stereoscopic video is combination of 2D video with its corresponding depth map which is made by a laser camera to illustrate depth in the video. When this type of video is transmitted over error prone channels, the packet loss leads to frame loss; and mostly this frame lost occur in depth frames. Thus, a depth error concealment based on decision making termed as DM-PV, which exploits high correlation of 2-D image and its corresponding depth map. The 2D image provide information about the missing frame in the depth sequence to assist the decision making process in order to conceal the lost frames. The process involves inserting proper blank frame and duplication of previous frames instead of missing frames in depth sequence. PSNR performance improves over frame copy method has no decision making. Furthermore, subjective quality of stereoscopic video is better using DM-PV.
The absorption-dominated model for the X-ray spectra of type I active galaxies: MCG–6-30-15

MCG–6-30-15 is the archetypal example of a type I active galaxy showing broad ‘red-wing’ emission in its X-ray spectrum at energies below the 6.4 keV Fe Kα emission line and a continuum excess above 20 keV. Miller et al. showed that these spectral features could be caused by clumpy absorbing material, but Reynolds et al. have argued that the observed Fe Kα line luminosity is inconsistent with this explanation unless the global covering factor of the absorber(s) is very low. However, the Reynolds et al. calculation effectively considers the only source of opacity to be the Fe K bound–free transition and neglects the opacity at the line energy: correction to realistic opacity decreases the predicted line flux by a large factor. We also discuss the interpretation of the covering factor and the possible effect of occultation by the accretion disc. Finally, we consider a model for MCG–6-30-15 dominated by clumpy absorption, which is consistent with a global covering factor of 0.45, although models that include the effects of Compton scattering are required to reach a full understanding. Variations in covering fraction may dominate the observed X-ray spectral variability.
Slepian-Wolf coding with a mismatched decoder

Slepian-Wolf coding with a mismatched decoding metric is studied. Two different dualities between Slepian-Wolf coding and channel coding under mismatched decoding are established. These two dualities provide a systematic framework for comparing linear Slepian-Wolf codes, nonlinear Slepian-Wolf codes, and variable-rate Slepian-Wolf codes. In contrast with the fact that linear codes suffice to achieve the Slepian-Wolf limit under matched decoding, the minimum rate achievable with linear Slepian-Wolf codes under mismatched decoding can be strictly higher than that achievable with nonlinear Slepian-Wolf codes.
Capacity of Random Wireless Networks : Impact of Cooperative Network Coding

Since the pioneer work in [1], the throughput capacity of random wireless networks has been studied extensively in the literature. Nevertheless, most existing studies are based on the assumption that each transmission has one sender and one receiver. In our recent study, we have proposed a fundamentally different transmission scheme, i.e., the cooperative network coding scheme, in which data on opposite directions can be delivered to the same intermediate node simultaneously. In this paper, we investigate the impact of cooperative network coding on the throughput capacity of random wireless networks. Our analysis show that the cooperative network coding scheme can substantially improve the throughput capacity. Tighter bounds for the capacity in two-dimensional random wireless networks are proved in this paper. Also, we derive an achievable lower bound for random wireless networks with network coding.
The DNA damage response in mammalian oocytes

DNA damage is one of the most common insults that challenge all cells. To cope, an elaborate molecular and cellular response has evolved to sense, respond to and correct the damage. This allows the maintenance of DNA fidelity essential for normal cell viability and the prevention of genomic instability that can lead to tumor formation. In the context of oocytes, the impact of DNA damage is not one of tumor formation but of the maintenance of fertility. Mammalian oocytes are particularly vulnerable to DNA damage because physiologically they may lie dormant in the ovary for many years (>40 in humans) until they receive the stimulus to grow and acquire the competence to become fertilized. The implication of this is that in some organisms, such as humans, oocytes face the danger of cumulative genetic damage for decades. Thus, the ability to detect and repair DNA damage is essential to maintain the supply of oocytes necessary for reproduction. Therefore, failure to confront DNA damage in oocytes could cause serious anomalies in the embryo that may be propagated in the form of mutations to the next generation allowing the appearance of hereditary disease. Despite the potential impact of DNA damage on reproductive capacity and genetic fidelity of embryos, the mechanisms available to the oocyte for monitoring and repairing such insults have remained largely unexplored until recently. Here, we review the different aspects of the response to DNA damage in mammalian oocytes. Specifically, we address the oocyte DNA damage response from embryonic life to adulthood and throughout oocyte development.
An overlay architecture for cognitive radio systems

In this paper, we examine joint optimization of the transmitter/receiver pulse shaping filter of an overlay cognitive wireless system that allows both the overlay (new) and the legacy (existing) users to share the spectrum at the same time without the need of sensing the spectrum. The composite sum of the mean-squared error (MSE) of the overlay system and the excess MSE in the legacy system due to the presence of the overlay system is used as figure of merit. The effect of varying the overlay transmitter power along with the amount of overlap between the overlay and the legacy users are investigated.
Transferability of OBIA rulesets for IDP camp analysis in DARFUR

The analysis of refugee and IDP (internally displaced persons) camps from VHSR (very high spatial resolution) satellite imagery can assist humanitarian relief organisations by providing population estimations and camp structure analysis based on automated dwelling extraction. Since smooth transferability of rulesets in a fine scale and high complexity environment is limited, we present an approach of developing and transferring master rulesets. The master ruleset aims to automate OBIA (object-based image analysis) tasks which can be seen as more or less independent from different sensors and geographic areas, such as adapted segmentations based on edge densities to delineate man-made structures or classifications based on shape and context. Only some steps within the classification process which are based on hard-coded values (size constraints, spectral thresholds) have to be adapted. This approach reduces the time required to analyse different IDP camps or the same camp at different times. In previous work, the master ruleset has been developed for the IDP camp Zam Zam in Darfur, Sudan, using QuickBird imagery. In the study presented, the transferability of object-based image analysis rulesets was tested in a demonstrator exercise according to a request posed by the World Food Program (WFP). The aim was to extract dwelling structures and variations in dwelling densities in three IDP camps in West Darfur for estimating population figures using GeoEye-1 imagery. Results were validated using independent visual interpretation, showing high agreement for all dwelling density classes and absolute numbers of extracted dwellings (15,349 automated dwelling structures versus 14,261 visually extracted dwelling structures) for the IDP camp Um Dukhun. In the other two camps, however, the areas of higher dwelling density were apparently underestimated by the automated approach. * Corresponding author.
Projected life expectancy of people with HIV according to timing of diagnosis

Background and objectives:Effective antiretroviral therapy (ART) has contributed greatly toward survival for people with HIV, yet many remain undiagnosed until very late. Our aims were to estimate the life expectancy of an HIV-infected MSM living in a developed country with extensive access to ART and healthcare, and to assess the effect of late diagnosis on life expectancy. Methods:A stochastic computer simulation model of HIV infection and the effect of ART was used to estimate life expectancy and determine the distribution of potential lifetime outcomes of an MSM, aged 30 years, who becomes HIV positive in 2010. The effect of altering the diagnosis rate was investigated. Results:Assuming a high rate of HIV diagnosis (median CD4 cell count at diagnosis, 432 cells/&mgr;l), projected median age at death (life expectancy) was 75.0 years. This implies 7.0 years of life were lost on average due to HIV. Cumulative risks of death by 5 and 10 years after infection were 2.3 and 5.2%, respectively. The 95% uncertainty bound for life expectancy was (68.0,77.3) years. When a low diagnosis rate was assumed (diagnosis only when symptomatic, median CD4 cell count 140 cells/&mgr;l), life expectancy was 71.5 years, implying an average 10.5 years of life lost due to HIV. Conclusion:If low rates of virologic failure observed in treated patients continue, predicted life expectancy is relatively high in people with HIV who can access a wide range of antiretrovirals. The greatest risk of excess mortality is due to delays in HIV diagnosis.
Mesh and Torus Chaotic Routing

The chaos router is an adaptive nonminimal message router for multicomputers that is simple enough to compete with the fast, oblivious routers now in use in commercial machines. It improves on previous adaptive routers by using randomization, which eliminates the need for complex livelock protection and speeds the router. The two-dimensional chaos router is shown to be theoretically sound and physically realizable. Extensive simulation studies compare chaos routing with oblivious and de ection routing in mesh and torus networks. Chaos routing is shown to be competitive for mesh networks and superior for torus networks. This high performance is, perhaps, unexpected for the mesh since there is no nite bound on the delivery time of any message.
Clinical and molecular studies in a family with probable X-linked dominant Charcot-Marie-Tooth disease involving the central nervous system.

OBJECTIVE To investigate the clinical and molecular characteristics of an apparently X-linked dominant form of Charcot-Marie-Tooth (CMT) disease in a family with central nervous system involvement and additional features. BACKGROUND Charcot-Marie-Tooth disease may be inherited as an autosomal dominant, autosomal recessive, or X-linked trait. In the X-linked dominant form of CMT, females demonstrate milder clinical and electrophysiological features compared with their male relatives. METHODS Clinical and related examinations were performed in 4 affected individuals from a family with a novel form of CMT affecting males more severely than females. DNA analysis of the connexin 32 (Cx32) gene and proteolipid protein (PLP) gene was performed. We genotyped 3 members of the family to determine which regions of the X chromosome were inherited discordantly in the affected and unaffected brothers. RESULTS Clinical studies revealed significant spasticity, hyperreflexia, and delayed central conduction, in addition to peripheral neuropathy. Nerve conduction velocities were slower in the affected males than in the affected females. Direct DNA sequencing of the Cx32 coding region and neural-specific promoter were normal. A PLP null mutation was excluded. Levels of very long chain fatty acids were normal. Genotyping studies of the X chromosome supported X-linked inheritance of the neuropathy. CONCLUSIONS This family differs from others with hereditary motor and sensory neuropathic diseases by the presence of upper motor neuron signs and additional features. The clinical features and inheritance pattern are consistent with X-linked dominant inheritance or autosomal dominant inheritance.
Influence of haemodialysis on variability of pulse wave velocity in chronic haemodialysis patients.

BACKGROUND The major determinants of pulse wave velocity (PWV) in haemodialysis (HD) patients are not fully known. We studied chronic HD patients to assess the effect of cyclic variations in both hydration status and blood pressure on PWV. METHODS Twenty patients were examined along three consecutive HD sessions and interdialysis periods during a week-long period. Twenty healthy subjects and 20 chronic kidney disease (CKD) patients (stage 5) were evaluated as controls. RESULTS In contrast to controls, HD patients showed cyclic changes in PWV. Specifically, PWV values in HD patients were significantly higher prior to the first HD session of the week compared with values measured prior to the other two HD sessions during the week. In addition, PWV showed significant reductions during each dialysis session (15.6 +/- 5.2 to 9.3 +/- 2.3, 13.4 +/- 4.0 to 8.7 +/- 2.4, and 12.4 +/- 2.6 to 9.2 +/- 2.2 m/sec, before and after the first, second and third weekly dialysis sessions, respectively). Nevertheless, the weighted weekly values of PWV in HD patients (10.8 +/- 5.7 m/sec) were similar to those in CKD patients (9.9 +/- 4.2 m/sec). The HD ultrafiltration rate (UF) was significantly correlated with intradialysis PWV changes (r = 0.465; P < 0.001) and with after dialysis PWV values (r = -0.654; P < 0.0001). Blood pressure changes during dialysis were weakly correlated with post-dialysis PWV (r = -0.267; P < 0.05), but not with PWV changes during dialysis. CONCLUSIONS In chronic HD patients, single PWV values varied widely during 1 week of HD sessions, whereas the weighted level showed only a slight increase. The major determinant of changes in PWV during HD appears to be the alterations in hydration status; the most representative time point for PWV measurements during HD corresponds to the interdialysis days.
Targeted deletion of (cid:1) -adducin results in absent (cid:2) - and (cid:3) -adducin, compensated hemolytic anemia, and lethal hydrocephalus in mice

tetramers (cid:2) -subunits at spectrin-actin junctions, complexes. Mouse RBCs small amounts of (cid:3) -adducin. Platelets contain (cid:1) - and (cid:3) -adducin only. Adducin functions as a barbed-end actin capping protein to regulate actin ﬁlament length and recruits spectrin to the ends of actin ﬁlaments. To further deﬁne addu-cin’s role in vivo, we generated (cid:1) -adducin knockout mice. (cid:1) -Adducin is absent in all tissues examined in homozygous null mice. In RBCs, (cid:2) - and (cid:3) -adducin are also absent, indicating that (cid:1) -adducin is the limiting subunit in tetramer formation at the spectrin-actin junction. Similarly, (cid:3) adducin is absent in (cid:1) -null platelets. (cid:1) Adducin–null mice display compensated hemolytic anemia with features characteristic of RBCs in hereditary spherocytosis (HS), including spherocytes with signiﬁcant loss of surface area, decreased mean corpuscular volume (MCV), cell dehydra-tion,andincreasedosmoticfragility.Plate- lets maintain their normal discoid shape, and bleeding times are normal. (cid:1) -Adducin–null mice show growth retardation at birth and throughout adulthood. Approximately 50% develop lethal communicating hydrocephalus with striking dilation of the lateral, third, and fourth ventricles. These data indicate that adducin plays a role in RBC membrane stability and in cerebrospinal ﬂuid ho-meostasis. (Blood. 2008;112:4298-4307) hybridization probe detect homologous recombination. (B6;129)
Interaction between cytochalasin B-treated malarial parasites and erythrocytes. Attachment and junction formation

We have previously demonstrated that invasion of erythrocytes (RBCs) by malaria merozoites follows a sequence: recognition and attachment in an apical orientation associated with widespread deformation of the RBC, junction formation, movement of the junction around the merozoite that brings the merozoite into the invaginated RBC membrane, and sealing of the membrane. In the present paper, we describe a method for blocking invasion at an early stage in the sequence. Cytochalasin-treated merozoites attach specifically to host RBCs, most frequently by the apical region that contains specialized organelles (rhoptries) associated with invasion. The parasite then forms a junction between the apical region and the RBC. Cytochalasin blocks movement of this junction, a later step in invasion. Cytochalasin-treated (Plasmodium knowlesi) merozoites attach to Duffy-negative human RBCs, although these RBCs are resistant to invasion by the parasite. The attachment with these RBCs, however, differs from susceptible RBCs in that there is no junction formation. Therefore the Duffy associated antigen appears to be involved in junction formation, not initial attachment.
Levels of personality organization and internal relational patterns

background This study aimed to determine whether level of personality organization is associated with a relational pattern present in an autobiographical narrative about an important interpersonal relationship. The main goals were to explore whether and how the components of the internal relationship pattern, and whether and how the configurations of the components, are related to personality organization, when integrated personality organization (IPO) is taken into account.
Adaptive Utility Based Scheduling

This work proposes a new general-purpose framework for adaptive scheduling of entities that interact in an environment. The framework developed was employed for scheduling packets in a packet switching network (PSN) and focuses on determining the order in which packets should be forwarded from a queue based on the everchanging state of the network. A scheduling system has to constantly adapt to various network states (the changing network parameters) in order to achieve maximum policy compliance. The framework presented in this paper attempts to maximize policy compliance while minimizing overhead, implementation difficulty, and computational complexity. The utility assessment of forwarding a packet in a network and the quantification of its impact, on the overall policy compliance of the network is very difficult to achieve. The problem of relevant utility assignment with minimal computational complexity is achieved using a well-known utility assignment technique in operational research, Multi Attribute Utility Theory (MAUT). Adaptability to various network states is achieved by a state aware neural network, which helps in relevant utility assignment for a given state of the network.
NAT Traversal Technology of Reducing Load on Relaying Server for P2P Connections

This paper proposes a novel Network Address Translator (NAT) traversal technology to create Peer-to-Peer (P2P) connections through NAT devices, enabling load on the relaying server to be remarkably reduced. The conventional NAT traversal technologies can inflict heavy load on the relaying server because they cannot be applied to NAT devices which randomly assign the port number. In addition, such technologies can overload the relaying server because it must exchange packets with terminals to estimate NAT device's IP address/port number. Our technology estimates the IP address/port number without the relaying server based on a payload checksum of an ICMP message sent back after an investigating packet is transmitted toward a desired peer. Our technology can create P2P connections without inflicting load on the relaying server even in the case where NAT devices randomly assign the port number because it can exactly estimate the assigned port number with only terminal-side processing. This paper clarifies that our technology can reduce more than 80% of the load on the relaying server as compared with the conventional technologies.
A new non-interactive deniable authentication protocol based on generalized ElGamal signature scheme

A deniable authentication protocol enables a receiver to identify the source of a given message, but not to prove the identity of the sender to any third party. This can be very useful in e-government or e-commerce, such as in e-voting or online negotiation. The notion of “non-interactive” was first proposed by Z. Shao[1], after that, many non-interactive deniable authentication protocols were proposed. Non-interactive protocols are more efficient than interactive protocols because the information transmitted is much less. The proposed protocol is based on generalized ElGamal signature scheme, it can be and only can be authenticated by the intended receiver, and it is deniable. Moreover, it can withstand forgery and impersonate attacks.