nils-herrmann/clean_scirepeval huggingface dataset:
Protective effects of α-tocopherol and ascorbic acid against cardol-induced cell death and reactive oxygen species generation in Staphylococcus aureus.

Cardol (C₁₅:₃), isolated from cashew (Anacardium occidentale L.) nut shell liquid, has been shown to exhibit bactericidal activity against various strains of Staphylococcus aureus, including methicillin-resistant strains. The maximum level of reactive oxygen species generation was detected at around the minimum bactericidal concentration of cardol, while reactive oxygen species production drastically decreased at doses above the minimum bactericidal concentration. The primary response for bactericidal activity around the bactericidal concentration was noted to primarily originate from oxidative stress such as intracellular reactive oxygen species generation. High doses of cardol (C₁₅:₃) were shown to induce leakage of K⁺ from S. aureus cells, which may be related to the decrease in reactive oxygen species. Antioxidants such as α-tocopherol and ascorbic acid restricted reactive oxygen species generation and restored cellular damage induced by the lipid. Cardol (C₁₅:₃) overdose probably disrupts the native membrane-associated function as it acts as a surfactant. The maximum antibacterial activity of cardols against S. aureus depends on their log P values (partition coefficient in octanol/water) and is related to their similarity to those of anacardic acids isolated from the same source.
Pipelining with Futures

Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementation of 2-3 trees. The approach was later used by Cole in the first O( lg n) time sorting algorithm on the PRAM not based on the AKS sorting network, and has since been used to improve the time of several other algorithms. Although the approach has improved the asymptotic time of many algorithms, there are two practical problems: maintaining the pipeline is quite complicated for the programmer, and the pipelining forces highly synchronous code execution. Synchronous execution is less practical on asynchronous machines and makes it difficult to modify a schedule to use less memory or to take better advantage of locality. In this paper we show how futures (a parallel language construct) can be used to implement pipelining without requiring the user to code it explicitly, allowing for much simpler code and more asynchronous execution. A runtime system manages the pipelining implicitly. As with user-managed pipelining, we show how the technique reduces the depth of many algorithms by a logarithmic factor over the nonpipelined version. We describe and analyze four algorithms for which this is the case: a parallel merging algorithm on trees, parallel algorithms for finding the union and difference of two randomized balanced trees (treaps), and insertion into a variant of the PVW 2-3 trees. For three of these, the pipeline delays are data dependent making them particularly difficult to pipeline by hand. To determine the runtime of algorithms we first analyze the algorithms in a language-based cost model in terms of the work w and depth d of the computations, and then show universal bounds for implementing the language on various machine models.
Intangible cultural heritage preservation: An exploratory study of digitization of the historical literature of Chinese Kunqu opera librettos

This article introduces the study contents and some research findings regarding digital preservation methods for Chinese Kunqu opera libretto historical literature, including historical literature electronic libretto transformation, libretto musical score image segmentation, musical information recognition, musical score information representation, musical score information storage, and libretto reconstruction on the Web. It proposes a novel editable text method to represent the multidimensional tree-like information structure of the Kunqu libretto literature and a musical semantic annotation method based on numbered musical notation to accommodate the musical features of Kunqu librettos. To maintain the characteristics of the original Kunqu musical notation, it proposes a method to reconstruct Kunqu libretto on the Web based on scalable vector graphics. Some Kunqu librettos were randomly selected for experiments, and the results demonstrated that the editable text method and the musical semantic annotation method were able to fully represent the effective information of the Kunqu libretto literature and that the method to reconstruct librettos on the Web was able to reflect the writing characteristics of the musical notation in the original librettos. Finally, it discusses the primary future research directions related to digital Kunqu, including Kunqu libretto metadata research, corpus construction for the librettos and Qupai (the unique ancient Chinese tune mode), libretto music information disambiguation research, libretto image segmentation and pattern recognition, digital Kunqu roles, digital Kunqu stages, digital Kunqu costume suitcases, virtual Kunqu, digitization and restoration of Kunqu cultural relics, and Kunqu's application prospects in conventional media such as animation, anime, and movies.
Survey on Vision-based Path Prediction

Path prediction is a fundamental task for estimating how pedestrians or vehicles are going to move in a scene. Because path prediction as a task of computer vision uses video as input, various information used for prediction, such as the environment surrounding the target and the internal state of the target, need to be estimated from the video in addition to predicting paths. Many prediction approaches that include understanding the environment and the internal state have been proposed. In this survey, we systematically summarize methods of path prediction that take video as input and and extract features from the video. Moreover, we introduce datasets used to evaluate path prediction methods quantitatively.
A Graphical Query Language Supporting Recursion

