Miracle-dz/UniFAR-FTUs huggingface dataset:
Converting thread-level parallelism to instruction-level parallelism via simultaneous multithreading

To achieve high performance, contemporary computer systems rely on two forms of parallelism: instruction-level parallelism (ILP) and thread-level parallelism (TLP). Wide-issue super-scalar processors exploit ILP by executing multiple instructions from a single program in a single cycle. Multiprocessors (MP) exploit TLP by executing different threads in parallel on different processors. Unfortunately, both parallel processing styles statically partition processor resources, thus preventing them from adapting to dynamically changing levels of ILP and TLP in a program. With insufficient TLP, processors in an MP will be idle; with insufficient ILP, multiple-issue hardware on a superscalar is wasted. This article explores parallel processing on an alternative architecture, simultaneous multithreading (SMT), which allows multiple threads to complete for and share all of the processor's resources every cycle. The most compelling reason for running parallel applications on an SMT processor is its ability to use thread-level parallelism and instruction-level parallelism interchangeably. By permitting multiple threads to share the processor's functional units simultaneously, the processor can use both ILP and TLP to accommodate variations in parallelism. When a program has only a single thread, all of the SMT processor's resources can be dedicated to that thread; when more TLP exists, this parallelism can compensate for a lack of per-thread ILP. We examine two alternative on-chip parallel architectures for the next generation of processors. We compare SMT and small-scale, on-chip multiprocessors in their ability to exploit both ILP and TLP. First, we identify the hardware bottlenecks that prevent multiprocessors from effectively exploiting ILP. Then, we show that because of its dynamic resource sharing, SMT avoids these inefficiencies and benefits from being able to run more threads on a single processor. The use of TLP is especially advantageous when per-thread ILP is limited. The ease of adding additional thread contexts on an SMT (relative to adding additional processors on an MP) allows simultaneous multithreading to expose more parallelism, further increasing functional unit utilization and attaining a 52% average speedup (versus a four-processor, single-chip multiprocessor with comparable execution resources). This study also addresses an often-cited concern regarding the use of thread-level parallelism or multithreading: interference in the memory system and branch prediction hardware. We find the multiple threads cause interthread interference in the caches and place greater demands on the memory system, thus increasing average memory latencies. By exploiting threading-level parallelism, however, SMT hides these additional latencies, so that they only have a small impact on total program performance. We also find that for parallel applications, the additional threads have minimal effects on branch prediction.
A Cuboctahedron Module for a Reconfigurable Robot

We present a concept for a modular robot with a quasi-regular polyhedron based on a cuboctahedron element. Lattice-type modular robots can adapt their morphology by reconfiguring to various shapes. While regular polyhedrons provide the bases of many promising 3D lattice elements, few modular robots have shapes with more than six regular faces. The conceptual design and prototypes of cuboctahedron elements are presented in this paper. To account for the various connecting configurations between robotic modules, we propose a directed graph with three parameters to represent the morphology of such a modular robotic system.
The Metallogenetic Regularities of Lithium Deposits in China

Lithium resources support the development of high‐technology industries. China has abundant lithium resources which are mainly distributed in Tibet, Qinghai, Sichuan and Jiangxi. Salt lakes in China have significant lithium reserves, but lithium is mainly produced from hard rock lithium deposits because the extraction from salt lakes requires further improvements. The hard rock lithium deposits mainly occur in granitic pegmatite in the Altay region of Xinjiang and the Jiajika deposit in western Sichuan Province; they mainly formed in the Mesozoic and occurred in a relatively stable stage during orogenic processes. On the basis of the information from 151 lithium deposits or spots, 14 lithium metallogenic series were identified, and granitic pegmatite, granite, and sedimentary types were considered to be the main prediction types of lithium resources. Twelve lithium mineralization belts were divided and a series of maps showing the lithium metallogenetic regularity in China were drawn. We conclude that the hard rock and brine type of lithium resources possibly have a similar lithium source related to magmatism. The metallogenic features of the lithium in China were related with the distinct history of tectonic‐magmatic activity in China. This study benefits the assessment of, and prospecting for, lithium resources in China.
Bioinformatics Applications Note Genetics and Population Analysis Hiv Therapy Simulator: a Graphical User Interface for Comparing the Effectiveness of Novel Therapy Regimens

