Miracle-dz/UniFAR-FTUs huggingface dataset:
Power-aware, bandwidth-aware and video-quality-aware cooperative routing algorithm for 3D video transmission in wireless networks

3D video transport methods have been the most intriguing and interesting research topic due to the recent popular 3D movie and 3DTV. Basically, 3D video stream is different from the 2D video stream that requires additional video streams to create 3D viewing experience. These additional video streams require significant transmission bandwidth so that it requires large bandwidth requirement for the whole 3D video stream. Due to the limited frequency spectrum in wireless networks, it is difficult to transmit the full 3D video stream in one wireless channel. Besides limited frequency spectrum, power efficient transmission is also another important goal in wireless networks. How to successfully meeting the bandwidth demands and in the same time to minimize the total transmission power is an interesting and challenging problem. One possible way is to bifurcate the 3D video stream into multiple 2D video streams and transmit them in separate routing path and then combined at the destination node. Via this cooperative routing strategy, there would be smaller bandwidth requirement at each stream so that it is possible to reduce the transmission radius of the transmitter node and in the same time to have good signal quality to decode the received video. This problem is a challenging cross-layer design problem to simultaneously consider the video quality in the application layer, cooperative routing in the network layer and the SNR aware power control in the physical layer. In this paper, by leveraging on of the multi-view nature of the 3D video, I propose a novel power-aware, bandwidth aware and video quality aware cooperative scheme, named IBAIP algorithm, to bifurcate and route the 3D video stream to the destination node. According to the computational experiments, the proposed IBAIP algorithm outperforms other heuristics under all tested cases.
Improved Fuzzy Load Models by Clustering Techniques in Distribution Network Control

In operation and planning of the power systems, the analysis of the consumption trends depends on the evolution of economic activities and competition among several sources of energy, which affect forecasts. The loads estimation represents the basis of the system state estimation and influences various aspects of power system planning such as: transformer and conductor sizing, capacitor bank placement and so on. The main difficulties in modeling of the nodal loads result from the random nature of loads, the deficiency of measured data and the fragmentary and uncertain character of information on loads and customers. Thus, a modern method for expressing the uncertainty in load models is fuzzy technique. A fuzzy set is a set containing elements that have varying degrees of membership in the set. There are different ways to derive membership functions. Subjective judgment, intuition and expert knowledge are commonly used in constructing membership function. Because in many situations the choices of the membership functions are subjective, in the paper the clustering techniques are proposed for the improved of the defining of membership functions corresponding to the load profiles and customers consumption categories. Results obtained demonstrate the ability of the fuzzy load models to overcome difficult aspects encountered in process control and operation problems.
Analysis of synonymous codon usage in the outer membrane efflux protein gene of Riemerella anatipestifer

The aim was to identify the codon usage bias between the newly identified Riemerella Anatipestifer(RA)outer membrane efflux protein gene(GenBank accession NO. CP003388) and outer membrane efflux protein genes of 17 other reference flavobacteriaceae with bioinformatics software. A comparative analysis of the codon usage bias of the 18 flavobacteriaceae was performed by using the CodonW1.4. 2 and CUSP program of EMBOSS. The results showed the differences of the synonymous codon usage bias in the 18 flavobacteriaceae indicated by effective number of codons(Enc), and the value of G+C content at the 3 rd codon position. The Enc-plot revealed that these outer membrane efflux protein genes of flavobacteriaceae are subject to GC compositional constraints. In addition, comparisons of the codon preferences in the outer membrane efflux protein gene of RA with those of Escherichia coli, yeast and humans revealed that there are 29 codons showing distinct usage differences between RA outer membrane efflux protein gene and E.coli and 23 between RA outer membrane efflux protein gene and humans, but only 21 between RA outer membrane efflux protein gene and yeast. Therefore, the E.coli system may be more suitable for the expression of the RA outer membrane efflux protein gene. These results may improve the expression of the gene and our understanding of the functional studies of RA.
Conflicts in Environmental Regulation and the Internationalisation of the State: Contested Terrains

