Miracle-dz/UniFAR-FTUs huggingface dataset:
Q UANTUM S EARCH P RACTICAL ?

Some researchers suggest achieving massive speedups in computing by exploiting quantum-mechanical effects such as superposition (quantum parallelism) and entanglement.1 A quantum algorithm typically consists of applying quantum gates to quantum states, but because the input to the algorithm might be normal classical bits (or nonquantum), it affects only the selection of quantum gates. After all the gates are applied, quantum measurement is performed, producing the algorithm’s nonquantum output. Deutsch’s algorithm, for instance, solves a certain artificial problem in fewer steps than any classical (nonquantum) algorithm, and its relative speedup grows with the problem size. However, Charles Bennett and his colleagues2 have shown that quantum algorithms are unlikely to solve NP-complete problems in polynomial time, although more modest speedups remain possible. Peter Shor designed a fast (polynomial-time) quantum algorithm for number factoring—a key problem in cryptography that isn’t believed to be NP-complete. No classical polynomial-time algorithm for number factoring is known, and the security of the RSA code used on the Internet relies on this problem’s difficulty. If a large and error-tolerant quantum computer were available today, running Shor’s algorithm on it could compromise e-commerce. Lov Grover’s quantum search algorithm is also widely studied. It must compete with advanced classical search techniques in applications that use parallel processing3 or exploit problem structure, often implicitly. Despite its promise, though, it is by no means clear whether, or how soon, quantum computing methods will offer better performance in useful applications.4 Traditional complexity analysis of Grover’s algorithm doesn’t consider the complexity of processing the so-called oracle queries— that is, certain questions with yes or no answers. The query process is simply treated as a black box, thus making Grover’s algorithm appealing because it needs fewer queries than classical search. However, with sufficiently time-consuming query processing, Grover’s algorithm can become nearly as slow as a simple (exhaustive) classical search. In this article, we identify requirements for Grover’s algorithm to be useful in practice:
Phylogenetic Analyses of HBV Pre-S/S Genes in Mother-Child Pairs with Long-Term Infection by Presumed Vertical Transmission

Vertical transmission from mother to child, the main route of chronic hepatitis B virus (HBV) infection in the East Asia, is considered one of the most important predictors for the response to antiviral therapies as well as its complications such as cirrhosis and hepatocellular carcinoma. Therefore, it is critical in both etiologic and prognostic aspects to confirm whether or not chronic HBV infection is acquired vertically. This study investigated whether mother-to-child infection could be proved by the phylogenetic analyses of HBV pre-S/S genes ever since several decades have elapsed in mother-child pairs with presumed vertical transmission. The pre-S and S regions of HBVs were compared and analyzed phylogenetically in a total of 36 adults (18 mother-child pairs) with chronic HBV infection. All of the isolates of HBV were genotype C and serotype adr. The divergence between mothers and offsprings was 0 to 1.5%. Phylogenetic trees revealed that 17 of 18 pairs (94%) with presumed vertical transmission were grouped into the same cluster. Vertical transmission from mother to child could be strongly suggested even in adults with a history of several decades of HBV infection using the phylogenetic analyses of pre-S and S genes. Graphical Abstract
Impact of Cloudlets on Interactive Mobile Cloud Applications

In this paper we analyze and study the impact of cloudlets in interactive mobile cloud applications. To study the impact we propose the design of cloudlet network and service architectures. Our study focuses on file editing, video streaming and collaborative chatting which are representative enterprise application scenarios. Initial simulation results show the performance gains of using cloudlets over using clouds in terms of data transfer delay and system throughput. When not more than two cloudlet wireless hops are used to transfer data, the cloudlet-based approach outperforms the cloud-based approach for all three application scenarios. With more cloudlet wireless hops under mobility, the cloud-based approach can give a better performance for some of the data transfers even though the cloudlet-based can outperform the cloud-based approach for most of the flows. In such scenarios, we suggest that an adaptive scheme should be used. For example, a scheme making an intelligent decision on either the cloudlet network or the cloud network, whichever gives minimum delay, can be used.
BioCatalogue: a universal catalogue of web services for the life sciences

