Miracle-dz/UniFAR-FTUs huggingface dataset:
Haze in Singapore – source attribution of biomass burning PM10 from Southeast Asia

Abstract. This paper presents a study of haze in Singapore caused by biomass burning in Southeast Asia over the 6-year period from 2010 to 2015, using the Numerical Atmospheric-dispersion Modelling Environment (NAME), which is a Lagrangian dispersion model. The major contributing source regions to the haze are identified using forwards and backwards model simulations of particulate matter. The coincidence of relatively strong southeast monsoonal winds with increased biomass burning activities in the Maritime Continent create the main Singapore haze season from August to October (ASO), which brings particulate matter from varying source regions to Singapore. Five regions are identified as the dominating sources of pollution during recent haze seasons: Riau, Peninsular Malaysia, South Sumatra, and Central and West Kalimantan. In contrast, off-season haze episodes in Singapore are characterised by unusual weather conditions, ideal for biomass burning, and contributions dominated by a single source region (different for each event). The two most recent off-season haze events in mid-2013 and early 2014 have different source regions, which differ from the major contributing source regions for the haze season. These results challenge the current popular assumption that haze in Singapore is dominated by emissions/burning from only Indonesia. For example, it is shown that Peninsular Malaysia is a large source for the Maritime Continent off-season biomass burning impact on Singapore. The results demonstrate that haze in Singapore varies across year, season, and location and is influenced by local and regional weather, climate, and regional burning. Differences in haze concentrations and variation in the relative contributions from the various source regions are seen between monitoring stations across Singapore, on a seasonal as well as on an inter-annual timescale. This study shows that even across small scales, such as in Singapore, variation in local meteorology can impact concentrations of particulate matter significantly, and it emphasises the importance of the scale of modelling both spatially and temporally.
Balanced Link Mapping in Multicast Service Overlay Networks Design

In order to address some deployment problems of IP multicast, the notion of Multicast Service Overlay Network (MSON) is proposed. How to construct MSON satisfying user’s demand efficiently under the situation of limited resources is a hot issue. In this paper we analyze a mathematics model of MSON construction. Under the objective of finding a virtual topology on top of physical network fulfilling all restrictions, and minimizing the cost of construction while keeping residual physical network the most balanced, an Integer Linear Programming model of the construction problem is depicted. In order to solve the problem efficiently, we propose a heuristics algorithm named BLMH. The efficiency of BLMH is evaluated by emulation experiment according to congestion link number under several scenarios.
Research on Item Model in Content-Based Filtering Recommender Systems

With the popularization of the Internet and the development of E-commerce, the information on the Networks has increased greatly and the E-Commerce system’s structure becomes more complicated when it provides more and more choices for users. People all have experienced the feeling of being overwhelmed by the number of new books, articles, and movies coming out each year. Many researchers pay more attention on building a proper tool which can help users obtain personalized resources. Personalized recommender systems are one such software tool in which information retrieve, information filtering, and content-based filtering techniques are used to help users obtain recommendations for unseen items based on their preferences. In this paper, described item models in content-based filtering recommender systems in order to alleviate the information overload issues. The paper presented three item models as following: vector space model representation, probability model representation and improved probabilistic model representation. These item models have their own advantages and disadvantages, and can choose according to specific circumstances.
A Novel Web Service QoS Model based on Xml Query Optimization

With the proliferation of Web services, quality of service (QoS) becomes a key factor to differentiate the Web services and their providers. The definition of QoS model is nonuniformity, different developers define various QoS model by their style. Such problem bring out the difficult for service reuse.In this paper, we present a Web services QoS model which takes non-functional properties into account in various aspects. In this model, Web services qualities are classified into muti-dimension class. Web service QoS metrics are evaluated dynamically according to the service contextand the overall QoS is evaluated from multiple metrics according to a configurable fuzzy synthetic evaluation system.At last, the analysis of a case and the quality testing result shows that the QoS model achieves the result that we expect in great measure.
Specification and validation of information processing systems by process encapsulation and symbolic execution

