nils-herrmann/clean_scirepeval huggingface dataset:
The Automated Fairing of Ship Hull Lines Using Formal Optimisation Methods

The problem of creating fair ship design curves is of major importance in Computer Aided Ship Design environment. The fairness of these curves is generally considered a subjective notion depending on the judgement of the designer (eg., visually pleasing, minimum variation of curvature, devoid of unnecessary bumps or wiggles, satisfying certain continuity requirements). Thus an automated fairing process based on objective criteria is clearly desirable. This paper presents an automated fairing algorithm for ship curves to satisfy objective geometric constraints. This procedure is based on the use of optimisation tools and cubic B-spline functions. The aim is to produce curves with a more gradual variation of curvature without deteriorating initial shapes. The optimisation based fairing procedure is applied to a variety of plane ship sections to demonstrate the capability and flexibility of the methodology. The resulting curves, with their corresponding curvature plots indicate that, provided that the designer can specify his objectives and constraints clearly, the procedure will generate fair ship definition curves within the constrained design space.
Charity auctions on social networks

Charitable giving is influenced by many social, psychological, and economic factors. One common way to encourage individuals to donate to charities is by offering to match their contribution (often by their employer or by the government). Conitzer and Sandholm introduced the idea of using auctions to allow individuals to offer to match the contribution of others. We explore this idea in a social network setting, where individuals care about the contribution of their neighbors, and are allowed to specify contributions that are conditional on the contribution of their neighbors.
 We give a mechanism for this setting that raises the largest individually rational contributions given the conditional bids, and analyze the equilibria of this mechanism in the case of linear utilities. We show that if the social network is strongly connected, the mechanism always has an equilibrium that raises the maximum total contribution (which is the contribution computed according to the true utilities); in other words, the price of stability of the game defined by this mechanism is one. Interestingly, although the mechanism is not dominant strategy truthful (and in fact, truthful reporting need not even be a Nash equilibrium of this game), this result shows that the mechanism always has a full-information equilibrium which achieves the same outcome as in the truthful scenario. Of course, there exist cases where the maximum total contribution even with true utilities is zero: we show that the existence of non-zero equilibria can be characterized exactly in terms of the largest eigenvalue of the utility matrix associated with the social network.
Parallelized Flower Pollination Algorithm with a Communication Strategy

Parallel processing is an essential requirement for optimum computations in modern equipment. In this paper, a communication strategy for the parallelized Flower Pollination Algorithm is proposed for solving numerical optimization problems. In this proposed method, the population flowers are split into several independent groups based on the original structure of the Flower Pollination Algorithm (FPA), and the proposed communication strategy provides the information flow for the flowers to communicate in different groups. Four benchmark functions are used to test the behavior of convergence, the accuracy, and the speed of the proposed method. According to the experimental result, the proposed communicational strategy increases the accuracy of the FPA on finding the best solution is up to 78% in comparison with original method.
A decision-support method for water resource projects allocation at the city scale

This research aims at providing a decision-support method for the government and the public of their water resource projects allocation. The Water Poverty Index (WPI) is introduced to evaluate the extent of water supply shortage, and the WPI driving factors of each evaluated unit are analyzed using the Least Square Error (LSE) method. Then 32 types of water-supply related projects are organized by their contribution to WPI components. This paper provides a method to calculate a decision matrix bases on the results of WPI driving factor analysis and 32 types of water resource projects. The result of decision matrix calculation can be visualized to illustrate suggestions for the government and the public that which projects are most effective for a certain administrative unit. Qianjiang district, a mountainous poverty district in Chongqing city, southwest of China, is chosen as the study case in this research.
The Impact of Soft Resource Allocation on n-Tier Application Scalability

Good performance and efficiency, in terms of high quality of service and resource utilization for example, are important goals in a cloud environment. Through extensive measurements of an n-tier application benchmark (RUBBoS), we show that overall system performance is surprisingly sensitive to appropriate allocation of soft resources (e.g., server thread pool size). Inappropriate soft resource allocation can quickly degrade overall application performance significantly. Concretely, both under-allocation and over-allocation of thread pool can lead to bottlenecks in other resources because of non-trivial dependencies. We have observed some non-obvious phenomena due to these correlated bottlenecks. For instance, the number of threads in the Apache web server can limit the total useful throughput, causing the CPU utilization of the C-JDBC clustering middleware to decrease as the workload increases. We provide a practical iterative solution approach to this challenge through an algorithmic combination of operational queuing laws and measurement data. Our results show that soft resource allocation plays a central role in the performance scalability of complex systems such as n-tier applications in cloud environments.
MEMO_Calendring: A smart reminder for Alzheimer's disease patients

