DNA fragmentation index (DFI) as a measure of sperm quality and fertility in mice.

Although thousands of genetically modified mouse strains have been cryopreserved by sperm freezing, the likelihood of cryorecovery success cannot be accurately predicted using conventional sperm parameters. The objective of the present study was to assess the extent to which measurement of a sperm DNA fragmentation index (DFI) can predict sperm quality and fertility after cryopreservation. Using a modified TUNEL assay, we measured and correlated the DFI of frozen-thawed sperm from 83 unique mutant mouse strains with sperm count, motility and morphology. We observed a linear inverse correlation between sperm DFI and sperm morphology and motility. Further, sperm DFI was significantly higher from males with low sperm counts compared to males with normal sperm counts (P < 0.0001). Additionally, we found that viable embryos derived using sperm from males with high DFI (62.7 ± 7.2% for IVF and 73.3 ± 8.1% for ICSI) failed to litter after embryo transfer compared to embryos from males with low DFI (20.4 ± 7.9% for IVF and 28.1 ± 10.7 for ICSI). This study reveals that measurement of DFI provides a simple, informative and reliable measure of sperm quality and can accurately predict male mouse fertility

A paracasting model for concurrent access to replicated content

We propose a framework to study how to download effectively a copy of the same document from a set of replicated servers. A generalized application-layer anycasting, known as paracasting, has been proposed to advocate concurrent access of a subset of replicated servers to satisfy cooperatively a client's request. Each participating server satisfies the request in part by transmitting a subset of the requested file to the client. The client can recover the complete file when different parts of the file sent from the participating servers are received. This framework allows us to estimate the average time to download a file from the set of homogeneous replicated servers, and the request blocking probability when each server can accept and serve a finite number of concurrent. requests. Our results show that the file download time drops when a request is served concurrently by a larger number of homogeneous replicated servers, although the performance improvement quickly saturates when the number of servers used increases. If the total number of requests that a server can handle simultaneously is finite, the request blocking probability increases with the number of replicated servers used to serve a request concurrently. Therefore, paracasting is effective in using a small number of servers, say, up to four, to serve a request concurrently.published_or_final_versio

A resequencing model for high speed networks

In this paper, we propose a framework to study the resequencing mechanism in high speed networks. This framework allows us to estimate the packet resequencing delay, the total packet delay, and the resequencing buffer occupancy distributions when data traffic is dispersed on multiple disjoint paths. In contrast to most of the existing work, the estimation of the end-to-end path delay distribution is decoupled from the queueing model for resequencing. This leads to a simple yet general model, which can be used with other measurement-based tools for estimating the end-to-end path delay distribution to find an optimal split of traffic. We consider a multiple-node M/M/1 tandem network as a path model. When end-to-end path delays are Gaussian distributed, our results show that the packet resequencing delay, the total packet delay, and the resequencing buffer occupancy drop when the traffic is spread over a larger number of homogeneous paths, although the network performance improvement quickly saturates when the number of paths used increases. We find that the number of paths used in multipath routing should be small, say up to three. Besides, an optimal split of traffic occurs at paths with equal loads.published_or_final_versio

Reducing Memory Controller Transaction Queue Size in Scalable Memory Systems

Scalable memory systems provide scalable bandwidth to the core growth demands in multicores’ and embedded systems’ processors. In these systems, as memory controllers (MCs) are scaled, memory traffic per MC is reduced, therefore transaction queues become shallower. As a consequence, there is an opportunity to explore transaction queue utilization and its impact on energy. In this paper we propose to evaluating the performance and energy-per-bit impact of the number of entries of the transaction queues along the MCs in these systems. Preliminary results show that reducing 50% of the number of entries, bandwidth and energy-per-bit levels are not affected, while if reducing them of 93%, bandwidth is reduced of 91% and energy-per-bit levels are increased of 780%

Insights on Memory Controller Scaling for Multicore Embedded Systems

In recent years, the growth of the number of cores as well as the frequency of cores along different processor generations has proportionally increased bandwidth needs simultaneously in both CPU and GPU systems. In order to address the communication latency between CPU and GPU memories in recent implementation of heterogeneous mobile embedded systems with hard or firm real-time requirements, sharing the same address space adds significant levels of contention. In addition, when heterogeneous cores are simultaneously present in a single system, memory parallelism is significantly restricted by a small amount of memory controllers (MCs). As a strategy to approach these significant levels of memory pressure, it is proposed in this paper evaluations of the impact of scaling MCs up to four to eight units - limited by motherboard size for embedded purposes. Our findings show that performance is enhanced by a factor of 4× when employing only CPU cores, 4.6× when only GPU cores and finally, 2× when both CPU and GPU cores are simultaneously considered

