Miracle-dz/UniFAR-FTUs huggingface dataset:
Pna Probability, Networks and Algorithms Probability, Networks and Algorithms Wireless Data Performance in Multi-cell Scenarios Wireless Data Performance in Multi-cell Scenarios Wireless Data Performance in Multi-cell Scenarios

CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ABSTRACT The performance of wireless data systems has been extensively studied in the context of a single base station. In the present paper we investigate the flow-level performance in networks with multiple base stations. We specifically examine the complex, dynamic interaction introduced by the strong impact of interference from neighboring base stations. We derive two types of lower and upper bounds for the number of active flows, transfer delays and flow throughputs in the various cells. While the first type of bounds are rather rough and simple to compute, the second type of bounds are sharper, but harder to calculate. In order to obtain closed-form estimates for the latter bounds, we introduce two limit regimes, termed fluid and quasi-stationary regime, where the system dynamics evolve on a very fast and a very slow time scale, respectively. Importantly, the performance in both limit regimes is insensitive, thus yielding simple, explicit estimates that render the detailed statistical characteristics of the system largely irrelevant. Numerical experiments show that the upper bounds evaluated in the quasi-stationary regime provide conservative and extremely tight approximations. Note: The work of the second and third authors was carried out in part under the project PNA2.2 ``Wireless Networks'' and supported by a grant from France Telecom R&D. ABSTRACT The performance of wireless data systems has been extensively studied in the context of a single base station. In the present paper we investigate the flow-level performance in networks with multiple base stations. We specifically examine the complex, dynamic interaction introduced by the strong impact of interference from neighboring base stations. We derive two types of lower and upper bounds for the number of active flows, transfer delays and flow throughputs in the various cells. While the first type of bounds are rather rough and simple to compute, the second type of bounds are sharper, but harder to calculate. In order to obtain closed-form estimates for the latter bounds, we introduce two limit regimes, termed fluid and quasi-stationary regime, where the system dynamics evolve on a very fast and a very slow time scale, respectively. Importantly, the performance in both limit regimes is insensitive, thus yielding simple, explicit estimates that render the detailed statistical characteristics of the system largely irrelevant. Numerical experiments show that the upper …
A Novel Parser Design Algorithm Based on Artificial Ants

This article presents a unique design for a parser using the ant colony optimization algorithm. The paper implements the intuitive thought process of human mind through the activities of artificial ants. Traditional methods of designing parser involve calculation of different sets like FIRST, FOLLOW, GOTO, CLOSURE and parsing or precedence relation tables. Calculation of these tables and sets are both memory and time consuming. Moreover, the grammar concerned has to be converted into a context-free, non-redundant and unambiguous one. The scheme presented here uses a bottom-up approach and the parsing program can directly use ambiguous or redundant grammars. We allocate a node corresponding to each production rule present in the given grammar. Each node is connected to all other nodes (representing other production rules), thereby establishing a completely connected graph susceptible to the movement of artificial ants. Ants are endowed with some memory that they use to carry the sentential form derived from the given input string to the parser. Each ant tries to modify this sentential form by the production rule present in the node and upgrades its position until the sentential form reduces to the start symbol S. Successful ants deposit pheromone on the links that they have traversed through in inverse proportion of the number of hops required to complete a successful tour. Eventually, the optimum path is discovered by the links carrying maximum amount of pheromone concentration. The design is simple, versatile, robust and effective and obviates the calculation of the above mentioned sets and precedence relation tables. Further advantages of our scheme lie in i) ascertaining whether a given string belongs to the language represented by the grammar, and ii) finding out the shortest possible path from the given string to the start symbol S in case multiple routes exist.
Intelligent diagnosis algorithm of power equipment based on acoustic signal processing