The use of Web Services to enable programmatic access to on-line bioinformatics is becoming increasingly important in the Life Sciences. However, their number, distribution and the variable quality of their documentation can make their discovery and subsequent use difficult. A Web Services registry with information on available services will help to bring together service providers and their users. The BioCatalogue (http://www.biocatalogue.org/) provides a common interface for registering, browsing and annotating Web Services to the Life Science community. Services in the BioCatalogue can be described and searched in multiple ways based upon their technical types, bioinformatics categories, user tags, service providers or data inputs and outputs. They are also subject to constant monitoring, allowing the identification of service problems and changes and the filtering-out of unavailable or unreliable resources. The system is accessible via a human-readable ‘Web 2.0’-style interface and a programmatic Web Service interface. The BioCatalogue follows a community approach in which all services can be registered, browsed and incrementally documented with annotations by any member of the scientific community.
An Automatic Bump Detecting System for LCD COG Module Using Fuzzy Reasoning

The Chip-on-Glass (COG) package, which assemblies the driver IC onto a glass substrate with Anisotropic Conductive Film (ACF), is mainly used in the Liquid Crystal Display (LCD) module. With the higher demand of display capacity, the stability of COG interconnection under fine pitch package becomes more important and difficult. Interconnection test and bump microscopic inspection are commonly used to confirm the viability of the interconnections, and are accomplished manually by engineers, which are repetitious and can merely give out the conductive particle numbers in rough. According to the existent ACF-COG interconnection resistance models, the conductivity of bump and pad can be quantitatively analyzed with the conductive particle contact area. In order to implement an automatic system for the bump microscopic inspection to count the particle number and achieve the distribution of contact areas, it is necessity to realize the bump detecting and extracting automatically. In this paper, an automatic bump detecting system using fuzzy reasoning is proposed, and can perform the bump image extraction with a high accuracy. With this system, the particle contact areas and conductive particle number can be analyzed automatically.
Effects of Finite Populations on Evolutionary Stable Strategies

A strong assumption made in evolutionary game theory (EGT) [7] is that the evolving population is infinitely large. Recent simulations by Fogel, et al, [3, 4, 5] show that finite populations produce behavior that, at best, deviate with statistical significance from the evolutionary stable strategy (ESS) predicted by EGT. They conclude that evolutionary game theory loses its predictive power with finite populations. In this paper, we revisit the question of how finite populations affect EGT dynamics. By paying particular attention to the operation of the selection mechanisms used by Fogel, et al, we are able to account for the divergence between ESS predictions (based on infinite populations) and results observed in our own finite-population simulations. We then show that Baker's SUS [1] selection method corrects the divergence to a great extent. We thus conclude that the dynamics of EGT, and particularly ESSs, can indeed apply to finite-population systems.
A Review on Diesel Soot Emission, its Effect and Control

The diesel engines are energy efficient, but their particulate (soot) emissions are responsible of severe environmental and health problems. This review provides a survey on published information regarding diesel soot emission, its adverse effects on the human health, environment, vegetations, climate, etc. The legislations to limit diesel emissions and ways to minimize soot emission are also summarized. Soot particles are suspected to the development of cancer; cardiovascular and respiratory health effects; pollution of air, water, and soil; impact agriculture productivity, soiling of buildings; reductions in visibility; and global climate change. The review covers important recent developments on technologies for control of particulate matter (PM); diesel particulate filters (DPFs), summarizing new filter and catalyst materials and DPM measurement. DPF technology is in a state of optimization and cost reduction. New DPF regeneration strategies (active, passive and plasma-assisted regenerations) as well as the new learning on the fundamentals of soot/catalyst interaction are described. Recent developments in diesel oxidation catalysts (DOC) are also summarized showing potential issues with advanced combustion strategies, important interactions on NO2 formation, and new formulations for durability. Finally, systematic compilation of the concerned newer literature on catalytic oxidation of soot in a well conceivable tabular form is given. A total of 156 references are cited. ©2010 BCREC UNDIP. All rights reserved ( Received: 2nd June 2010, Revised: 17th June 2010; Accepted: 24th June 2010 ) [How to Cite : R. Prasad, V.R. Bella. (2010). Review on Diesel Soot Emission, its Effect and Control. Bulletin of Chemical Reaction Engineering and Catalysis , 5(2): 69-86. doi:10.9767/bcrec.5. 2.794. 69-86 ] [DOI: http://dx.doi. org/10.9767/bcrec.5. 2.794. 69-86 || or local: http://ejournal.undip. ac.id/index.php/bcrec/article/view/794 ] Cited by in: ACS 1 |
The Importance of MathML to Mathematics Communication

532 NOTICES OF THE AMS VOLUME 52, NUMBER 5 C ompared to plain text, mathematical notation is hard to represent, edit, display, and process with computers. On the surface the formalism and rigor of mathematics seem as if they should lend themselves to computing. However, advances in user interfaces and electronic communication have led us to expect that information should flow seamlessly from application to application, intelligently doing the right thing for the given context. Double-click on a picture and the expectation is that it will open in a photo editor or viewer. Drag that same image into your word processor and it should be imported automatically into the document. For mathematics notation, these expectations are particularly demanding, since math is used in a wide variety of applications with very different requirements. Not only should double-clicking on an equation open it in an equation editor, but dragging it onto a computer algebra system or graphing program should be supported as well. Similarly, math should “work” with screen readers for the visually impaired, page composition engines in publishing workflows, search engines, online testing systems, and more. Devising a worldwide software infrastructure that facilitates the use of mathematics in all these contexts is a challenging problem with a long history. Recent years, however, have witnessed a significant step forward in the form of a standardized encoding for mathematical notation called Mathematical Markup Language, or MathML. MathML is an XML-based encoding for mathematics. XML (short for eXtensible Markup Language) has emerged as the dominant data format underlying the information infrastructure of the World Wide Web. XML defines a method of representing structured data types, essentially the now familiar pointy-bracket tagging of HTML. XML itself merely defines the common syntax and leaves it to specific areas of application to define appropriate data types. MathML is one such data type. XML is significant because it is becoming deeply embedded in the software systems and workflows that will shape the information landscape for years to come. Because of MathML, mathematics is a full-fledged part of that information landscape, and this bodes well for the scientific community. In this article we will look closer at MathML and examine some of the implications it has for scientific communication. We will describe some of the ways it is currently being put to use in publishing, e-learning, searching, knowledge management, and accessibility for the visually impaired and learning disabled. We will also describe areas of active research and suggest some of the possibilities that may lie ahead.
DIMENSONALITY-BASED RENDERING OF LIDAR POINT CLOUDS

Mobile Mapping Systems (MMS) are now commonly acquiring lidar scans of urban environments for an increasing number of applications such as 3D reconstruction and mapping, urban planning, urban furniture monitoring, practicability assessment for persons with reduced mobility (PRM). MMS acquisitions are usually huge enough to incur a usability bottleneck for the increasing number of non-expert user that are not trained to process and visualize these huge datasets through specific softwares. A vast majority of their current need is for a simple 2D visualization that is both legible on screen and printable on a static 2D medium, while still conveying the understanding of the 3D scene and minimizing the disturbance of the lidar acquisition geometry (such as lidar shadows). The users that motivated this research are, by law, bound to precisely georeference underground networks for which they currently have schematics with no or poor absolute georeferencing. A solution that may fit their needs is thus a 2D visualization of the MMS dataset that they could easily interpret and on which they could accurately match features with their user datasets they would like to georeference. Our main contribution is two-fold. First, we propose a 3D point cloud stylization for 2D static visualization that leverages a Principal Component Analysis (PCA)-like local geometry analysis. By skipping the usual and error-prone estimation of a ground elevation, this rendering is thus robust to non-flat areas and has no hard-to-tune parameters such as height thresholds. Second, we implemented the corresponding rendering pipeline so that it can scale up to arbitrary large datasets by leveraging the Spark framework and its Resilient Distributed Dataset (RDD) and Dataframe abstractions.
A Look at the Dynamics of the JavaScript Package Ecosystem

The node package manager (npm) serves as the frontend to a large repository of JavaScript-based software packages, which foster the development of currently huge amounts of server-side Node.js and client-side JavaScript applications. In a span of 6 years since its inception, npm has grown to become one of the largest software ecosystems, hosting more than 230, 000 packages, with hundreds of millions of package installations every week. In this paper, we examine the npm ecosystem from two complementary perspectives: 1) we look at package descriptions, the dependencies among them, and download metrics, and 2) we look at the use of npm packages in publicly available applications hosted on GitHub. In both perspectives, we consider historical data, providing us with a unique view on the evolution of the ecosystem. We present analyses that provide insights into the ecosystem’s growth and activity, into conflicting measures of package popularity, and into the adoption of package versions over time. These insights help understand the evolution of npm, design better package recommendation engines, and can help developers understand how their packages are being used.
CS-Video : Algorithms , Architectures , and Applications for Compressive Video Sensing