We define a language G for querying data represented as a labeled graph G. By considering G as a relation, this graphical query language can be viewed as a relational query language, and its expressive power can be compared to that of other relational query languages. We do not propose G as an alternative to general purpose relational query languages, but rather as a complementary language in which recursive queries are simple to formulate. The user is aided in this formulation by means of a graphical interface. The provision of regular expressions in G allows recursive queries more general than transitive closure to be posed, although the language is not as powerful as those based on function-free Horn clauses. However, we hope to be able to exploit well-known graph algorithms in evaluating recursive queries efficiently, a topic which has received widespread attention recently.
An open-label, multicenter, randomized, crossover study comparing sildenafil citrate and tadalafil for treating erectile dysfunction in Chinese men naïve to phosphodiesterase 5 inhibitor therapy

The study was to compare treatment preference, efficacy, and tolerability of sildenafil citrate (sildenafil) and tadalafil for treating erectile dysfunction (ED) in Chinese men naοve to phosphodiesterase 5 (PDE5) inhibitor therapies. This multicenter, randomized, open-label, crossover study evaluated whether Chinese men with ED preferred 20-mg tadalafil or 100-mg sildenafil. After a 4 weeks baseline assessment, 383 eligible patients were randomized to sequential 20-mg tadalafil per 100-mg sildenafil or vice versa for 8 weeks respectively and then chose which treatment they preferred to take during the 8 weeks extension. Primary efficacy was measured by Question 1 of the PDE5 Inhibitor Treatment Preference Questionnaire (PITPQ). Secondary efficacy was analyzed by PITPQ Question 2, the International Index of Erectile Function (IIEF) erectile function (EF) domain, sexual encounter profile (SEP) Questions 2 and 3, and the Drug Attributes Questionnaire. Three hundred and fifty men (91%) completed the randomized treatment phase. Two hundred and forty-two per 350 (69.1%) patients preferred 20-mg tadalafil, and 108/350 (30.9%) preferred 100-mg sildenafil (P < 0.001) as their treatment in the 8 weeks extension. Ninety-two per 242 (38%) patients strongly preferred tadalafil and 37/108 (34.3%) strongly the preferred sildenafil. The SEP2 (penetration), SEP3 (successful intercourse), and IIEF-EF domain scores were improved in both tadalafil and sildenafil treatment groups. For patients who preferred tadalafil, getting an erection long after taking the medication was the most reported reason for tadalafil preference. The only treatment-emergent adverse event reported by > 2% of men was headache. After tadalafil and sildenafil treatments, more Chinese men with ED naοve to PDE5 inhibitor preferred tadalafil. Both sildenafil and tadalafil treatments were effective and safe.
ASED ON LDA T OPIC M ODELLING

A Large number of digital text information is generated every day. Effectively searching, managing and exploring the text data has become a main task. In this paper, we first represent an introduction to text mining and a probabilistic topic model Latent Dirichlet allocation. Then two experiments are proposed Wikipedia articles and users’ tweets topic modelling. The former one builds up a document topic model, aiming to a topic perspective solution on searching, exploring and recommending articles. The latter one sets up a user topic model, providing a full research and analysis over Twitter users’ interest. The experiment process including data collecting, data pre-processing and model training is fully documented and commented. Further more, the conclusion and application of this paper could be a useful computation tool for social and business research.
Rapid spectrotemporal plasticity in primary auditory cortex during behavior.

Complex natural and environmental sounds, such as speech and music, convey information along both spectral and temporal dimensions. The cortical representation of such stimuli rapidly adapts when animals become actively engaged in discriminating them. In this study, we examine the nature of these changes using simplified spectrotemporal versions (upward vs downward shifting tone sequences) with domestic ferrets (Mustela putorius). Cortical processing rapidly adapted to enhance the contrast between the two discriminated stimulus categories, by changing spectrotemporal receptive field properties to encode both the spectral and temporal structure of the tone sequences. Furthermore, the valence of the changes was closely linked to the task reward structure: stimuli associated with negative reward became enhanced relative to those associated with positive reward. These task- and-stimulus-related spectrotemporal receptive field changes occurred only in trained animals during, and immediately following, behavior. This plasticity was independently confirmed by parallel changes in a directionality function measured from the responses to the transition of tone sequences during task performance. The results demonstrate that induced patterns of rapid plasticity reflect closely the spectrotemporal structure of the task stimuli, thus extending the functional relevance of rapid task-related plasticity to the perception and learning of natural sounds such speech and animal vocalizations.
A Prediction Model that Combines Rain Attenuation and Other Propagation Impairments Along Earth-Satellite Paths