A process notation based on a functional partitioning of a new system is proposed as a high-level codesign model for specification, evaluation, and implementation purposes. A well-defined computational model allows the synchronization and activation of concurrent processes. The design environment includes the refinement steps from scheduling with dynamic processes via simplified scheduling/execution methods to the complete implementation. The relationship between specified behavioral classes and implemented states in the final core programs is the key issue in this development flow. Time uncritical parts are implemented in a heterogeneous environment communicating via a standard communication protocol. On the other hand, time critical processes and process connections can be implemented in C/sup ++/ using SystemC, thus forming core programs encapsulated in a shell to fit the introduced and implemented activation rules. An example from the world of digital image processing systems illustrates the approach.
Fast partitioning method for PLA-based architectures

Describes a method for automatic partitioning of a given multioutput function into the smallest number of subfunctions such that each subfunction can fit into a fixed size PLA or functional block of a given field programmable gate array (FPGA) chip. The proposed method is fast, efficient and produces almost optimum partitions for the examples which have been tried. The partitioning procedure is in production use as part of an automated design system at Plus Logic. <<ETX>>
Use of superpages and subblocking in the address translation hierarchy

Most computers that support virtual memory translate virtual addresses to physical addresses using a translation lookaside buffer (TLB) and a page table. Time spent in TLB miss handling--number of TLB misses times average TLB miss penalty--is increasing due to workload, architectural, and technological trends. This thesis studies TLB architectures that reduce the number of TLB misses by increasing TLB reach--the maximum address space mapped by a TLB--and page table designs that decrease TLB miss penalty or support new TLB architectures without increasing TLB miss penalty. First, this thesis evaluates two TLB architectures in commercial use--superpages and complete subblocking. This thesis studies the benefits of superpages and the issues involved in modifying operating systems and page tables to support superpages. Complete subblocking allows processor designers to use larger chip areas to build large TLBs within cycle time constraints. Simulation results show that for comparable chip area, complete-subblock TLBs have faster access times and incur fewer TLB misses than single-page-size TLBs without requiring operating system changes. Second, this thesis proposes a new TLB architecture, partial subblocking, that combines the best features of complete subblocking and superpages. Simulation results show that superpage and subblock TLBs, for comparable chip area, incur fewer TLB misses than single-page-size TLBs. Further, partial-subblock TLBs require simpler operating systems and incur fewer misses than superpage TLBs. Third, superpage and partial-subblock TLBs are ineffective without operating system support. This thesis identifies the policies and mechanisms required to support these TLBs. In particular, this thesis proposes a physical memory allocation algorithm, page reservation, that makes partial-subblock TLBs effective or eliminates page copying in superpage creation. Fourth, this thesis suggests modifications to conventional page tables to support superpage and subblock TLBs and proposes a new page table structure, clustered page table, that augments hashed page tables with subblocking. Simulation results show that clustered page tables are smaller and have a faster access time than conventional page tables when using single-page-size TLBs. A clustered page table improves on these advantages when storing superpage and subblock PTEs.
Orthogonal re-spread for uplink WCDMA beamforming

This paper presents a new extraction method for the spatial correlation matrix of interference and noise only based on orthogonal re-spreading. The method uses one of the remaining orthogonal variable spreading factor (OVSF) code that is orthogonal to all traffic and control channels to spread energy form the desired user while attempting to maintain the same level of co-channel interference. De-spreading with the assigned OVSF codes that is performed in parallel provides the usual noisy correlation matrix. With those two matrices at hand optimal beamforming using maximal signal-to-interference ratio (MSIR) criterion is readily performed. Although the matrix extracted by the orthogonal re-spread is not a statistically consistent estimate, remarkable potentials in practical situations are demonstrated.
Distributed medium-access-control protocol for an optical-packet-switched ring network supporting variable-length packets

