1,961 research outputs found
Complexity Analysis of Balloon Drawing for Rooted Trees
In a balloon drawing of a tree, all the children under the same parent are
placed on the circumference of the circle centered at their parent, and the
radius of the circle centered at each node along any path from the root
reflects the number of descendants associated with the node. Among various
styles of tree drawings reported in the literature, the balloon drawing enjoys
a desirable feature of displaying tree structures in a rather balanced fashion.
For each internal node in a balloon drawing, the ray from the node to each of
its children divides the wedge accommodating the subtree rooted at the child
into two sub-wedges. Depending on whether the two sub-wedge angles are required
to be identical or not, a balloon drawing can further be divided into two
types: even sub-wedge and uneven sub-wedge types. In the most general case, for
any internal node in the tree there are two dimensions of freedom that affect
the quality of a balloon drawing: (1) altering the order in which the children
of the node appear in the drawing, and (2) for the subtree rooted at each child
of the node, flipping the two sub-wedges of the subtree. In this paper, we give
a comprehensive complexity analysis for optimizing balloon drawings of rooted
trees with respect to angular resolution, aspect ratio and standard deviation
of angles under various drawing cases depending on whether the tree is of even
or uneven sub-wedge type and whether (1) and (2) above are allowed. It turns
out that some are NP-complete while others can be solved in polynomial time. We
also derive approximation algorithms for those that are intractable in general
Serum ferritin levels and polycystic ovary syndrome in obese and nonobese women
AbstractObjectiveThe aim of this study is to evaluate serum ferritin levels and polycystic ovary syndrome (PCOS)-related complications in obese and nonobese women.Materials and methodsThis retrospective study included 539 (286 with PCOS and 253 without PCOS).ResultsSerum ferritin correlated with menstrual cycle length, sex hormone-binding globulin, total testosterone, androstenedione, triglyceride, and total cholesterol in both obese and nonobese women. Obese women with high ferritin levels exhibited higher insulin resistance, impaired glucose tolerance, and liver enzymes (glutamic oxaloacetic transaminase, glutamic pyruvic transaminase) than obese women with low ferritin levels. However, among nonobese women, insulin resistance and risk of diabetes were not significantly different between the high and low ferritin groups. Independent of obesity, hypertriglyceridemia was the major metabolic disturbance observed in women with elevated serum ferritin levels.ConclusionElevated serum ferritin levels are associated with increased insulin resistance and risk of diabetes in obese women but not in nonobese women. However, higher serum ferritin levels were correlated with a greater risk of hyperglyceridemia in both obese and nonobese women. Therefore, hypertriglyceridemia in women with PCOS might be associated with iron metabolism
Federated Deep Reinforcement Learning for THz-Beam Search with Limited CSI
Terahertz (THz) communication with ultra-wide available spectrum is a
promising technique that can achieve the stringent requirement of high data
rate in the next-generation wireless networks, yet its severe propagation
attenuation significantly hinders its implementation in practice. Finding beam
directions for a large-scale antenna array to effectively overcome severe
propagation attenuation of THz signals is a pressing need. This paper proposes
a novel approach of federated deep reinforcement learning (FDRL) to swiftly
perform THz-beam search for multiple base stations (BSs) coordinated by an edge
server in a cellular network. All the BSs conduct deep deterministic policy
gradient (DDPG)-based DRL to obtain THz beamforming policy with limited channel
state information (CSI). They update their DDPG models with hidden information
in order to mitigate inter-cell interference. We demonstrate that the cell
network can achieve higher throughput as more THz CSI and hidden neurons of
DDPG are adopted. We also show that FDRL with partial model update is able to
nearly achieve the same performance of FDRL with full model update, which
indicates an effective means to reduce communication load between the edge
server and the BSs by partial model uploading. Moreover, the proposed FDRL
outperforms conventional non-learning-based and existing non-FDRL benchmark
optimization methods
Rhythm-Flexible Voice Conversion without Parallel Data Using Cycle-GAN over Phoneme Posteriorgram Sequences
Speaking rate refers to the average number of phonemes within some unit time,
while the rhythmic patterns refer to duration distributions for realizations of
different phonemes within different phonetic structures. Both are key
components of prosody in speech, which is different for different speakers.
Models like cycle-consistent adversarial network (Cycle-GAN) and variational
auto-encoder (VAE) have been successfully applied to voice conversion tasks
without parallel data. However, due to the neural network architectures and
feature vectors chosen for these approaches, the length of the predicted
utterance has to be fixed to that of the input utterance, which limits the
flexibility in mimicking the speaking rates and rhythmic patterns for the
target speaker. On the other hand, sequence-to-sequence learning model was used
to remove the above length constraint, but parallel training data are needed.
In this paper, we propose an approach utilizing sequence-to-sequence model
trained with unsupervised Cycle-GAN to perform the transformation between the
phoneme posteriorgram sequences for different speakers. In this way, the length
constraint mentioned above is removed to offer rhythm-flexible voice conversion
without requiring parallel data. Preliminary evaluation on two datasets showed
very encouraging results.Comment: 8 pages, 6 figures, Submitted to SLT 201
Reducing Side Effects of Hiding Sensitive Itemsets in Privacy Preserving Data Mining
Data mining is traditionally adopted to retrieve and analyze knowledge from large amounts of data. Private or confidential data may be sanitized or suppressed before it is shared or published in public. Privacy preserving data mining (PPDM) has thus become an important issue in recent years. The most general way of PPDM is to sanitize the database to hide the sensitive information. In this paper, a novel hiding-missing-artificial utility (HMAU) algorithm is proposed to hide sensitive itemsets through transaction deletion. The transaction with the maximal ratio of sensitive to nonsensitive one is thus selected to be entirely deleted. Three side effects of hiding failures, missing itemsets, and artificial itemsets are considered to evaluate whether the transactions are required to be deleted for hiding sensitive itemsets. Three weights are also assigned as the importance to three factors, which can be set according to the requirement of users. Experiments are then conducted to show the performance of the proposed algorithm in execution time, number of deleted transactions, and number of side effects
Applying a Heuristic Approach for a Minimum-cost Operating Strategy for Tap Water
Source: ICHE Conference Archive - https://mdi-de.baw.de/icheArchive
- …