Computer simulation models can be useful in exploring the efficacy of HIV therapy regimens in preventing the evolution of drug-resistant viruses. Current modeling programs, however, were designed by researchers with expertise in computational biology, limiting their accessibility to those who might lack such a background. We have developed a user-friendly graphical program, HIV Therapy Simulator (HIVSIM), that is accessible to non-technical users. The program allows clinicians and researchers to explore the effectiveness of various therapeutic strategies, such as structured treatment interruptions, booster therapies and induction-maintenance therapies. We anticipate that HIVSIM will be useful for evaluating novel drug-based treatment concepts in clinical research, and as an educational tool.
Identification of a novel cationic glycolipid in Streptococcus agalactiae that contributes to brain entry and meningitis

Bacterial membrane lipids are critical for membrane bilayer formation, cell division, protein localization, stress responses, and pathogenesis. Despite their critical roles, membrane lipids have not been fully elucidated for many pathogens. Here, we report the discovery of a novel cationic glycolipid, lysyl-glucosyl-diacylglycerol (Lys-Glc-DAG), which is synthesized in high abundance by the bacterium Streptococcus agalactiae (Group B Streptococcus, GBS). To our knowledge, Lys-Glc-DAG is more positively charged than any other known lipids. Lys-Glc-DAG carries 2 positive net charges per molecule, distinct from the widely described lysylated phospholipid lysyl-phosphatidylglycerol (Lys-PG) that carries one positive net charge due to the presence of a negatively charged phosphate moiety. We use normal phase liquid chromatography (NPLC) coupled with electrospray ionization (ESI) high-resolution tandem mass spectrometry (HRMS/MS) and genetic approaches to determine that Lys-Glc-DAG is synthesized by the enzyme MprF in GBS, which covalently modifies the neutral glycolipid Glc-DAG with the cationic amino acid lysine. GBS is a leading cause of neonatal meningitis, which requires traversal of the endothelial blood–brain barrier (BBB). We demonstrate that GBS strains lacking mprF exhibit a significant decrease in the ability to invade BBB endothelial cells. Further, mice challenged with a GBSΔmprF mutant developed bacteremia comparably to wild-type (WT) infected mice yet had less recovered bacteria from brain tissue and a lower incidence of meningitis. Thus, our data suggest that Lys-Glc-DAG may contribute to bacterial uptake into host cells and disease progression. Importantly, our discovery provides a platform for further study of cationic lipids at the host–pathogen interface.
Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics

We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which is throughput-optimal in networks with a fixed number users, fails to achieve the maximum throughput in the presence of flow-level dynamics. In this paper, we propose a new algorithm, called workload-based scheduling with learning, which is provably throughput-optimal, requires no prior knowledge of channels and user demands, and performs significantly better than previously suggested algorithms.
VALIDATION OF THE SWAT MODEL ON A LARGE RWER BASIN WITH POINT AND NONPOINT SOURCES 1