We propose a distributed medium-access control (MAC) protocol for an asynchronous, optical-packet-switch architecture, suitable for an efficient, scalable, and flexible interconnected ring network. We compare the complexity of our proposal with that of existing techniques to support variable-length packets and with node architectures that enable spatial wavelength reuse. Simulations quantify the throughput increase enabled by the MAC protocol and show that moderate hardware resources are sufficient to offer low-packet-loss rates with low maximum delay and delay jitter. Finally, we show that the network efficiently supports bursty traffic.
An attentive multi-camera system

Intelligent multi-camera systems that integrate computer vision algorithms are not error free, and thus both false positive and negative detections need to be revised by a specialized human operator. Traditional multi-camera systems usually include a control center with a wall of monitors displaying videos from each camera of the network. Nevertheless, as the number of cameras increases, switching from a camera to another becomes hard for a human operator. In this work we propose a new method that dynamically selects and displays the content of a video camera from all the available contents in the multi-camera system. The proposed method is based on a computational model of human visual attention that integrates top-down and bottom-up cues. We believe that this is the first work that tries to use a model of human visual attention for the dynamic selection of the camera view of a multi-camera system. The proposed method has been experimented in a given scenario and has demonstrated its effectiveness with respect to the other methods and manually generated ground-truth. The effectiveness has been evaluated in terms of number of correct best-views generated by the method with respect to the camera views manually generated by a human operator.
Simulation of realistic soils for 3-D computational models

This paper investigates the problem of simulation of realistic soils for electromagnetic 3-D computational models. The major difficulty is to take into account the heterogeneous nature of real-life soils, which is an aggregate of random and regular structures, due to environmental (climatic conditions, etc.) or human (soil tillage) processes. The developed methodology uses 3-D measurements of pertinent soil parameters, able to describe the heterogeneity of real-life soils. It can be broken down into four main tasks: (a) 3-D measurement of soil parameter(s); (b) characterization of the 3-D spatial distribution of soil parameter(s); (c) simulation of 3-D volumes with the same spatial distribution; and (d) simulation of 3-D soil permittivity maps using electromagnetic mixing model. This methodology is illustrated with the example of soil density measurement, which is evaluated with the use of a motor-driven penetrometer.
Line-line short circuit of synchronous machine: illustration of computer-aided machine analysis

The sudden unbalanced short circuit of the 3-phase synchronous machine constitutes one of the most difficult problems of conventional machine analysis, whether traditional or unified. It is, however, readily susceptible to numerical integration using digital computers. The general approach, which is believed to have a wide application, is illustrated by the simple case of the 2-winding single-phase machine, and is then extended to the practical problem of the salient-pole machine with damper windings. Predicted and test results are found to be in good agreement.
Web Data Extraction with Hierarchical Clustering and Rich Features

A novel approach is proposed to automatically extract data records from detail pages using hierarchical clustering techniques. The approach uses the information of the listing pages to identify the content blocks in detail pages, which narrows the scopes of Web data extraction. Meanwhile, it also makes full use of the structure and content features to cluster content feature vectors. Finally, it aligns data elements of multiple details pages to extract the data records. Experiment results on test beds of real web pages show that the approach can achieve high extraction accuracy and outperforms the existing techniques substantially.
Phylogeny of Bacteria from Steelmaking Wastes and Their Acidic Enrichment Cultures

