Miracle-dz/UniFAR-FTUs huggingface dataset:
Do Health Care Providers Respond to Demand-Side Incentives? Evidence from Indonesia

This paper exploits the subdistrict randomization of Indonesia's household Conditional Cash Transfer (CCT) program to analyze how the program affects the local health care market. The CCT program is associated with increased use of midwives as the main delivery attendants. The program is also associated with a 10 percent increase in both the number of midwives and the delivery fees charged by midwives in treated communities. Program participants report receiving a higher quality of prenatal care. This is due, however, not to improvements in quality of care in the market, but to increased utilization among program participants.
Real-Time Network Streaming of Dynamic 3D Content with In-frame and Inter-frame Compression

Real-time 3D content distribution over a network (either LAN or WAN) has many possible applications, but requires facing several challenges, most notably the handling of the large amount of data usually associated with 3D meshes. The scope of the present paper falls within the well-established context of real-time capture and streaming of OpenGL command sequences, focusing in particular on data compression schemes. However, we advance beyond the state-of-the-art improving over previous attempts of "in-frame" geometric compression on 3D structures inferred from generic OpenGL command sequences and adding "inter-frame" redundancy exploitation of the traffic generated by the typical architecture of interactive applications. Measurements reveal for this combination of techniques a very effective reduction of network traffic and a CPU overhead compatible with the requirements of interactive applications, suggesting a significant application potential for Internet-based 3D content streaming.
A Comparative Study of Mouse Hepatic and Intestinal Gene Expression Profiles under PPARα Knockout by Gene Set Enrichment Analysis

Gene expression profiling of PPARα has been used in several studies, but fewer studies went further to identify the tissue-specific pathways or genes involved in PPARα activation in genome-wide. Here, we employed and applied gene set enrichment analysis to two microarray datasets both PPARα related respectively in mouse liver and intestine. We suggested that the regulatory mechanism of PPARα activation by WY14643 in mouse small intestine is more complicated than in liver due to more involved pathways. Several pathways were cancer-related such as pancreatic cancer and small cell lung cancer, which indicated that PPARα may have an important role in prevention of cancer development. 12 PPARα dependent pathways and 4 PPARα independent pathways were identified highly common in both liver and intestine of mice. Most of them were metabolism related, such as fatty acid metabolism, tryptophan metabolism, pyruvate metabolism with regard to PPARα regulation but gluconeogenesis and propanoate metabolism independent of PPARα regulation. Keratan sulfate biosynthesis, the pathway of regulation of actin cytoskeleton, the pathways associated with prostate cancer and small cell lung cancer were not identified as hepatic PPARα independent but as WY14643 dependent ones in intestinal study. We also provided some novel hepatic tissue-specific marker genes.
A search for solar-like oscillations in K giants in the globular cluster M 4

Context. To expand the range in the colour–magnitude diagram where asteroseismology can be applied, we organized a photometry campaign to find evidence for solar-like oscillations in giant stars in the globular cluster M 4. Aims. The aim was to detect the comb-like p-mode structure characteristic for solar-like oscillations in the amplitude spectra. The 24 main target stars are in the region of the bump stars and have luminosities in the range 50−140 L� . Methods. We collected 6160 CCD frames and light curves for about 14 000 stars were extracted. The frames consist of exposures in the Johnson B, V and R bands and were obtained at three different telescopes. Three different software packages were applied to obtain the lowest possible photometric noise level. The resulting light curves have been analysed for signatures of oscillations using a variety of methods. Results. We obtain high quality light curves for the K giants, but no clear oscillation signal is detected. This is a surprise as the noise levels achieved in the amplitude spectra should permit oscillations to be seen at the levels predicted by extrapolating from stars at lower luminosities. In particular, when we search for the signature of oscillations in a large number of stars we might expect to see common features in the power spectra, but even here we fall short of having clear evidence of oscillations. Conclusions. High precision differential photometry is possible even in very crowded regions like the core of M 4. Solar-like oscillations are probably present in K giants, but the amplitudes are lower than classical scaling laws predict. The reasons may be that the lifetime of the modes are short or the driving mechanism is relatively inefficient in giant stars.
DIRECT NUMERICAL SIMULATION OF FREE-SURFACE AND INTERFACIAL FLOW