Introduction: Genetic Resources and the Internationalisation of the State 1. The Regulation of Nature in Post-Fordism 2. On the Value of Nature: The Convention on Biological Diversity and the Commercialisation of Genetic Resources 3. Limits to Commercialisation? : Genetic Resources in Agriculture and the Conflict over a Multilateral Exchange System 4. Politicising Intellectual Property Rights: The Conflicts around the TRIPS Agreement and the World Intellectual Property Organisation 5. The Relevance of the National and the Local: The Disputes over a Valorization Paradigm in Mexico and Chiapas 6. Contested Terrains: Towards a Neo-Poulantzian Approach to International Political Economy
Nucleation mechanisms and the elimination of misfit dislocations at mismatched interfaces by reduction in growth area

To investigate the effect of growth area on interface dislocation density in strained‐layer epitaxy, we have fabricated 2‐μm‐high mesas of varying lateral dimensions and geometry in (001) GaAs substrates with dislocation densities of 1.5×105, 104, and 102 cm−2. 3500‐, 7000‐, and 8250‐A‐thick In0.05Ga0. 95As layers, corresponding to 5, 10, and 11 times the experimental critical layer thickness as measured for large‐area samples, were then deposited by molecular‐beam epitaxy. For the 3500‐A layers, the linear interface dislocation density, defined as the inverse of the average dislocation spacing, was reduced from greater than 5000 to less than 800 cm−1 for mesas as large as 100 μm. A pronounced difference in the linear interface dislocation densities along the two interface 〈110〉 directions indicates that α dislocations nucleate about twice as much as β dislocations. For samples grown on the highest dislocation density substrates, the linear interface‐dislocation density was found to vary linearly with mesa.
Policy Reforms and Evolution of Market Structure in an Emerging Economy: The Case of India

Policy reforms have facilitated entry of quite a few transnational corporations (TNC) into Indian industries. This has important implications for the evolution of competitive industrial structure. This article focuses on the issue of the response mechanism of local firms to competition from new entrant TNCs and the possible strategies of TNCs in penetrating the Indian market. It develops a conceptual framework by incorporating elements of intangible assets theory and new institutional economics into a simple sequential entry oligopoly model. This yields interesting insights into qualitative behaviour of firms in the post-reforms period. A few hypotheses drawn from the conceptual framework are empirically tested on the basis of firm level panel data drawn from a set of Indian industries.
Training of multiple classifier systems utilizing partially labeled sequential data sets

Making use of unlabeled data samples in a classification or training of a classifier is a desirable aim for many real world applications in pattern recognition. In this study, a multiple classifier system is utilized to investigate this matter. Further, cluster analysis is used in order to group the available data while neglecting the actual labels. Then, by implementing an information fusion architecture based on these clusters, a classification architecture is constructed. This kind of an architecture is investigated by means of a facial expression data collection with focusing on one-against-one class decisions to produce locally "unlabeled", i.e. not assigned to one of the considered classes, data.
ECR-MAPK Regulation in Liver Early Development

Early growth is connected to a key link between embryonic development and aging. In this paper, liver gene expression profiles were assayed at postnatal day 22 and week 16 of age. Meanwhile another independent animal experiment and cell culture were carried out for validation. Significance analysis of microarrays, qPCR verification, drug induction/inhibition assays, and metabonomics indicated that alpha-2u globulin (extracellular region)-socs2 (-SH2-containing signals/receptor tyrosine kinases)-ppp2r2a/pik3c3 (MAPK signaling)-hsd3b5/cav2 (metabolism/organization) plays a vital role in early development. Taken together, early development of male rats is ECR and MAPK-mediated coordination of cancer-like growth and negative regulations. Our data represent the first comprehensive description of early individual development, which could be a valuable basis for understanding the functioning of the gene interaction network of infant development.
Shared research dataset to support development of keystroke authentication