From the earliest stages, Alzheimer's causes memory impairments leading to perturbations on everyday life functioning. To improve autonomy, we introduce MEMO_Calendring, a smart reminder to help Alzheimer's disease patients organize their daily life e.g., reminding the user to take the correct medicines on time. This intervention is proposed in the context of the ongoing CAPTAIN MEMO memory aid. Compared to related work, this intervention has four main advantages. (1) It automatically generates some additional helpful information about the scheduled events e.g., displaying the address of a place, the user needs to go to. (2) It is designed to be facile and pleasant to use. (3) It supports natural language inputs. (4) It supports multilingualism: French, Arabic and English. We evaluated the accessibility of the user interfaces of the CAPTAIN MEMO memory aid, including the MEMO_Calendring smart reminder, with 24 Alzheimer's disease patients. The preliminary results confirmed that the presented user interfaces are accessible and user-friendly.
Communication in multiplayer gaming: Examining player responses to gender cues

The goal of this study is to determine how gamers’ reactions to male voices differ from reactions to female voices. The authors conducted an observational study with an experimental design to play in and record multiplayer matches (N = 245) of a video game. The researchers played against 1,660 unique gamers and broadcasted pre-recorded audio clips of either a man or a woman speaking. Gamers’ reactions were digitally recorded, capturing what was said and heard during the game. Independent coders were used to conduct a quantitative content analysis of game data. Findings indicate that, on average, the female voice received three times as many negative comments as the male voice or no voice. In addition, the female voice received more queries and more messages from other gamers than the male voice or no voice.
A Study of Automatically Acquiring Explanatory Inference Patterns from Corpora of Explanations : Lessons from Elementary Science Exams

Our long term interest is in building inference algorithms capable of answering questions and producing human-readable explanations by aggregating information from multiple sources and knowledge bases. Currently information aggregation (also referred to as “multi-hop inference”) is challenging for more than two facts due to “semantic drift”, or the tendency for natural language inference algorithms to quickly move off-topic when assembling long chains of knowledge. In this paper we explore the possibility of generating large explanations with an average of six facts by automatically extracting common explanatory patterns from a corpus of manually authored elementary science explanations represented as lexically-connected explanation graphs grounded in a semi-structured knowledge base of tables. We empirically demonstrate that there are sufficient common explanatory patterns in this corpus that it is possible in principle to reconstruct unseen explanation graphs by merging multiple explanatory patterns, then adapting and/or adding to their knowledge. This may ultimately provide a mechanism to allow inference algorithms to surpass the two-fact “aggregation horizon” in practice by using common explanatory patterns as constraints to limit the search space during information aggregation.
Exploration of efficient symmetric algorithms

Security threats have been a major concern as a result of emergence of technology in every aspect including internet market, computational and communication technologies. To solve this issue effective mechanism of “cryptography” is used to ensure integrity, privacy, availability, authentication, computability, identification and accuracy. Cryptology techniques like PKC and SKC are used of data recovery. In current work, we describe exploration of efficient approach of private key architecture on the basis of attributes: effectiveness, scalability, flexibility, reliability and degree of security issues essential for safe wired and wireless communication. The work explores efficient private key algorithm based on security of individual system and scalability under criteria of memory-cpu utilization together with encryption performance. The exploration results in AES as superior over other algorithm. The work opens a new direction over cloud security and internet of things.
A neurocognitive perspective on language: The declarative/procedural model

What are the psychological, computational and neural underpinnings of language? Are these neurocognitive correlates dedicated to language? Do different parts of language depend on distinct neurocognitive systems? Here I address these and other issues that are crucial for our understanding of two fundamental language capacities: the memorization of words in the mental lexicon, and the rule-governed combination of words by the mental grammar. According to the declarative/procedural model, the mental lexicon depends on declarative memory and is rooted in the temporal lobe, whereas the mental grammar involves procedural memory and is rooted in the frontal cortex and basal ganglia. I argue that the declarative/procedural model provides a new framework for the study of lexicon and grammar.
Impact of smoking on experimental gingivitis. A clinical, microbiological and immunological prospective study.

The present study assessed the effect of smoking on clinical, microbiological and immunological parameters in an experimental gingivitis model.



Twenty-four healthy dental students were divided into two groups: smokers (n = 10); and nonsmokers (n = 14). Stents were used to prevent biofilm removal during brushing. Visible plaque index (VPI) and gingival bleeding index (GBI) were determined 5- on day -7 (running phase), baseline, 21 d (experimental gingivitis) and 28 d (resolution phase). Supragingival biofilm and gingival crevicular fluid were collected and assayed by checkerboard DNA-DNA hybridization and a multiplex analysis, respectively. Intragroup comparison was performed by Friedman and Dunn's multiple comparison tests, whereas the Mann-Whitney U-test was applied for intergroup analyses.