The numerical simulation of flows with interfaces and free-surface flows is a vast topic, with applications to domains as varied as environment, geophysics, engineering, and fundamental physics. In engineering, as well as in other disciplines, the study of liquid-gas interfaces is important in combustion problems with liquid and gas reagents. The formation of droplet clouds or sprays that subsequently burn in combustion chambers originates in interfacial instabilities, such as the Kelvin-Helmholtz instability. What can numerical simulations do to improve our understanding of these phenomena? The limitations of numerical techniques make it impossible to consider more than a few droplets or bubbles. They also force us to stay at low Reynolds or Weber numbers, which prevent us from finding a direct solution to the breakup problem. However, these methods are potentially important. First, the continuous improvement of computational power (or, what amounts to the same, the drop in megaflop price) continuously extends the range of affordable problems. Second, and more importantly, the phenomena we consider often happen on scales of space and time where experimental visualization is difficult or impossible. In such cases, numerical simulation may be a useful prod to the intuition of the physicist, the engineer, or the mathematician. A typical example of interfacial flow is the collision between two liquid droplets. Finding the flow involves the study not only of hydrodynamic fields in the air and water phases but also of the air-water interface. This latter part
Robust management of outliers in sensor network aggregate queries

Sensor networks are increasingly applied for monitoring diverse environments and applications. Due to their unsupervised nature of operation and inexpensive hardware used, sensor nodes may furnish readings of rather poor quality. We thus need to devise techniques that can withstand "dirty" data during query processing. In this paper we introduce a robust aggregation framework that can detect and isolate spurious measurements from computed aggregate values. Such readings are not injected in the reported aggregate, in order not to obscure the outcome, but are still maintained and returned to the user/application, which may investigate them further and take appropriate decisions. In addition, our framework provides a form of positive feedback to the user by enhancing the result with a set of nodes that contain the most characteristic values out of those included in the aggregation process. We perform an extensive experimental evaluation of our framework using real traces of sensory data and demonstrate its utility to the monitoring of applications.
Structure-Based Mesh Completion

Meshes acquired with range scanning devices typ- ically contain complex holes missing salient structure features. This paper presents a novel method to complete meshes by means of structure propagation. In our system, firstly, the unknown region is commonly filled with smooth patch that interpolates the shape and density of the surrounding mesh. Secondly, the user manually specifies the missing structure information by extending a few sketch curves from known to unknown area in a proper viewpoint. Thirdly, structure propagation is operated in a greedy manner with constraints of structure and consistency. Finally, structural geometric details are transferred onto the unknown region by operating over the intrinsic representation based on the Laplacian of the mesh. We demonstrate our approach at several examples, showing that complete meshes are generated in a pleasing way and preserve the structural geometric details as much as possible. Index Terms—Mesh completion, sketch, structure propagation.
Normalization towards Instruction Substitution Metamorphism Based on Standard Instruction Set

Metamorphic malware is able to change its signature which is a fixed sequence of bytes or code from generation to generation. This makes the traditional scanner based on the signature difficult to detect it. Combing normalization with traditional scanner is a promising direction to solve the problem. The idea is: firstly transform the code into canonical form then pass it into scanner to check. This paper proposes a novel normalization method towards instruction substitution which is a commonly used metamorphism approach. The method mainly involves two steps. Firstly, the input code is rewritten with standard instructions. Secondly, the order of standard instructions is adjusted based on the data dependence graph of each basic block. A case study of normalizing Win32.Evol has been carried out. The results demonstrate the feasibility of our method to make variants, including the original code, tend to be uniform.
An Experimental Study on Memory Allocators in Multicore and Multithreaded Applications

Memory allocations are one of the most omnipresent operations in computer programs. The performance of memory allocation operations is a very important aspect to be considered in software design, however it is frequently neglected. This paper presents an experimental comparative study of seven largely adopted memory allocators. Unlike other related works, we assess the selected memory allocators using real-world multithreaded applications. We consider the applications' response time, memory consumption, and memory fragmentation, in order to compare the performance of the investigated memory allocators running on a multicore machine. All test results are evaluated with respect to their statistical significance throughout the ANOVA method.
Applying the KISS Principle for the CLEF- IP 2010 Prior Art Candidate Patent Search Task

We present our experiments and results for the DCU CNGL participation in the CLEF-IP 2010 Candidate Patent Search Task. Our work applied standard information retrieval (IR) techniques to patent search. In addition, a very simple citation extraction method was applied to improve the results. This was our second consecutive participation in the CLEF-IP tasks. Our experiments in 2009 showed that many sophisticated approach to IR do not improve the retrieval effectiveness for this task. For this reason of we decided to apply only simple methods in 2010. These were demonstrated to be highly competitive with other participants. DCU submitted three runs for the Prior Art Candidate Search Task, two of these runs achieved the second and third ranks among the 25 runs submitted by nine different participants. Our best run achieved MAP of 0.203, recall of 0.618, and PRES of 0.523.
Repair checking in inconsistent databases: algorithms and complexity