Keystroke authentication can help significantly improve computer security by hardening passwords or offering active, continuous authentication. Over the years, many keystroke authentication algorithms have been reported to produce promising results. However, these results are tested on proprietary datasets with varying numbers of subjects and amounts of text, making it difficult to compare and improve the state of art. We describe a new dataset that we have developed with the goal to serve as a shared common testbed to enable future improvements. The new dataset includes keystroke data for short pass-phrases, fixed text (transcription of long proses), and free text. It also includes video of a subject's facial expression and hand movement during the data collection sessions, allowing for a deeper understanding of why an algorithm works the way it does, for example, by finding out whether a subject is a touchtypist or not. As a baseline for benchmarking, we also include the results of replicating two existing algorithms using the new dataset.
Incorporating Better Register Allocation into Jikes

In dynamically compiled code, it is important not only that the compiler produce fast code, but also that the compiler itself costs little overhead to the runtime application. These two competing goals motivate the importance of accurate cost-benefit analysis for any optimizations performed in a dynamic compilation system. The Jikes RVM, which performs Just-In-Time (JIT) compilation of Java bytecodes, is an example of such a dynamic compiler. One of the most important components of a JIT compiler is register allocation because memory accesses are becoming increasingly expensive relative to register accesses. Jikes has opted to use exclusively a linear scan register allocator in its optimizing compiler because the linear scan algorithm is fast and provides performance nearly as good as more complicated register allocation algorithms. This paper seeks to improve the runtime performance of applications run by the Jikes RVM by incorporating a more exhaustive register allocation scheme for use on code for which the benefit would be large enough to justify the extra compilation effort. This was accomplished with partial success by adding an additional optimization level to the Jikes RVM and calibrating the necessary cost-benefit parameters in the configuration files. Our results suggest that the modifications we made improve the performance of the Jikes RVM on computationally intensive code without sacrificing much performance on smaller jobs.
The effect of variable wake up time on the utilization of sleep modes in femtocell mobile access networks

Femtocells are considered as an enabler for low power, high bit rate future mobile access networks. In this study, we look at them as a technology to cover an area with a high bit rate connectivity. From the evaluation it is clear that sleep modes are imperative to maximise the energy efficiency of the mobile access network. We evaluate the power reduction and wake up time of different sleep modes and apply them to the model in order to evaluate the influence of the power consumption of the mobile access network. We demonstrate that fast wake up times and low power sleep modes are essential in order to make femtocells a viable technology for mobile access networks.
Title : CIVL : The Concurrency Intermediate Verification Language

Recent years have witnessed an explosion in the number of programming languages and language extensions dealing with concurrency. Examples include message-passing libraries (MPI-3), multithreading and GPU language extensions such as OpenMP, Pthreads, OpenCL, and CUDA, and entirely new languages such as Chapel. This multitude creates a serious challenge for developers of software verification tools: it takes enormous e↵ort to develop such tools, but each development e↵ort typically targets one small part of the concurrency landscape, with little sharing of techniques and code between e↵orts. To address this problem, we present CIVL: a Concurrency Intermediate Verification Language. CIVL provides a concurrency model su ciently flexible to represent programs in a wide variety of parallel languages, including those listed above. We have realized CIVL as a dialect of C with new primitives for concurrency and others to facilitate specification and verification. We have also developed a tool that combines model checking and symbolic execution to verify or refute a number of properties of CIVL programs, such as absence of deadlock and assertion violations, and functional equivalence. 1 The CIVL Framework The CIVL framework encompasses (1) the programming language CIVL-C, a dialect of C with additional primitives supporting concurrency, specification, and modeling; (2) verification and analysis tools, including a symbolic executionbased model checker for checking various properties of, or finding defects in, CIVL-C programs; and (3) tools that translate from many commonly used languages/APIs to CIVL-C. Our goal is for CIVL-C to be an e↵ective intermediate representation for verification. A C program using MPI [16], CUDA [11], OpenMP [7], OpenCL [21], or another API (or even some combination of APIs), will be automatically translated into CIVL-C and then verified. The advantages of such a framework are
Valuing Continuous Barrier Options on a Lattice solution for a Stochastic Dirichlet Problem