ABSTRACT: The State of Texas has initiated the development of a Total Maximum Daily Load program in the Bosque River Watershed, where point and nonpoint sources of pollution are a concern. Soil Water Assessment Tool (SWAT) was validated for flow, sediment, and nutrients in the watershed to evaluate alternative management scenarios and estimate their effects in controlling pollution. This paper discusses the calibration and validation at two locations, Hico and Valley Mills, along the North Bosque River. Calibration for flow was performed from 1960 through 1998. Sediment and nutrient calibration was done from 1993 through 1997 at Hico and from 1996 through 1997 at Valley Mills. Model validation was performed for 1998. Time series plots and statistical measures were used to verify model predictions. Predicted values generally matched well with the observed values during calibration and validation (R2≥ 0.6 and Nash‐Suttcliffe Efficiency ≥ 0.5, in most instances) except for some underprediction of nitrogen during calibration at both locations and sediment and organic nutrients during validation at Valley Mills. This study showed that SWAT was able to predict flow, sediment, and nutrients successfully and can be used to study the effects of alternative management scenarios.
PRN BASED WATERMARKING SCHEME FOR COLOR IMAGES

Robust image watermarking is the process of embedding an invisible watermark in an image in order to make it very difficult to remove the watermark after intentional attacks and normal audio/visual processes. A recent DWT-based semi-blind image watermarking scheme leaves out the low pass band, and embeds the watermark in the other three bands into the coefficients that are higher than a given threshold T 1. During watermark detection, all the high pass coefficients above another threshold T 2 (T 2 > T 1) are used in correlation with the original watermark. In our extension to the DWT-based approach, we embed the same watermark in two bands (LL and HH) using different scaling factors for each band. In the watermark detection algorithm, the watermarked RGB (and possibly attacked) image is converted to the YUV model. After computing the DWT of the luminance layer, all the DWT coefficients higher than a given threshold T2 in the LL and HH bands are selected. The next step is to compute the sum Z, where i runs over all DWT coefficients higher than a given threshold T2 in the LL and HH bands. In each band, if Z exceeds T, the watermark is present. Experimental results indicate that detection in the LL band is robust for one group of attacks, and detection in the HH band is robust for another group of attacks.
A Comparison between Decision Trees and Markov Models to Support Proactive Interfaces

During the past few years, personal portable computer systems such as PDAs or laptops are being used in different contexts such as in meetings, at the office, or at home. In the current era of multimodal interaction, each context may require other interaction strategies or system settings to allow the end-users to reach their envisioned goals. For instance, in a meeting room a user may want to use the projection equipment and disable the audio output for a presentation, while audio input and output may be important while in a teleconference. In present computer systems most changes have to be made manually and require explicit interaction with the system. The number of different devices used in such environments makes that this configuration step results in a high cognitive load and causes interrupts of the tasks being executed by the end-user. In this paper we present how proactive user interfaces may predict the next interface changes invoked by context switches or user actions. In particular, we will focus on two machine learning algorithms, decision trees and Markov models, that may support this proactive behaviour for multimodal user interfaces. Based on some simple but relevant scenarios, we compare the outcome of both implementations in order to decide which algorithm is most applicable in this context.
Approximating Semidefinite Packing Programs

In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications such as semidefinite programming relaxations for combinatorial optimization problems, sparse principal component analysis, and sparse variance unfolding techniques for dimension reduction. Our algorithm exploits the structural similarity between semidefinite packing programs and linear packing programs.
The Effect of Gray Balance and Tone Reproduction on Consistent Color Appearance