Managing inconsistency in databases has long been recognized as an important problem. One of the most promising approaches to coping with inconsistency in databases is the framework of database repairs, which has been the topic of an extensive investigation over the past several years. Intuitively, a repair of an inconsistent database is a consistent database that differs from the given inconsistent database in a minimal way. So far, most of the work in this area has addressed the problem of obtaining the consistent answers to a query posed on an inconsistent database. Repair checking is the following decision problem: given two databases r and r', is r' a repair of r? Although repair checking is a fundamental algorithmic problem about inconsistent databases, it has not received as much attention as consistent query answering. In this paper, we give a polynomial-time algorithm for subset-repair checking under integrity constraints that are the union of a weakly acyclic set of local-as-view (LAV) tuple-generating dependencies and a set of equality-generating dependencies. This result significantly generalizes earlier work for subset-repair checking when the integrity constraints are the union of an acyclic set of inclusion dependencies and a set of functional dependencies. We also give a polynomial-time algorithm for symmetric-difference repair checking, when the integrity constraints form a weakly acyclic set of LAV tgds. After this, we establish a number of complexity-theoretic results that delineate the boundary between tractability and intractability for the repair-checking problem. Specifically, we show that the aforementioned tractability results are optimal; in particular, subset-repair checking for arbitrary weakly acyclic sets of tuple-generating dependencies is a coNP-complete problem. We also study cardinality-based repairs and show that cardinality-repair checking is coNP-complete for various classes of integrity constraints encountered in database design and data exchange.
Constructive Logic and Layout Synthesis: A Novel Incremental Approach

Summary This paper examines the extension of constructive libraryaware logic synthesis to the physical placement stage of integrated circuit design. Constructive logic synthesis differs from traditional synthesis approaches in that it builds a circuit netlist incrementally starting from the primary inputs and proceeding towards the primary outputs. In each iteration of this procedure, the semantic structure of the unsynthesized logic functions is utilized to identify and extract a small subcircuit that consists of library primitives reflecting that structure. The algorithm interleaves the steps of technology-independent decomposition and technology-dependent mapping into library cells in a way that mitigates its greedy nature. Conjecturing that adding a placement step to this methodology would further improve synthesis quality we developed a system which synthesizes circuits by incremental decomposition, mapping, and placement. We describe the algorithms used in this system and analyze the quality of the designs it generates under a variety of options for decomposition and placement. The empirical results we obtained, however, suggest that adding a placement step to constructive synthesis produces no noticeable improvement in design quality. This strongly suggests that our original conjecture is false, and we examine possible reasons for such a negative result.
Static and dynamic integrity properties patterns

Integrity is a crucial property in current computing systems. Due to natural or human-made (malicious and non-malicious) faults this property can be violated. Therefore, many methodologies and patterns that check or verify the integrity of systems or data have been introduced. However, integrity as a property cannot be identified directly. Existing methodologies tackle this problem by identifying other, computable, properties of the system and use a policy that describes how these properties reflect the integrity of the overall system. It is thus a critical task to select the right properties that reflect the integrity of a system in such a way that given integrity requirements are met. To ease this process, we introduce two new patterns, Static Integrity Properties and Dynamic Integrity Properties to classify the properties. Static Integrity Properties are used to ensure the integrity of a component prior it's use (e.g., the integrity of an executable binary), while Dynamic Integrity Properties are used to ensure the integrity of a component during run-time (e.g., properties that reflect the component's behavior or state transitions). Based on an exemplary embedded control system, we show typical use cases to help the system or software architect to choose the right class of integrity properties for the targeted system.
Colorimetric determination of serum acid phosphatase activity using adenosine 3′-monophosphate as substrate

The hydrolysis of adenosine 3′-monophosphate by serum acid phosphatase has been coupled to the liberation of ammonia from the adenosine generated through the action of exogenous adenosine deaminase. The ammonia is measured at the end of the incubation by a modification of the phenol-hypochlorite reaction of Berthelot. Optimum conditions for the enzyme reaction have been defined. Inhibition of the Berthelot reaction by the serum used in the assay is small, and may be compensated by a correction factor. Although the value for the control is high in relation to the test over the normal range, this is largely outweighed by the good sensitivity and precision of the method. The substrate is not significantly hydrolysed by erythrocyte acid phosphatase within the limits encountered in haemolysed sera. Experience of the method in routine hospital diagnosis compared favorably with that of a standard method employing disodium phenyl phosphate as substrate. It is suggested that activities greater than 3·1 IU/l should be further investigated and those greater than 3·7 IU/l should be regarded as definitely raised. The stability of human serum AcPase when promptly separated and held at 4°C or − 20°C was confirmed. At room temperature, acidification to pH 6·0 greatly improved stability.
Coordination of multiple cameras to track multiple people