The stochastic Dirichlet problem computes values within a domain of certain functions with known values at the boundary of the domain. When applied to valuing barrier options, solutions are expressed as ex- pected discounted payos achieved at hitting times to the boundary of the domain. We construct a lattice solution to the stochastic Dirichlet problem. In between time steps on the lattice, the lattice process is assumed to have the bridge distribution of the underlying stochastic process. We apply the Dirichlet lattice to valuing barrier options. A plain simple scheme converges very slowly. We …nd that the Dirichlet lattice is considerably faster than a plain lattice scheme, converging to 2 decimal places in only several hundred time steps. The Dirichlet lattice can directly value knock-in barrier options, in- cluding knock-in Bermudan barrier options which cannot normally be priced by a plain lattice method. It values Bermudan barrier options and barrier options with non-linear barriers equally quickly. We present results demonstrating the superiority of the Dirichlet lattice over both a plain lattice method and a conditional Monte Carlo method.
Depth estimation based on defocus blur using a single image taken by a tilted lens optics camera

In various fields such as measurement of the distance between cars and three-dimensional recognition in robotics, the depth needs to be estimated over a wide range. For this purpose, we propose a depth estimation method that uses a ground-in-focus image taken by a tilted lens optics camera. Our proposed method detects edges by local scale control. It then measures the blur amount at each edge by fitting a Gaussian blur model to them. If there are other neighboring edges, we use the linear sum of the Gaussians to increase the fitting accuracy with the blur model. We can then obtain a depth map based on the blur amount and y-coordinate of the pixel. Our experimental results showed the effectiveness of our proposed method.
Homology Annotations via Matrix Reduction

In this work, we propose an alternative algorithm for annotating simplices of a simplicial complex K with sub-bases of a basis B of its p-dimensional homology group H1(K). Such annotations, summed over p-simplices in any p-cycle z, provide an expression of z in B. This allows us to answer queries of null homology and independence of p-cycles efficiently and improve the running time of the greedy algorithm to compute a shortest basis of H1(K). The best known algorithm for the shortest basis problem that does not use annotations has a time complexity of O(n), where n is the size of the 2-skeleton of K. We improve it to O(n + ng), where g is the rank of H1(K). Annotating simplices with a homology basis has been considered before [1]. The existing approach can preprocess the simplicial complex and assign annotations in sub-cubic time. However, this involves computing the LSP-decomposition of the boundary matrix, which can be computationally cumbersome. We present a simple and implementation-friendly O(n) approach that fits nicely to the family of matrix reduction algorithms such as the persistence algorithm and the classic Smith normal form reduction. Our analysis also reveals interesting connections to the persistence algorithm. Namely, our matrix reduction method computes pairing between simplices under homomorphisms between homology groups that are not necessarily induced by inclusions between the subcomplexes of the filtration of K.
Hematopoietic Stem/Progenitor Cell Sources to Generate Reticulocytes for Plasmodium vivax Culture

The predilection of Plasmodium vivax (P. vivax) for reticulocytes is a major obstacle for its establishment in a long-term culture system, as this requires a continuous supply of large quantities of reticulocytes, representing only 1–2% of circulating red blood cells. We here compared the production of reticulocytes using an established in vitro culture system from three different sources of hematopoietic stem/progenitor cells (HSPC), i.e. umbilical cord blood (UCB), bone marrow (BM) and adult peripheral blood (PB). Compared to CD34+-enriched populations of PB and BM, CD34+-enriched populations of UCB produced the highest amount of reticulocytes that could be invaded by P. vivax. In addition, when CD34+-enriched cells were first expanded, a further extensive increase in reticulocytes was seen for UCB, to a lesser degree BM but not PB. As invasion by P. vivax was significantly better in reticulocytes generated in vitro, we also suggest that P. vivax may have a preference for invading immature reticulocytes, which should be confirmed in future studies.
International Journal of Nanomedicine Dovepress Doxorubicin-loaded Phosphatidylethanolamine- Conjugated Nanoliposomes: in Vitro Characterization and Their Accumulation in Liver, Kidneys, and Lungs in Rats