The operational state determination of power equipment is a key prerequisite to realize maintenance. On studying the relationship between power equipment state and its acoustic wave mutation character, a new diagnosis scheme of power equipment fault has been put forward. After the running acoustic signal acquired, MFCC coefficient has been selected the acoustic signal various band energy feature, and dynamic time warping (DTW) is utilized to determine equipment type. Then local energy band based wavelet packet decomposition is used in fault feature extraction. According to these feature parameters values and expert experience scoring, the knowledge based of fault database was established to diagnosis power equipment state and its fault level. Lastly, By 200 group transformer measured acoustic signal analysis experiments have been completed, and the results show the series acoustic treatment of methods is effective, and the diagnosis scheme of equipment failures have great practical value.
Design of low-power variable gain amplifier with linear-in-decibel dependency

The article addresses a design procedure of low-power variable gain amplifier employing so-called bulk-driven transistors in 130 nm CMOS technology, working with the power supply voltage of only 600 mV. Mentioned approach represents rather unconventional and still quite uncharted design technique. Therefore, the research potential is tremendous. The paper describes the proposed amplifier along with the achieved simulation results, process stability analysis as well as robustness over temperature variations. Additional circuit block covered by the paper is responsible for maintaining the linear gain dependency over the controlling voltage. The conclusions and experience on the design flow resulting from this research are directly incorporated into the lectures and general studying materials within the academic curriculum.
The method of regularized Stokeslets in three dimensions : Analysis, validation, and application to helical swimming

The method of regularized Stokeslets is a Lagrangian method for computing Stokes flow driven by forces distributed at material points in a fluid. It is based on the superposition of exact solutions of the Stokes equations when forces are given by a cutoff function. We present this method in three dimensions, along with an analysis of its accuracy and performance on the model problems of flow past a sphere and the steady state rotation of rigid helical tubes. Predicted swimming speeds for various helical geometries are compared with experimental data for motile spirochetes. In addition, the regularized Stokeslet method is readily implemented in conjunction with an immersed boundary representation of an elastic helix that incorporates passive elastic properties as well as mechanisms of internal force generation.
Explicit angle structures for veering triangulations

Agol recently introduced the notion of a veering triangulation, and showed that such triangulations naturally arise as layered triangulations of fibered hyperbolic 3‐manifolds. We prove, by a constructive argument, that every veering triangulation admits positive angle structures, recovering a result of Hodgson, Rubinstein, Segerman, and Tillmann. Our construction leads to explicit lower bounds on the smallest angle in this positive angle structure, and to information about angled holonomy of the boundary tori. 57M50, 57R05
GPU Based Spot Noise Parallel Algorithm for 2D Vector Field Visualization

Graphic Processing Unit (GPU) has involved into a parallel computation for it’s massively multi threaded architecture. Due to its high computational power, GPU has been used to deal with many problems that can be easily parallelized. This paper will present a GPU based spot noise parallel algorithm for 2D vector field visualization. It uses spot noise method with GPU resources and compute unified device architecture (CUDA) to visualize 2D vector field. Vector field are partitioned to multiple thread so that a large number of data are processed simultaneously. Fast on-chip shared memory is used on GPU to optimize the performance and a data transformation mechanism between host and device is presented. The parallel algorithm applies these strategies to a 2D velocity field and obtains up to 16X speedup compared with conventional sequential computation. It is suitable for interactive applications and in-time remote visualization of vector fields.
Physiological and Pathological Roles of Aldose Reductase in Schwann Cells

Aldose reductase (AR), the first enzyme in the polyol pathway, is predominantly localized to Schwann cells in the peripheral nervous system (PNS). The exaggerated glucose flux into the pathway via AR in Schwann cells under diabetic conditions is thought to be a major contributing factor in the pathogenesis of diabetic neuropathy, and the restoring effects of AR inhibitors on the neurological symptoms of experimental diabetic animals and patients with diabetes have been investigated. In contrast, however, much less attention has been paid to the physiological functions of AR in the PNS and other tissues (i.e. osmoregulation, aldehyde detoxification, and steroid and catecholamine metabolism). In this paper, we focus on the functional significance of AR in Schwann cells under normal and diabetic conditions. A spontaneously immortalized adult mouse Schwann cell line IMS32 displays distinct Schwann cell phenotypes and high glucose (30 mM)-induced upregulation of AR expression and accumulation of sorbitol and fructose. This cell line can be a useful model to study the physiological and pathological roles of AR in the PNS, especially the interactions between the polyol pathway and other pathogenetic factors of diabetic neuropathy, and the functional redundancy of AR and other enzymes in aldehyde detoxification.
Feasibility of monolithic and 3D-stacked DC-DC converters for microprocessors in 90nm technology generation