CMYK pictorial color images, when output to ISO 15339-2 CRPC1~CRPC7 reference printing conditions, are said to have consistent or common color appearance despite their colorimetric differences in white point and gamut volume. However, the concept of consistent color appearance and its enablement through CRPCs have not been experimentally validated. This research, as a part of the CIE TC8-16 on Consistent Color Appearance, explores the effects of gray balance and tone reproduction as underlying criteria of this attribute. The experiment involves altering the chosen CRPC reference dataset with known colorimetric differences, generating ICC profiles and preparing pictorial color images in the altered printing conditions and conducting psychometric evaluations. In the experiment, we used the CRPC4 dataset as the reference printing condition to print eight CMYK SCID images and their alterations. For each scene, two alterations of gamut volume are created as control datasets resulting in small and large gamut volume conditions that differ from the CRPC4 reference by 4-5 ∆E00 at the 95th percentile, used as the measure of colorimetric differences between datasets. In addition to the gamut volume alterations, two additional alterations are created by modifying either gray balance or tone reproduction, whereby those alterations differ by 4-5 ∆E00 at the 95th percentile with the primaries held constant. The research question was formulated as follows: “Will color images with similar colorimetric changes in gamut volume without alterations of GB and TR be perceived as more consistent than similar colorimetric changes due to alterations of GB and TR? ” During psychometric evaluations observers were presented two images with gamut alterations as end points. From a pair of images of the same scene randomly chosen among three alternatives: reference CRPC4, GB and TR altered images, they had to select one that yields more consistent color appearance for the entire triplet. In the second experiment, observers were asked to identify one image from the set of three test images: CRPC4 reference, GB and TR altered, to produce the highest color consistency among eight images of different scenes wherein seven of them were produced using CRPC4 reference printing conditions. The results show that consistent color appearance of images of the same scenes, reproduced in multiple printing conditions, depends on gray balance and tone reproduction. In addition, consistent color appearance of multiple scenes, reproduced in one printing condition, also depends on similar gray balance and tone reproduction.
Stratigraphy of Late Cretaceous-Early Eocene, Seno Skyring--Strait of Magellan Area, Magallanes Province, Chile

Five surface sections and one subsurface section of Late Cretaceous--early Tertiary sedimentary rocks were studied in the Punta Arenas-Strait of Magellan area, southern Chile. The rocks range in age from middle Maestrichtian to early Eocene and consist of the following formations from base to top: Santa Ana Beds, Rio Blanco, Carrera, Chorrillo Chico, San Jorge, and Agua Fresca (eastern Brunswick Peninsula area); and Fuentes, Rocallosa, Chorrillo Chico, San Jorge, and Agua Fresca (Seno Skyring area). The Cretaceous-Tertiary boundary is in the Chorrillo Chico Formation which covers the entire area. The rocks studied are varieties of graywacke, siltstone, and argillite. Heavy-mineral studies indicate a varied source area including silicic plutons, metamorphic and gneissic rocks, and some volcanic terrane. Lithologic, paleoecologic, and geochemical data show that the transition from middle Maestrichtian to early Eocene was gradual. Generally, the depth of water in which the stratigraphic units were deposited decreased continually through time. Geochemical element analyses were made in an attempt to correlate the pre-Chorrillo Chico units in the Seno Skyring and Brunswick Peninsula areas. The study was limited and the results were not decisive. However, evidence was found to support correlation of the middle Rocallosa Formation with the Carrera Formation. The results obtained warrant further geochemical studies to aid correlation in the area. All evidence collected indicates that, before deposition of the Chorrillo Chico Formation, the Late Cretaceous basin in this area was bisected by a northeast-southwest-trending topographic ridge. Because of the presence of this ridge, the sedimentation histories in the northwestern and southeastern parts of the area differ, and units deposited on either side of the ridge are difficult to correlate.
Lower Bounds for Cutting Planes Proofs with Small Coe cientsMaria

We consider small-weight Cutting Planes (CP) proofs; that is, Cutting Planes (CP) proofs with coeecients up to Poly(n). We use the well known lower bounds for monotone complexity to prove an exponential lower bound for the length of CP proofs, for a family of tautologies based on the clique function. Because Resolution is a special case of small-weight CP, our method also gives a new and simpler exponential lower bound for Resolution. We also prove the following two theorems : (1) Tree-like CP proofs cannot polynomially simulate non-tree-like CP proofs. (2) Tree-like CP proofs and Bounded-depth-Frege proofs cannot polynomially simulate each other. Our proofs also work for some generalizations of the CP proof system. In particular, they work for CP with a deduction rule, and also for proof systems that allow any formula with small communication complexity, and any set of sound rules of inference. 1 Introduction One of the most fundamental questions in propositional proof theory is: how strong is a particular proof system? In particular , one tries to give examples of tautologies with no short proofs in the system. It is believed that for any conceiv
Data sweeper: A proactive filtering framework for error-bounded sensor data collection