The design of conventional sensors is based primarily on the Shannon-Nyquist sampling theorem, which states that a signal of bandwidth W Hz is fully determined by its discrete-time samples provided the sampling rate exceeds 2W samples per second. For discrete-time signals, the Shannon-Nyquist theorem has a very simple interpretation: the number of data samples must be at least as large as the dimensionality of the signal being sampled and recovered. This important result enables signal processing in the discrete-time domain without any loss of information. However, in an increasing number of applications, the Shannon-Nyquist sampling theorem dictates an unnecessary and often prohibitively high sampling rate. (See Box 1 for a derivation of the Nyquist rate of a time-varying scene.) As a motivating example, the high resolution of the image sensor hardware in modern cameras reflects the large amount of data sensed to capture an image. A 10-megapixel camera, in effect, takes 10 million measurements of the scene. Yet, almost immediately after acquisition, redundancies in the image are exploited to compress the acquired data significantly, often at compression ratios of 100:1 for visualization and even higher for detection and classification tasks. This example suggests immense wastage in the overall design of conventional cameras. Compressive sensing (CS) (see Box 2 and [6, 14, 16, 24]) is a powerful sensing paradigm that seeks to alleviate the daunting sampling rate requirements imposed by the Shannon-Nyquist principle. CS exploits the inherent structure (or redundancy) within the acquired signal to enable sampling and reconstruction at sub-Nyquist rates. The signal structure most commonly associated with CS is that of sparsity in a transform basis. This is the same structure exploited by image
RAD51C Germline Mutations in Breast and Ovarian Cancer Cases from High-Risk Families