Cessation of oral hygiene resulted in a significant increase in VPI, GBI and gingival crevicular fluid volume in both groups, which returned to baseline levels 7 d after oral hygiene was resumed. Smokers presented lower GBI than did nonsmokers (p < 0.05) at day 21. Smokers had higher total bacterial counts and higher proportions of red- and orange complex bacteria, as well as lower proportions of Actinomyces spp., and of purple- and yellow-complex bacteria (p < 0.05). Furthermore, the levels of key immune-regulatory cytokines, including interleukin (IL)-8, IL-17 and interferon-γ, were higher in smokers than in nonsmokers (p < 0.05).



Smokers and nonsmokers developed gingival inflammation after supragingival biofilm accumulation, but smokers had less bleeding, higher proportions of periodontal pathogens and distinct host-response patterns during the course of experimental gingivitis.
Normalizing facial ratios in apert syndrome patients with Le Fort II midface distraction and simultaneous zygomatic repositioning.

Le Fort III distraction advances the Apert midface but leaves the central concavity and vertical compression untreated. The authors propose that Le Fort II distraction and simultaneous zygomatic repositioning as a combined procedure can move the central midface and lateral orbits in independent vectors in order to improve the facial deformity. The purpose of this study was to determine whether this segmental movement results in more normal facial proportions than Le Fort III distraction.



Computed tomographic scan analyses were performed before and after distraction in patients undergoing Le Fort III distraction (n = 5) and Le Fort II distraction with simultaneous zygomatic repositioning (n = 4). The calculated axial facial ratios and vertical facial ratios relative to the skull base were compared to those of unoperated Crouzon (n = 5) and normal (n = 6) controls.



With Le Fort III distraction, facial ratios did not change with surgery and remained lower (p < 0.01; paired t test comparison) than normal and Crouzon controls. Although the face was advanced, its shape remained abnormal. With the Le Fort II segmental movement procedure, the central face advanced and lengthened more than the lateral orbit. This differential movement changed the abnormal facial ratios that were present before surgery into ratios that were not significantly different from normal controls (p > 0.05).



Compared with Le Fort III distraction, Le Fort II distraction with simultaneous zygomatic repositioning normalizes the position and the shape of the Apert face.



Therapeutic, III.
An automata-theoretic approach to branching-time model checking

Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty, making them essentially useless for model-checking. Recently, Bernholtz and Grumberg [1993] have shown that this exponential penalty can be avoided, though they did not match the linear complexity of non-automata-theoretic algorithms. In this paper, we show that alternating tree automata are the key to a comprehensive automata-theoretic framework for branching temporal logics. Not only can they be used to obtain optimal decision procedures, as was shown by Muller et al., but, as we show here, they also make it possible to derive optimal model-checking algorithms. Moreover, the simple combinatorial structure that emerges from the automata-theoretic approach opens up new possibilities for the implementation of branching-time model checking and has enabled us to derive improved space complexity bounds for this long-standing problem.
Cascaded multilevel inverter control considering low harmonic content based on comparison study between firefly and Newton Raphson Algorithm

This paper deals with the control design of an asymmetrical cascaded multilevel inverter. This structure therefore provides the capability to produce higher voltages at higher speeds with low switching frequency which has inherent low switching losses and high converter efficiency. Selective harmonic elimination(SHE) for asymmetrical multilevel CHB inverter control is proposed. The technique utilized in the estimation of switching angles involves Firefly Algorithm (FFA). Compared to Newton Raphson algorithm (NR), FFA is more robust and entails less computation time. Simulation results prove the effectiveness of FFA technique compared to NR algorithm. The proposed method does effectively eliminate a number of specific low order harmonics, and the output voltage is resulted in low total harmonic distortion. FFA and NR algorithm for asymmetrical cascaded H-bridge nine level inverter control are experimentally tested on a prototype using FPGA.
Approximate Undirected Transshipment and Shortest Paths via Gradient Descent

We present a method for solving the transshipment problem—also known as uncapacitated minimum cost flow—up to a multiplicative error of 1 + in undirected graphs with polynomially bounded integer edge weights using a tailored gradient descent algorithm. An important special case of the transshipment problem is the single-source shortest paths (SSSP) problem. Our gradient descent algorithm takes O( −3 polylogn) iterations and in each iteration it needs to solve a variant of the transshipment problem up to a multiplicative error of polylogn. In particular, this allows us to perform a single iteration by computing a solution on a sparse spanner of logarithmic stretch. As a consequence, we improve prior work by obtaining the following results: 1. RAM model: (1+ )-approximate transshipment in Õ( −3(m+n1+o(1))) computational steps1 (leveraging a recent O(m1+o(1))-step O(1)-approximation due to Sherman [2016]). 2. Multipass Streaming model: (1 + )-approximate transshipment and SSSP using Õ(n) space and Õ( −O(1)) passes. 3. Broadcast Congested Clique model: (1 + )-approximate transshipment and SSSP using Õ( −O(1)) rounds. 4. Broadcast Congest model: (1+ )-approximate SSSP using Õ( −O(1)( √ n+D)) rounds, where D is the (hop) diameter of the network. The previous fastest algorithms for the last three models above leverage sparse hop sets. We bypass the hop set computation; using a spanner is sufficient in our method. The above bounds assume non-negative integer edge weights that are polynomially bounded in n; for general non-negative weights, running times scale with the logarithm of the maximum ratio between non-zero weights. 1We use Õ(·) to hide polylogarithmic factors in n. 1 ar X iv :1 60 7. 05 12 7v 1 [ cs .D S] 1 8 Ju l 2 01 6
Implementation of digital IQ imbalance compensation in OFDM WLAN receivers