Rapidly increasing input current of microprocessors resulted in rising cost and motherboard real estate occupied by decoupling capacitors and power routing. We show by analysis that an on-die switching DC-DC converter is feasible for future microprocessor power delivery. The DC-DC converter can be fabricated in an existing CMOS process (90nm-180nm) with a back-end thin-film inductor module. We show that 85% efficiency and 10% output voltage droop can be achieved for 4:1, 3:1, and 2:1 conversion ratios, area overhead of 5% and no additional on-die decoupling capacitance. A 4:1 conversion results in 3.4/spl times/ smaller input current and 6.8/spl times/ smaller external decoupling.
Large Span statistical language models: application to homophone disambiguation for large vocabulary speech recognition in French

Homophone words is one of the specific problems of Automatic Speech Recognition (ASR) in French. Moreover, this phenomenon is particularly high for some inflections like the singular/plural inflection (72% of the 40.7K lemma of our 240K word dictionary have inflected forms which are homophonic). In order to take into account worddependencies spanning over a variable number of words, it is interesting to merge local language models, like 3-gram or 3-class models, with largespan models. We present in this paper two kinds of models : a phrase-based model, using phrases obtained from a training corpus by means of a finite-state parser; a homophone cache-based model, using derivation of constraints from word histories stored in a cache memory.
Perceptual Content Authentication and Tamper Detection of Facial Image

Immersive sound spaces which are synthesized using virtual reality techniques have recently been developed to realize highly realistic telecommunication interactions. In real world soundscapes the sounds we usually listen to include background or “ambient” sounds such as the sounds of the ventilation system in a room. However, current virtual auditory display systems generate point sound sources which are often attributed to specific object locations. Therefore, it is possible to reproduce sound direction, but no information about the sound space is included. As a result, the sound output is often dry and unnatural. In this research, a rendering method for ambient sounds and its effects are investigated. An optimum rendering algorithm of ambient sounds is proposed and its effects on the quality of sound space are examined.
An Efficient VLSI Architecture and FPGA Implementation of High-Speed and Low Power 2-D DWT for (9, 7) Wavelet Filter

Summary This paper presents an efficient VLSI architecture of a high speed, low power 2-D Discrete Wavelet Transform computing. The proposed architecture, based on new and fast lifting scheme approach for (9, 7) filter in DWT, reduces the hardware complexity and memory accesses. Moreover, it has the ability of performing progressive computations by minimizing the buffering between the decomposition levels. The system is fully compatible with JPEG2000 standard. Our designs were realized in VHDL language and optimized in terms of throughput and memory requirements. The implementations are completely parameterized with respect to the size of the input image and the number of decomposition levels. The proposed architecture is verified by simulation and successfully implemented in a Cyclone II and Stratix III FPGAs, and the estimated frequency of operation is 350 MHz. The resulting computing rate is up to 48 frames (4096x2160) per second with 24 bpp. The architecture has regular structure, simple control flow, small embedded buffers and low power consumption. Thus, it is very suitable for new generation image compression systems, such as JPEG2000.
Speech Compression

: Speech compression is a key technology underlying digital cellular communications, VoIP, voicemail, and voice response systems. We trace the evolution of speech coding based on the linear prediction model, highlight the key milestones in speech coding, and outline the structures of the most important speech coding standards. Current challenges, future research directions, fundamental limits on performance, and the critical open problem of speech coding for emergency ﬁrst responders are all discussed.
Peroxisome Proliferator-Activated Receptor Gamma Polymorphisms and Coronary Heart Disease