Issue No. 2, Fall 2002 www.spacejournal.org Page 1 of 29 A Prediction Model that Combines Rain Attenuation and Other Propagation Impairments Along EarthSatellite Paths Asoka Dissanayake, Jeremy Allnutt,  The rapid growth of satellite services using higher frequency bands such as the Ka-band has highlighted a need for estimating the combined effect of different propagation impairments. Many projected Ka-band services will use very small terminals and, for some, rain effects may only form a relatively small part of the total propagation link margin. It is therefore necessary to identify and predict the overall impact of every significant attenuating effect along any given path. A procedure for predicting the combined effect of rain attenuation and several other propagation impairments along earth-satellite paths is presented. Where accurate model exist for some phenomena, these have been incorporated into the prediction procedure. New models were developed, however, for rain attenuation, cloud attenuation, and low-angle fading to provide more overall accuracy, particularly at very low elevation angles (<10°). In the absence of a detailed knowledge of the occurrence probabilities of different impairments, an empirical approach is taken in estimating their combined effects. An evaluation of the procedure is made using slant-path attenuation data that have been collected with simultaneous beacon and radiometer measurements which allow a near complete account of different impairments. Results indicate that the rain attenuation element of the model provides the best average accuracy globally between 10 and 30 GHz and that the combined procedure gives prediction accuracies comparable to uncertainties associated with the year-to-year variability of path attenuation.
A comparison of peer-to-peer architectures.

The large number of peer-to-peer file-sharing applications can be subdivided in three basic categories: having a mediated, pure or hybrid architecture. This paper details each of these and indicates their respective strengths and weaknesses. In addition to this theoretical study, a number of practical experiments were conducted, with special attention for three popular applications, representative of each of the three architectures. Although a number of measurement studies have been done in the past (, , etc.) these all investigate only a fraction of the available applications and architectures, with very little focus on the bigger picture and to the recent evolutions in peer-to-peer architectures.
Simultaneous detection of Neisseria meningitidis, Haemophilus influenzae, and Streptococcus pneumoniae in suspected cases of meningitis and septicemia using real-time PCR.

A single-tube 5' nuclease multiplex PCR assay was developed on the ABI 7700 Sequence Detection System (TaqMan) for the detection of Neisseria meningitidis, Haemophilus influenzae, and Streptococcus pneumoniae from clinical samples of cerebrospinal fluid (CSF), plasma, serum, and whole blood. Capsular transport (ctrA), capsulation (bexA), and pneumolysin (ply) gene targets specific for N. meningitidis, H. influenzae, and S. pneumoniae, respectively, were selected. Using sequence-specific fluorescent-dye-labeled probes and continuous real-time monitoring, accumulation of amplified product was measured. Sensitivity was assessed using clinical samples (CSF, serum, plasma, and whole blood) from culture-confirmed cases for the three organisms. The respective sensitivities (as percentages) for N. meningitidis, H. influenzae, and S. pneumoniae were 88.4, 100, and 91.8. The primer sets were 100% specific for the selected culture isolates. The ctrA primers amplified meningococcal serogroups A, B, C, 29E, W135, X, Y, and Z; the ply primers amplified pneumococcal serotypes 1, 2, 3, 4, 5, 6, 7, 8, 9, 10A, 11A, 12, 14, 15B, 17F, 18C, 19, 20, 22, 23, 24, 31, and 33; and the bexA primers amplified H. influenzae types b and c. Coamplification of two target genes without a loss of sensitivity was demonstrated. The multiplex assay was then used to test a large number (n = 4,113) of culture-negative samples for the three pathogens. Cases of meningococcal, H. influenzae, and pneumococcal disease that had not previously been confirmed by culture were identified with this assay. The ctrA primer set used in the multiplex PCR was found to be more sensitive (P < 0.0001) than the ctrA primers that had been used for meningococcal PCR testing at that time.
Integrated control strategy for islanded operation in smart grids: Virtual inertia and ancillary services

Distributed Generation has become a consolidated phenomenon in distribution grids in the last few years. Even though the matter is very articulated and complex, islanding operation of distribution grid is being considered as a possible measure to improve service continuity. In this paper a novel static converter control strategy to obtain frequency and voltage regulation in islanded distribution grid is proposed. Two situations are investigated: in the former one electronic converter and one synchronous generator are present, while in the latter only static generation is available. In both cases, converters are supposed to be powered by DC micro-grids comprising of generation and storage devices. In the first case converter control will realize virtual inertia and efficient frequency regulation by mean of PID regulator; this approach allows to emulate a very high equivalent inertia and to obtain fast frequency regulation, which could not be possible with traditional regulators. In the second situation a Master-Slave approach will be adopted to maximize frequency and voltage stability. Simulation results confirm that the proposed control allows islanded operation with high frequency and voltage stability under heavy load variations.
Management of Service Level Agreements for Cloud Services in IoT: A Systematic Mapping Study