Although the maximum transmission speed in IEEE 802.11a WLAN is 54 Mbps, the real throughput is actually limited to 20~30 Mbps. Except for the main effect from multi-path, we should also consider some non-ideal effects from imperfect hardware design, such as the IQ imbalance from direct conversion in RF front-end. IQ imbalance is not apparent in lower-order QAM modulation. However, in higher-order QAM modulation, it will become serious interference. In this paper, an IQ imbalance compensation circuit in IEEE802.11a baseband receiver is proposed. A low complexity time-domain compensation algorithm is used to replace the traditional high-order equalizer. MATLAB is used to simulate the whole transceiver including the channel model. After system verification, we use Verilog to implement the IQ imbalance compensation circuit with UMC 0.18 mum CMOS 1p6m technology. Post-layout simulation results show that this scheme contributes to a very robust and easily implemented OFDM WLAN receiver
Ambulatory assessment of human body kinematics and kinetics

Ground reaction force (GRF) measurement is important in the analysis of human body movements. The main drawback of the existing measurement systems is the restriction to a laboratory environment. This study proposes an ambulatory system for assessing the dynamics of ankle and foot, which integrates the measurement of the GRF with the measurement of human body movement. The GRF and the center of pressure (CoP) are measured using two 6D force/moment sensors mounted beneath the shoe. The movement of the foot and the lower leg is measured using three miniature inertial sensors, two rigidly attached to the shoe and one to the lower leg. The proposed system is validated using a force plate and an optical position measurement system as a reference. The results show good correspondence between both measurement systems, except for the ankle power. The root mean square (rms) difference of the magnitude of the GRF over 10 evaluated trials was 0.012 ± 0.001 N/N (mean ± standard deviation), being 1.1 ± 0.1 % of the maximal GRF magnitude. It should be noted that the forces, moments, and powers are normalized with respect to body weight. The CoP estimation using both methods shows good correspondence, as indicated by the rms difference of 5.1± 0.7 mm, corresponding to 1.7 ± 0.3 % of the length of the shoe. The rms difference between the magnitudes of the heel position estimates was calculated as 18 ± 6 mm, being 1.4 ± 0.5 % of the maximal magnitude. The ankle moment rms difference was 0.004 ± 0.001 Nm/N, being 2.3 ± 0.5 % of the maximal magnitude. Finally, the rms difference of the estimated power at the ankle was 0.02 ± 0.005 W/N, being 14 ± 5 % of the maximal power. This power difference is caused by an inaccurate estimation of the angular velocities using the optical reference measurement system, which is due to considering the foot as a single segment. The ambulatory system considers separate heel and forefoot segments, thus allowing an additional foot moment and power to be estimated. Based on the results of this research, it is concluded that the combination of the instrumented shoe and inertial sensing is a promising tool for the assessment of the dynamics of foot and ankle in an ambulatory setting.
Mathematical Backdoors in Symmetric Encryption Systems - Proposal for a Backdoored AES-like Block Cipher

Recent years have shown that more than ever governments and intelligence agencies try to control and bypass the cryptographic means used for the protection of data. Backdooring encryption algorithms is considered as the best way to enforce cryptographic control. Until now, only implementation backdoors (at the protocol/implementation/management level) are generally considered. In this paper we propose to address the most critical issue of backdoors: mathematical backdoors or by-design backdoors, which are put directly at the mathematical design of the encryption algorithm. While the algorithm may be totally public, proving that there is a backdoor, identifying it and exploiting it, may be an intractable problem. We intend to explain that it is probably possible to design and put such backdoors. Considering a particular family (among all the possible ones), we present BEA-1, a block cipher algorithm which is similar to the AES and which contains a mathematical backdoor enabling an operational and effective cryptanalysis. The BEA-1 algorithm (80-bit block size, 120-bit key, 11 rounds) is designed to resist to linear and differential cryptanalyses. A challenge will be proposed to the cryptography community soon. Its aim is to assess whether our backdoor is easily detectable and exploitable or not.