BRCA1 and BRCA2 are the most well-known breast cancer susceptibility genes. Additional genes involved in DNA repair have been identified as predisposing to breast cancer. One such gene, RAD51C, is essential for homologous recombination repair. Several likely pathogenic RAD51C mutations have been identified in BRCA1- and BRCA2-negative breast and ovarian cancer families. We performed complete sequencing of RAD51C in germline DNA of 286 female breast and/or ovarian cancer cases with a family history of breast and ovarian cancers, who had previously tested negative for mutations in BRCA1 and BRCA2. We screened 133 breast cancer cases, 119 ovarian cancer cases, and 34 with both breast and ovarian cancers. Fifteen DNA sequence variants were identified; including four intronic, one 5′ UTR, one promoter, three synonymous, and six non-synonymous variants. None were truncating. The in-silico SIFT and Polyphen programs were used to predict possible pathogenicity of the six non-synonomous variants based on sequence conservation. G153D and T287A were predicted to be likely pathogenic. Two additional variants, A126T and R214C alter amino acids in important domains of the protein such that they could be pathogenic. Two-hybrid screening and immunoblot analyses were performed to assess the functionality of these four non-synonomous variants in yeast. The RAD51C-G153D protein displayed no detectable interaction with either XRCC3 or RAD51B, and RAD51C-R214C displayed significantly decreased interaction with both XRCC3 and RAD51B (p<0.001). Immunoblots of RAD51C-Gal4 activation domain fusion peptides showed protein levels of RAD51C-G153D and RAD51C-R214C that were 50% and 60% of the wild-type, respectively. Based on these data, the RAD51C-G153D variant is likely to be pathogenic, while the RAD51C- R214C variant is hypomorphic of uncertain pathogenicity. These results provide further support that RAD51C is a rare breast and ovarian cancer susceptibility gene.
NFBD1/MDC1 Is Phosphorylated by PLK1 and Controls G2/M Transition through the Regulation of a TOPOIIα-Mediated Decatenation Checkpoint