In this paper, we present a distributed surveillance system that uses multiple cheap static cameras to track multiple people in indoor environments. The system has a set of Camera Processing Modules and a Central Module to coordinate the tracking tasks among the cameras. Since each object in the scene can be tracked by a number of cameras, the problem is how to choose the most appropriate camera for each object. We propose a novel algorithm to allocate objects to cameras using the object-to-camera distance while taking into account occlusion. The algorithm attempts to assign objects in the overlapping fields of view to the nearest camera which can see the object without occlusion. Experimental results show that the system can coordinate cameras to track people properly and can deal well with occlusion.
Smart phone camera image localization method for narrow corridors based on epipolar geometry

As some public buildings have become large in spatial scale, people find it more and more difficult to know their actual location in these buildings. Generally in the indoor environment, to get location information is relatively more complex than that in the outdoor environment, for traditional outdoor localization methods do not perform well in indoor environment. Under this circumstances, image based indoor localization is a meaningful research topic under many application scenarios. In this paper, we presented a method for performing image based localization using smart phones in narrow corridors. In the first step, image fingerprint database is established, and then features of every image in the database are extracted. Users' query image is compared with the database to retrieve matched images and corresponding feature points. After that, epipolar geometry is utilized so as to calculate the actual location of query image. Besides, we make localization experiments in corridors and compare the result to that of localization method based on wireless local area network in the same environment. In our work, we achieve a slightly better localization accuracy over a set of 51 query images taken in an environment of narrow corridors than the accuracy attained by using wireless local area network based method with the same environmental conditions.
Ontology-Based Semantic Metadata Validation

Much of the Semantic Web content is generated from databases, especially the instance data based on the ontology classes used in applications. A recurring problem is that the instance data does not always semantically conform to the ontology used. It may be ambiguous, incomplete, or partly erroneous. Validating the data is necessary when it is transformed to a more semantic format. This may be a difficult and laborious task given the large and complex ontologies and databases in use. This paper discusses the problem of validating existing database instance data according to an ontology. We show how Semantic Web standards can augment the syntactic data validation schemes of relational databases and XML towards semantic validation. A metadata editor for semantic validation is being implemented. Its idea is to provide an XML-based view to a relational database and transform the data into RDF instances conforming to an RDF Schema, the ontology. The tool will be applied in tranforming museum collection data into a semantically interoperable form in the Finnish Museums on the Semantic Web project.
Survey of the nob5 mutation in C3H substrains

Purpose A no b-wave (nob) electroretinography (ERG) phenotype arose spontaneously in a colony of C3H mice and was named nob5. A mutation was identified in the Gpr179 gene in homozygous nob5 mice. There is a concern that this mutation is also present in additional C3H sublines and may compromise retinal research performed using these lines. In this report, therefore, we provide a phenotype and genotype survey of nob5 in six C3H substrains present at the Jackson Laboratory. Methods Fundus changes were evaluated in the six C3H substrains with image-guided optical coherence tomography (OCT), and retinal function was assessed with ERG. The substrains were genotyped with PCR using appropriate primers for the nob5 mutation. Additionally, the genomic sequences of C3H/HeJ, available from the Jackson Laboratory, and C3H/HeH, available from the Wellcome Trust Sanger Institute, were examined for the Gpr179nob5 mutation. Results Two C3H congenic strains, C3Sn.BLiA-Pde6b+/DnJ and C3A.BLiA-Pde6b+/J, wild-type for Pde6b, used as the sighted control strains and had normal fundi, OCT, and ERG responses. Four C3H strains C3H/HeJ, C3HeB/FeJ, C3H/HeOuJ, and C3H/HeSnJ bearing the Pde6brd1 allele exhibited a grainy fundus appearance, retinal degeneration on OCT, and no rod and cone ERG responses. The nob5 mutation was not observed in the six C3H strains assessed with PCR genotyping. Further, the genomic sequences of C3H/HeJ and C3H/HeH did not contain the nob5 mutation. Conclusions The Gpr179nob5 allele is not present in C3H substrains at the Jackson Laboratory. Therefore, the usefulness of these C3H strains as commonly used models to study the effects of photoreceptor degeneration is not compromised.