Cloud computing and Internet of Things (IoT) are computing technologies that provide services to consumers and businesses, allowing organizations to become more agile and flexible. Therefore, ensuring quality of service (QoS) through service-level agreements (SLAs) for such cloud-based services is crucial for both the service providers and service consumers. As SLAs are critical for cloud deployments and wider adoption of cloud services, the management of SLAs in cloud and IoT has thus become an important and essential aspect. This paper investigates the existing research on the management of SLAs in IoT applications that are based on cloud services. For this purpose, a systematic mapping study (a well-defined method) is conducted to identify the published research results that are relevant to SLAs. This paper identifies 328 primary studies and categorizes them into seven main technical classifications: SLA management, SLA definition, SLA modeling, SLA negotiation, SLA monitoring, SLA violation and trustworthiness, and SLA evolution. This paper also summarizes the research types, research contributions, and demographic information in these studies. The evaluation of the results shows that most of the approaches for managing SLAs are applied in academic or controlled experiments with limited industrial settings rather than in real industrial environments. Many studies focus on proposal models and methods to manage SLAs, and there is a lack of focus on the evolution perspective and a lack of adequate tool support to facilitate practitioners in their SLA management activities. Moreover, the scarce number of studies focusing on concrete metrics for qualitative or quantitative assessment of QoS in SLAs urges the need for in-depth research on metrics definition and measurements for SLAs.
Secure and Efficient Cloud Data Deduplication With Randomized Tag

Cross-client data deduplication has been widely used to eliminate redundant storage overhead in cloud storage system. Recently, Abadi et al. introduced the primitive of MLE2 with nice security properties for secure and efficient data deduplication. However, besides the computationally expensive noninteractive zero-knowledge proofs, their fully randomized scheme (R-MLE2) requires the inefficient equality-testing algorithm to identify all duplicate ciphertexts. Thus, an interesting challenging problem is how to reduce the overhead of R-MLE2 and propose an efficient construction for R-MLE2. In this paper, we introduce a new primitive called μR-MLE2, which gives a partial positive answer for this challenging problem. We propose two schemes: static scheme and dynamic scheme, where the latter one allows tree adjustment by increasing some computation cost. Our main trick is to use the interactive protocol based on static or dynamic decision trees. The advantage gained from it is, by interacting with clients, the server will reduce the time complexity of deduplication equality test from linear time to efficient logarithmic time over the whole data items in the database. The security analysis and the performance evaluation show that our schemes are Path-PRV-CDA2 secure and achieve several orders of magnitude higher performance for data equality test than R-MLE2 scheme when the number of data items is relatively large.
A Compositional Theory of Refinement for Branching Time

I develop a compositional theory of refinement for the branching time framework based on stuttering simulation and prove that if one system refines another, then a refinement map always exists. The existence of refinement maps in the linear time framework was studied in an influential paper by Abadi and Lamport. My interest in proving analogous results for the branching time framework arises from the observation that in the context of mechanical verification, branching time has some important advantages. By setting up the refinement problem in a way that differs from the Abadi and Lamport approach, I obtain a proof of the existence of refinement maps (in the branching time framework) that does not depend on any of the conditions found in the work of Abadi and Lamport e.g., machine closure, finite invisible nondeterminism, internal continuity, the use of history and prophecy variables, etc. A direct consequence is that refinement maps always exist in the linear time framework, subject only to the use of prophecy-like variables.
Cheat-Proofing Dead Reckoned Multiplayer Games (Extended Abstract)

THE multiplayer game (MPG) market is segmented into a handful of readily identifiable genres, the most popular being first-person shooters, realtime strategy games, and role-playing games. First-person shooters (FPS) such as Quake [11], Half-Life [17], and Unreal Tournament [9] are fast-paced conflicts between up to thirty heavily armed players. Players in realtime strategy (RTS) games like Command & Conquer [19], StarCraft , and Age of Empires [18] or role-playing game (RPG) such as Diablo II [7] command tens or hundreds of units in battle against up to seven other players. Persistent virtual worlds such as Ultima Online [2], Everquest , and Lineage  encompass hundreds of thousands of players at a time (typically served by multiple servers). Cheating has always been a problem in computer games, and when prizes are involved can become a contractual issue for the game service provider. Here we examine a cheat where players lie about their network latency (and therefore the amount of time they have to react to their opponents) to see into the future and stay
Development of easily wearable assistive device with elastic exoskeleton for paralyzed hand

Numerous robotic devices have been developed to assist hand rehabilitation; however, a majority of these are difficult for stroke survivors to wear. The purpose of this study was to develop an assistive device for treating flexion contracture, which supports the extension of each finger and may easily be worn on a paralyzed hand. To facilitate ease of use, we suggested a new wearing method for this wire-driven device with an elastic skeleton, allowing users to extend the device from the back of the hand onto the fingertip. The functional capacity of this device was measured through fingertip contact force and estimations of supporting torque. Results showed the device provides sufficient torque for finger extension with controlled wire tension. Moreover, experimental results confirmed that the novel design significantly decreased the time it took users to don the device compared to other designs.