Although it has been established that nuclear factor with BRCT domain 1/ mediator of the DNA damage checkpoint protein 1 (NFBD1/MDC1) is closely involved in DNA damage response, its possible contribution to the regulation of cell- cycle progression is unclear. In the present study, we have found for the first time that NFBD1 is phosphorylated by polo-like kinase 1 (PLK1) and has an important role in G2/M transition. Both NFBD1 and PLK1 are co-expressed in cellular nuclei throughout G2/M transition, and binding assays demonstrated direct interaction between NFBD1 and PLK1. Indeed, in vitro kinase reactions revealed that the PST domain of NFBD1 contains a potential amino acid sequence (845-DVTGEE-850) targeted by PLK1. Furthermore, enforced expression of GFP-PST but not GFP-PST(T847A) where threonine at 847 was substituted by alanine inhibited the phosphorylation levels of histone H3, suggesting a defect of M phase entry. Because PLK1 has been implicated in promoting the G2/M transition, we reasoned that overexpressed PST might serve as a pseudosubstrate for PLK1 and thus interfere with phosphorylation of endogenous PLK1 substrates. Interestingly, siRNA-mediated knockdown of NFBD1 resulted in early M phase entry and accelerated M phase progression, raising the possibility that NFBD1 is a PLK1 substrate for regulating the G2/M transition. Moreover, the constitutive active form of PLK1(T210D) overcame the ICRF-193-induced decatenation checkpoint and inhibited the interaction between NFBD1 and topoisomerase IIα, but kinase-deficient PLK1 did not. Based on these observations, we propose that PLK1-mediated phosphorylation of NFBD1 is involved in the regulation of G2/M transition by recovering a decatenation checkpoint.
Recommending Web Service Based on User Relationships and Preferences

With the popularity of social network and the increasing number of Web Services, making individual service recommendation has been a hot research spot nowadays. In this paper, we present a service recommendation algorithm named as URPC-Rec (User Relationships & Preferences Clustering and Recommendation), which first clusters users based on their history behaviors such as the services they ever invoked, and then makes personalized recommendations for users considering both the clustering results and user basic information and relationships, such as gender, age, occupation, preference tags, etc. The case study indicates that URPC-Rec can effectively reduce the dimensionality of sparse matrix, and partially solve the cold-start problem of recommendation systems. The comprehensive experiment shows that URPC-Rec algorithm with user relationships and references has better recommending result than the one without user information and the collaborative filtering approach.
Food Security : What is it all about ?

The term ‘food security’ has appeared as a buzzword in a variety of contexts in recent years. In particular high food prices and concern over the potential effects of climate change have been catalysts for discussion about food security as wealthy countries face the implications of challenges to food supply. In fact many of the issues associated with food security have been a long term challenge, particularly for developing countries.