Single nucleotide polymorphisms (SNPs) in the peroxisome proliferator-activated receptor γ (PPARG) gene have been associated with cardiovascular risk factors, particularly obesity and diabetes. We assessed the relationship between 4 PPARG SNPs (C-681G, C-689T, Pro12Ala, and C1431T) and coronary heart disease (CHD) in the PRIME (249 cases/494 controls, only men) and ADVANCE (1,076 cases/805 controls, men or women) studies. In PRIME, homozygote individuals for the minor allele of the PPARG C-689T, Pro12Ala, and C1431T SNPs tended to have a higher risk of CHD than homozygote individuals for the frequent allele (adjusted OR [95% CI] = 3.43 [0.96–12.27], P = .058, 3.41 [0.95–12.22], P = .060 and 5.10 [0.99–26.37], P = .050, resp.). No such association could be detected in ADVANCE. Haplotype distributions were similar in cases and control in both studies. A meta-analysis on the Pro12Ala SNP, based on our data and 11 other published association studies (6,898 CHD cases/11,287 controls), revealed that there was no evidence for a significant association under the dominant model (OR = 0.99 [0.92–1.07], P = .82). However, there was a borderline association under the recessive model (OR = 1.29 [0.99–1.67], P = .06) that became significant when considering men only (OR = 1.73 [1.20–2.48], P = .003). In conclusion, the PPARG Ala12Ala genotype might be associated with a higher CHD risk in men but further confirmation studies are needed.
Coping with global Information Systems

Visions of 21st century's information systems show highly specialized digital services and resources, which interact continuously and with a global reach. Today's internet of mainly human interaction evolves to a global, socio-technical information infrastructure, where humans as well as software agents acting on their behalf continuously interact to exchange data and computational resources. Such infrastructures will possibly consist of millions of service providers (SP), consumers (SC) and a multitude of possible intermediaries like brokers, workflow orchestrators and others, thus forming a global economic environment. Electronic services and resources traded on a global scope will eventually realize the vision of an open and global Internet of Services (IoS) (Schroth and Janner, 2007, pp. 36-41). For a broad adoption of this vision in a commercial context it is important to have a mechanism in place to guarantee quality of service (QoS) for each service invocation, even across enterprise boundaries. This becomes crucial when parts of mission critical workflows will be executed on external services. A very simple use case would be an engineering company purchasing basic storage and computation services from the Amazon Web Services (AWS)1 as well as specific fluid simulation services from a specialized application service provider. Since such scenarios inherently lack the applicability of centralized QoS management, guarantees must be obtained in the form of bior even multi-lateral service level agreements (SLAs) assuring service quality across individual sites (Ludwig et al., 2003, pp. 43-59). Representing qualitative guarantees placed on services, SCs can benefit from SLAs because they make nonfunctional properties of services predictable and subsequently the corresponding services dependable as needed in a business context. In order to support a comprehensive SLA-based management for such settings,
Deadlocks in distributed systems: request models and definitions

The paper addresses the problem of deadlock detection in asynchronous distributed systems for system model that covers unspecified receptions and non-FIFO channels. It presents a hierarchy of deadlock models considered till now, and then abstracts away their differences to define a single, general deadlock model. This general model is used to introduce abstract formulation of basic deadlock detection problems, and to specify distributed algorithm which uniformly addresses deadlock detection problem for various request models. Finally, in this context, termination detection problem is also considered.
Transparent Embedded Compression in Systems-on-Chip

Bandwidth to off-chip memory is a scarce resource in complex systems-on-chip for embedded media processing. We apply embedded compression for bandwidth-hungry image processing functions in order to alleviate this bandwidth bottleneck. In our solution embedded compression is implemented as part of the system-on-chip infrastructure, fully transparent for the hardware and software image processing components. Hence it can be applied without requiring changes to these components. We present the compression algorithm and demonstrate that we achieve significant bandwidth reductions (20%-40%) for image data at acceptable cost (approximately 1 mm2 in 90 nm CMOS) while preserving high image quality
Defective Autophagosome Formation in p53-Null Colorectal Cancer Reinforces Crocin-Induced Apoptosis