Currently, millions of tons of steel are produced worldwide. This has become a serious economic and environmental challenge because the ores used for steel production are nonrenewable resources and the production generates huge amount of waste. In this study, we identified and investigated the ability of bacteria from steelmaking waste with low and high zinc concentration to promote leaching of zinc, when enriched by acidic (pH 2) culture conditions. The bioleaching assays indicated removal of Zn, as in chemical leaching. Bacterial communities from crude and enrichment culture wastes were characterized by the 16S rRNA gene. Phylogenetic analysis of the generated clone libraries revealed predominance of Proteobacteria and Firmicutes. The Actino- bacteria, Bacteroidetes, Cyanobacteria, and Deinococcus-Thermus phyla were also encountered. The clones were most closely related to cultivable heterotrophic bacteria. Different genera were identified including iron redox cycling and leaching bacteria such as Chromobacterium, Aeromonas, Escherichia, Bacillus, and Ochrobactrum. These data add significant new information on bacteria which survive in extremely acidic conditions. They are distantly related to typical acidophiles responsible for the leaching process, which makes them good candidates for future studies on metal bioleaching.
Interpretation as Abduction

An approach to abductive inference developed in the TACITUS project has resulted in a dramatic simplification of how the problem of interpreting texts is conceptualized. Its use in solving the local pragmatics problems of reference, compound nominals, syntactic ambiguity, and metonymy is described and illustrated. It also suggests an elegant and thorough integration of syntax, semantics, and pragmatics.
Framework for fair objective performance evaluation of single-image super-resolution algorithms

Single-image super-resolution (SISR) is a technology to reconstruct a high-resolution image from a single low-resolution input image. The performance of SISR algorithms is usually evaluated by applying full-reference objective image quality assessment metrics. First, it is argued that the result of objective quality evaluation may become inconsistent with subjective quality assessment, depending on how the input low-resolution image is generated and how up-scaling during SISR is conducted. Since such inconsistency is due to subpixel-level misalignment between the original and output images, a framework is then proposed that compensates any spatial displacement between the two images and enables fair SISR performance evaluation using objective quality metrics.
A study of the intension of using computer as a strategic resource of web searching

The purpose of this study was to explore the awareness of Technology strategic usefulness of computers as a searching tool. The argument of this study was that people using technology because of knowing its usefulness. If people recognized usefulness of technology, the strategic usefulness would be enhanced aware via the learning of technology strategic importance. A nonequivalent pretest-posttest control group design was applied on senior high school students in the study. The sampled subjects were one hundred and eleven students. Fifty-five of them were treated as the experimental group, and the other fifty-six were treated as the control-group. Members of experimental group were offered classes based on original uses of web-search and teaching of "Technology Strategic Usefulness, TSU" material. On the other hand, the member-students of control group were offered with ordinary uses of Web-search. An evaluation tool was designed for learning achievement of logic. For both technology usefulness and technology strategic usefulness, a scale of usefulness was also layout. After the experimental treatment, students took both Web-search Logic Achievement Test and Technology strategic usefulness of Web-search Scale. Statistical analysis was applied to reveal the experimental results. The findings of this research are:(1) the relationship between usefulness and strategic importance was significant. (2) Strategic importance is an antecedent of technology strategic usefulness.
Past and State-of-the-Art SLAM Technologies

: This paper surveys past and state-of-the-art SLAM technologies. The standard methods for solving the SLAM problem are the Kalman filter, particle filter, graph, and bundle adjustment-based methods. Kalman filters such as EKF (Extended Kalman Filter) and UKF (Unscented Kalman Filter) have provided successful results for estimating the state of nonlinear systems and integrating various sensor information. However, traditional EKF-based methods suffer from the increase of computation burden as the number of features increases. To cope with this problem, particle filter-based SLAM approaches such as FastSLAM have been widely used. While particle filter-based methods can deal with a large number of features, the computation time still increases as the map grows. Graph-based SLAM methods have recently received considerable attention, and they can provide successful real-time SLAM results in large urban environments.
Stabilisers of eigenvectors of finite reflection groups