淺析傳統中醫理論中的中和之道

本文从中和观的角度探讨了《周易》哲学对传统中医理论的影响，认为易理和医理都同样强调阴阳和谐的中正之道，要求阴阳当位、守正而用中，以保持事物的平衡和稳定，主张顺从天地之道，与自然界和谐共处，贵生广爱，追求“提挈天地，把握阴阳”的至善境界。《周易》哲学的中和理念实际上贯穿了整个传统中医的理论和临床。This paper has explored the influence of the philosophy of the Harmonious View in the “The Book of Changes” on TCM theories. It suggests that both of them emphasize the balance of Yin and Yang, requires that all things have to keep in balance and stability, and advocates to obeying the law of the nature. The philosophy of Harmonious View in the “The Book of Changes” has run throughout the theories of TCM and clinical practice.published_or_final_versio

A wavelength rerouting algorithm in wide-area all-optical networks

This paper considers rerouting and minimization of incurred disruption due to rerouting in a wide-area all-optical wavelength division multiplexed (WDM) network with random circuit arrivals and departures. One limitation of such a network is the wavelength continuity constraint imposed by the all-optical cross-connect switches which do not allow a circuit to be placed on a nonwavelength-continuous route. Wavelength rerouting is proposed to rearrange certain existing circuits to create a wavelength-continuous route in order to accommodate a new circuit. To reduce the disruption period, move-to-vacant wavelength-retuning (MTV_WR) is used as the basic operation of circuit migration, in which a circuit is moved to a vacant wavelength on the same path, and parallel MTV WR rerouting is used to reroute multiple circuits. An optimal algorithm is developed to minimize the weighted number of rerouted circuits with parallel MTV_WR rerouting. In our test network, wavelength rerouting can effectively alleviate the wavelength continuity constraint by reducing call blocking probability an average of 30% while reducing the number of rerouted circuits and the disruption period.published_or_final_versio

Does it hurt when others prosper?: Exploring the impact of heterogeneous reordering robustness of TCP

The congestion control mechanisms in the standardized Transmission Control Protocol (TCP) may misinterpret packet reordering as congestive loss, leading to spurious congestion response and under-utilization of network capacity. Therefore, many TCP enhancements have been proposed to better differentiate between packet reordering and congestive loss, in order to enhance the reordering robustness (RR) of TCP. Since such enhancements are incrementally deployed, it is important to study the interactions of TCP flows with heterogeneous RR. This paper presents the first systematic study of such interactions by exploring how changing RR of TCP flows influences the bandwidth sharing among these flows. We define the quantified RR (QRR) of a TCP flow as the probability that packet reordering causes congestion response. We analyze the variation of bandwidth sharing as QRR changes. This leads to the discovery of several interesting properties. Most notably, we discover the counter-intuitive result that changing one flow's QRR does not affect its competing flows in certain network topologies. We further characterize the deviation, from the ideal case of bandwidth sharing, as RR changes. We find that enhancing RR of a flow may increase, rather than decrease, the deviation in some typical network scenarios. © 2013 IEEE.published_or_final_versio

Communication-oriented smart grid framework

Upgrading the existing electricity grids into smart grids relies heavily on the development of information and communication technology which supports a highly reliable real-time monitoring and control system as well as coordination of various electricity utilities and market participants. In this upgrading process, smart grid communication is the key to success, and a simple but complete, innovative but compatible high-level communication-oriented smart grid framework is needed. This paper proposes a simple and flexible three-entity framework, so that devices employing the existing technologies are supported and can interoperate with those employing new technologies. © 2011 IEEE.published_or_final_versionThe 2nd IEEE International Conference on Smart Grid Communications (SmartGridComm 2011), Brussels, Belgium, 17-20 October 2011. In Proceedings of 2nd SmartGridComm, 2011, p. 61-6

Adaptive topology-transparent distributed scheduling in wireless networks

Proceedings of the IEEE International Conference on Communications, 2010, p. 1-5Transmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (TDMA) frame length. Most of the scheduling algorithms are topology-dependent. They are generally graph-based and depend on the exact network topology information. Thus, they cannot adapt well to the dynamic wireless environment. In contrast, topology-transparent TDMA scheduling algorithms do not need detailed topology information. However, these algorithms offer very low minimum throughput. The objective of this work is to propose an adaptive topology-transparent scheduling algorithm to offer better throughput performance. With our algorithm, each node finds a transmission schedule so as to reduce the transmission conflicts and adapt better to the changing network environment. The simulation results show that the performance of our algorithm is better than the existing topology-transparent algorithms. ©2010 IEEE.published_or_final_versio