In this paper, we develop a novel framework that attempts to reduce network traffic for error-bounded data collection in wireless sensor networks. In many sensor applications, it is acceptable that the monitoring results evaluated based on collected data might deviate from the exact results; as long as the error is bounded by a certain threshold. One well-known technique for error-bounded data collection is data filtering, which explores temporal data correlation to suppress data updates. A concrete scheme was proposed in [1]. The data collection is divided in rounds. A filter is installed on each node and the total filter size is constrained by the user-specified error budget. Intuitively, if the data change from the last update report is smaller than the filter size, the current update is suppressed, i.e., not to report to the base station. To adapt to system dynamics, the sizes of all filters are periodically shrunk and the left-over budget is re-allocated to the node with the highest load. Many follow up studies can be found [2][3].
Evaluation of in situ smectite dehydration as a pore water freshening mechanism in the Nankai Trough, offshore southwest Japan

Pore water freshening has been observed within sediments near the trench at numerous subduction zones. Constraining the relative contributions of long‐distance updip flow of freshened fluids and in situ clay dehydration holds important implications for margin‐scale fluid flow but remains unresolved because the evolution of pore water chemistry expected due to in situ clay dehydration and the budget of fresh water release have generally not been carefully quantified. Here, we address this problem at the well‐studied Nankai Trough offshore SW Japan, where Deep Sea Drilling Project and Ocean Drilling Program drilling have sampled the sedimentary section along two transects: the Muroto transect and the Ashizuri transect, located ∼100 km southwest along strike. Broad low‐chloride anomalies with minimum concentrations significantly below typical seawater values were documented along the Muroto transect at Sites 1173, 1174, and 808 and indicate progressive freshening with increasing burial. In contrast, freshening at Site 1177 along the Ashizuri transect (∼24 km seaward of the trench) is characterized by a series of sharp excursions from seawater values. We use a one‐dimensional model to simulate sedimentation, thermal history, clay dehydration, and chemical diffusion, in order to quantify the component of pore water freshening attributable to in situ smectite dehydration. We find that simulated reaction progress is in close agreement with observations. The peak magnitude of pore water freshening is reasonably well predicted within the lowermost ∼150 m of the section but consistently underpredicted at intermediate depths. The residual pore water freshening profiles (not explained by smectite dehydration) reach peak magnitudes of ∼50–75 mM and approximately straddle the décollement at Sites 1174 and 808. We suggest that these residuals may reflect either an additional in situ dehydration process or a contribution from updip fluid migration along the fault. Our conclusion differs from that of previous studies, which have suggested that most of the observed geochemical anomaly could be generated by in situ smectite dehydration with as little as 15 wt% initial smectite. This substantial discrepancy is readily explained by the high sensitivity of pore water freshening to assumed porosity at the time of dehydration.
Optimal Velocity Planning of Wheeled Mobile Robots on Specific Paths in Static and Dynamic Environments

This paper deals with optimal temporal-planning of wheeled mobile robots (WMRs) when navigating on predefined spatial paths. A method is proposed to generate a timeoptimal velocity profile for any spatial path in static environments or when mobile obstacles are present. The method generates a feasible trajectory to be tracked by fully exploiting velocity, acceleration and deceleration boundaries of the WMR, and by ensuring the continuity of the velocity and acceleration functions. As an additional benefit for the tracking process the jerk is also bounded. The algorithm is not time consuming, since it mostly uses closed mathematical expressions, nonetheless iteration strategies are presented to solve specific situations. However, such situations are not expected to occur when the spatial paths are planned as smooth curves. The success of the algorithm was tested by experimental and simulation results on the WMR ‘‘RAM. ’’ © 2003 Wiley Periodicals, Inc.