Introduction: Phosphatidylethanolamine (PE)-conjugated nanoliposomes were developed, characterized, and investigated for their accumulation in liver, kidneys, and lungs in rats. Methods: Drug-excipient interaction was studied using Fourier transform infrared spectroscopy (FTIR), differential scanning calorimetry (DSC), surface morphology by field emission scanning electron microscopy, elemental analysis by energy dispersive X-ray (EDX) analysis, zeta potential and size distribution using a Zetasizer and particle size analyzer, and in vitro drug release by dialysis membrane. In vivo accumulation of liposomes in tissues was also studied. Results: No chemical reaction was observed between drug and excipients. EDX study confirmed PE-conjugation in liposomes. Doxorubicin-loaded liposomes (DOX-L) and PE-conjugated doxorubicin-loaded liposomes (DOX-PEL) were of smooth surface and homogenously distributed in nanosize range (32–37 nm) with a negative surface charge. Loading efficiencies were 49.25% ± 1.05% and 52.98% ± 3.22% respectively, for DOX-L and DOX-PEL. In vitro drug release study showed 69.91% ± 1.05% and 77.07% ± 1.02% doxorubicin released, from DOX-L and DOX-PEL, respectively, in nine hours. Fluorescence microscopic study showed that liposomes were well distributed in liver, lungs, and kidneys. Conclusion: Data suggests that PE-conjugated nanoliposomes released the drug in a sustained manner and were capable of distributing them in various organs. This may be used for cell/ tissue targeting, attaching specific antibodies to PE.
An investigation on DNN-derived bottleneck features for GMM-HMM based robust speech recognition

In recent years, deep neural network(DNN) has achieved great success when used as acoustic model in speech recognition. An important application of DNN is to derive bottleneck feature. In this paper, firstly we investigate the robustness of bottleneck features generated by three types of DNN structures on the Aurora 4 task without any explicit noise compensation. Secondly, we propose the node-pruning method to reconstruct DNN which generates a new type of deep bottleneck feature. Our experiments show that bottleneck features generated from the node-pruned DNN achieve a promising reduction in word error rate(WER) when compared to the other bottleneck features produced by the conventional types of DNN structures. In addition, the new approach using the node-pruned DNN structure can automatically obtain the compact layer which generates the bottleneck feature.
PSWARM : A SOLVER FOR LINEARLY CONSTRAINED GLOBAL DERIVATIVE-FREE OPTIMIZATION

PSwarm was developed originally for the global optimization of functions without derivatives and where the variables are within upper and lower bounds. The underlying algorithm used is a pattern search method, more specifically a coordinate search method, which guarantees convergence to stationary points from arbitrary starting points. In the (optional) search step of coordinate search, the algorithm incorporated a particle swarm scheme for dissemination and thus it can globally explore the possible nonconvexity of the objective function. Our extensive numerical experiments showed that the resulting algorithm is highly competitive with other global optimization methods also based on function values. PSwarm is extended is this paper to handle general linear constraints. The poll step incorporates now positive generators for the tangent cone of the approximated active constraints, including a provision for the degenerate case. The search step has also been adapted accordingly. In particular, the initial population for particle swarm used in the search step is computed by first inscribing an ellipsoid of maximum volume to the feasible set. We have again compared PSwarm to other solvers (including some designed for global optimization) and the results confirm its competitiveness in terms of efficiency and robustness.