Let $x$ be an eigenvector for an element of a finite irreducible reflection group $W$. Let $W_x$ denote the subgroup of $W$ which stabilises $x$. We provide an upper bound for the number of roots in the root system of $W_x$ . This generalises a result of Kostant, who showed that every eigenvector with eigenvalue a primitive $h^\mathrm{th}$ root of unity is regular, where $h$ is the Coxeter number of $W$. We also give a Lie-theoretic interpretation of our result in the study of semisimple conjugacy classes over Laurent series. In a forthcoming paper, we use this result to establish a geometric analogue of a conjecture of Gross and Reeder.
Boolean Algebra and Its Applications

Inevitably, reading is one of the requirements to be undergone. To improve the performance and quality, someone needs to have something new every day. It will suggest you to have more inspirations, then. However, the needs of inspirations will make you searching for some sources. Even from the other people experience, internet, and many books. Books and internet are the recommended media to help you improving your quality and performance.
Distributed Trust Evaluation in Ad-Hoc Networks

Abstract : An important concept in network security is trust, interpreted as a relation among entities that participate in various protocols. Trust relations are based on evidence related to the previous interactions of entities within a protocol. In this work, we are focusing on the evaluation process of trust evidence in Ad Hoc Networks. Because of the dynamic nature of Ad Hoc Networks, trust evidence may be uncertain and incomplete. Also, no pre-established infrastructure can be assumed. The process is formulated as a path problem on a directed graph, where nodes represent entities, and edges represent trust relations. We show that two nodes can establish an indirect trust relation without previous direct interaction. The results are robust in the presence of attackers. We give intuitive requirements for any trust evaluation algorithm. The performance of the scheme is evaluated on various topologies.
Perbandingan Metode SYBR Green dan Hydrolysis Probe dalam Analisis DNA Gelatin Sapi dan Gelatin Babi Menggunakan Real Time Polymerase Chain Reaction

Pemanfaatan gelatin secara luas menimbulkan kontroversi dan kekhawatiran bagi masyarakat muslim karena pada umumnya gelatin terbuat dari kulit babi dan sapi. Salah satu teknik analisis yang dapat membedakan gelatin sapi dan gelatin babi adalah Real Time Polymerase Chain Reaction (PCR) . Real Time PCR merupakan metode analisis berbasis DNA yang handal, efektif, dan terpecaya. Dalam analisis kualitatif dan kuantitatif, Real Time PCR membutuhkan pewarna fluoresens. Pewarna fluoresens yang umum digunakan adalah SYBR green dan hydrolysis probe . Telah dilakukan perbandingan antara metode SYBR green dan hydrolysis probe dalam analisis DNA gelatin menggunakan Real Time PCR . DNA pada gelatin diisolasi menggunakan kit komersial. Isolat DNA gelatin sapi dan DNA gelatin babi didapatkan sebanyak 19,38 ng/μl dan 13,63 ng/μl dengan kemurnian 1,566 dan 1,573. Isolat DNA yang dianalisis dengan metode SYBR green menggunakan suhu annealing 65 o C untuk primer sapi dan suhu annealing 60 o C untuk primer babi. Isolat DNA yang dianalisis dengan metode hydrolysis probe menggunakan suhu annealing 60 o C untuk primer babi dan primer sapi. Hasil analisis dari kedua metode menunjukkan bahwa metode hydrolysis probe lebih spesifik dalam mengidentifikasi DNA pada gelatin dibandingkan menggunakan metode SYBR green.
Motivating Ill-Structured Problem Solving in a Web-Based Peer-Group Learning Environment: A Learning-Goal Perspective

Motivation effort is one of the critical components that enable students to engage in the process of ill-structured problem solving. This article chronicles the development and evaluation of a motivation-supported problem-solving environment promoting learning goals. The environment was created by developing learning-goal oriented contexts that included (1) presenting task messages that stressed the intrinsic value of learning, (2) allowing learners to control their own learning activities, and (3) providing self-referenced evaluations. Forty-six middle-school students participated. One major finding was that a learning-goal oriented context was a powerful motivational strategy that boosted students' intrinsic motivation for ill-structured problem solving.