Crocin, a bioactive molecule of saffron, inhibited proliferation of both HCT116 wild-type and HCT116 p53−/− cell lines at a concentration of 10 mM. Flow cytometric analysis of cell cycle distribution revealed that there was an accumulation of HCT116 wild-type cells in G1 (55.9%, 56.1%) compared to the control (30.4%) after 24 and 48 h of crocin treatment, respectively. However, crocin induced only mild G2 arrest in HCT116 p53−/− after 24 h. Crocin induced inefficient autophagy in HCT116 p53−/− cells, where crocin induced the formation of LC3-II, which was combined with a decrease in the protein levels of Beclin 1 and Atg7 and no clear p62 degradation. Autophagosome formation was not detected in HCT116 p53−/− after crocin treatment predicting a nonfunctional autophagosome formation. There was a significant increase of p62 after treating the cells with Bafilomycin A1 (Baf) and crocin compared to crocin exposure alone. Annexin V staining showed that Baf-pretreatment enhanced the induction of apoptosis in HCT116 wild-type cells. Baf-exposed HCT116 p53−/− cells did not, however, show any enhancement of apoptosis induction despite an increase in the DNA damage-sensor accumulation, γH2AX indicating that crocin induced an autophagy-independent classical programmed cell death.
Local search for distributed SAT with complex local problems

A distributed constraint satisfaction problem(DisCSP) is a general framework that can formalize various application problems in Multi-Agent Systems. The authors have developed a series of algorithms for solving DisCSPs, including an iterative improvement algorithm called the distributed breakout (DB) algorithm. This algorithm, however, deals only with DisCSPs where each agent has exactly one local variable and the relevant constraints to the variable. In this paper, we propose a new algorithm called Multi-DB for solving distributed SAT (DisSAT) where each agent has multiple local variables and the relevant clauses to the variables. We conduct an experiment to compare Multi-DB with the previous algorithm called Multi-AWC on well-known (Dis)3-SAT benchmarks. The results are very impressive since Multi-DB has much less average communication and computation costs for almost all cases (at least an order of magnitude less for larger problems). We also identify a trade-off between communication and computation costs of algorithms when we vary the degree of decentralization.
International Journal of Nanomedicine Dovepress Dovepress 825 R a P I D C O M M U N I C at I O N Synthesis, Characterization, and Biological Evaluation of Poly(l-γ-glutamyl-glutamine)- Paclitaxel Nanoconjugate

The purpose of this study was to develop a novel, highly water-soluble poly(L-γ-glutamyl-glutamine)-paclitaxel nanoconjugate (PGG-PTX) that would improve the therapeutic index of paclitaxel (PTX). PGG-PTX is a modification of poly(L-glutamic acid)-paclitaxel conjugate (PGA-PTX) in which an additional glutamic acid has been added to each glutamic side chain in the polymer. PGG-PTX has higher water-solubility and faster dissolution than PGA-PTX. Unlike PGA-PTX, PGG-PTX self-assembles into nanoparticles, whose size remains in the range of 12–15 nm over the concentration range from 25 to 2,000 µg/mL in saline. Its critical micellar concentration in saline was found to be ∼25 µg/mL. The potency of PGG-PTX when tested in vitro against the human lung cancer H460 cell line was comparable to other known polymer-PTX conjugates. However, PGG-PTX possesses lower toxicity compared with PGA-PTX in mice. The maximum tolerated dose of PGG-PTX was found to be 350 mg PTX/kg, which is 2.2-fold higher than the maximum tolerated dose of 160 mg PTX/kg reported for the PGA-PTX. This result indicates that PGG-PTX was substantially less toxic in vivo than PGA-PTX.