nils-herrmann/clean_scirepeval huggingface dataset:
A new classification of lip zones to customize injectable lip augmentation.

To present a new classification of 15 anatomical lip zones used to direct placement of injectable fillers during lip augmentation and to evaluate the new classification's ability to customize lip contour and size.



Study participants were consecutive patients presenting to a facial plastic and reconstructive surgery practice for injectable lip augmentation with a nonanimal-sourced stabilized hyaluronic acid (Restylane; Medicis Aesthetic Inc, Scottsdale, Arizona). A nonrandomized, prospective case series.



A total of 137 treatments were performed on lips of 66 patients. The mean (SD) satisfaction score was 4.5 (0.6) on an integral scale of 1 (dissatisfied) to 5 (most satisfied). The mean (SD) persistence until lips returned to preoperative appearance based on patient subjective evaluation was 4.9 (1.5) months. Patients were free of adverse effects.



Using a new classification of lip anatomical zones to direct the injection of a nonanimal-sourced stabilized hyaluronic acid has increased my ability to better control lip shape and size in lip augmentation. This technique was met with high patient satisfaction and no adverse effects. Persistence of injected nonanimal-sourced stabilized hyaluronic acid was similar to that seen in other studies.
Modeling and Design of Electronically Tunable Reflectarrays

The reflectarray has significant promise in applications requiring high-gain, low-profile reflectors. Recent advances in tuning technology have raised the possibility of realizing electronically tunable reflectarrays, which can dynamically adjust their radiation patterns. This paper presents an electronically tunable reflectarray based on elements tuned using varactor diodes. Modeling approaches based on an equivalent circuit representation and computational electromagnetics simulations are presented. Both techniques accurately predict the scattering characteristics of the unit cell as compared to experimental measurements. The development of a unit cell with over 320omicron of phase agility at 5.5 GHz is discussed. Finally, a 70-element electronically tunable reflectarray prototype operating at 5.8 GHz is presented. Radiation pattern measurements with the reflectarray demonstrate its dynamic beam-forming characteristics. Measurements of the gain of the reflectarray correlate well with theoretical expectations.
Bridging the Gap Between Forensics and Biometric-Enabled Watchlists for e-Borders

A biometric-enabled watchlist (or a database of persons of interest) is commonly accepted by national and international security agencies. In particular, the facetrait has demonstrated promising performance in large-scale open-set tasks in forensics and law enforcement scenarios. However, their application in the security of mass-transit systems, such as e-borders, is very limited. We evaluate the risks of unwanted effects using Doddington's metric and various databases. The key contribution of this paper is a novel technique for traveler risk categorization using a biometric-enabled watchlist and an evidence-accumulation paradigm, as well as its impact on e-border performance.
Analytical Modeling of Mode Selection and Power Control for Underlay D2D Communication in Cellular Networks

Device-to-device (D2D) communication enables the user equipments (UEs) located in close proximity to bypass the cellular base stations (BSs) and directly connect to each other, and thereby, offload traffic from the cellular infrastructure. D2D communication can improve spatial frequency reuse and energy efficiency in cellular networks. This paper presents a comprehensive and tractable analytical framework for D2D-enabled uplink cellular networks with a flexible mode selection scheme along with truncated channel inversion power control. The developed framework is used to analyze and understand how the underlaying D2D communication affects the cellular network performance. Through comprehensive numerical analysis, we investigate the expected performance gains and provide guidelines for selecting the network parameters.
Multi-Directional Multi-Level Dual-Cross Patterns for Robust Face Recognition

To perform unconstrained face recognition robust to variations in illumination, pose and expression, this paper presents a new scheme to extract “Multi-Directional Multi-Level Dual-Cross Patterns” (MDML-DCPs) from face images. Specifically, the MDML-DCPs scheme exploits the first derivative of Gaussian operator to reduce the impact of differences in illumination and then computes the DCP feature at both the holistic and component levels. DCP is a novel face image descriptor inspired by the unique textural structure of human faces. It is computationally efficient and only doubles the cost of computing local binary patterns, yet is extremely robust to pose and expression variations. MDML-DCPs comprehensively yet efficiently encodes the invariant characteristics of a face image from multiple levels into patterns that are highly discriminative of inter-personal differences but robust to intra-personal variations. Experimental results on the FERET, CAS-PERL-R1, FRGC 2.0, and LFW databases indicate that DCP outperforms the state-of-the-art local descriptors (e.g., LBP, LTP, LPQ, POEM, tLBP, and LGXP) for both face identification and face verification tasks. More impressively, the best performance is achieved on the challenging LFW and FRGC 2.0 databases by deploying MDML-DCPs in a simple recognition scheme.
Wireless caching: technical misconceptions and business barriers

Caching is a hot research topic and poised to develop into a key technology for the upcoming 5G wireless networks. However, the successful implementation of caching techniques crucially depends on joint research developments in different scientific domains such as networking, information theory, machine learning, and wireless communications. Moreover, there are business barriers related to the complex interactions between the involved stakeholders: users, cellular operators, and Internet content providers. In this article we discuss several technical misconceptions with the aim of uncovering enabling research directions for caching in wireless systems. Ultimately, we make a speculative stakeholder analysis for wireless caching in 5G.
Be Conservative: Enhancing Failure Diagnosis with Proactive Logging

When systems fail in the field, logged error or warning messages are frequently the only evidence available for assessing and diagnosing the underlying cause. Consequently, the efficacy of such logging—how often and how well error causes can be determined via postmortem log messages—is a matter of significant practical importance. However, there is little empirical data about how well existing logging practices work and how they can yet be improved. We describe a comprehensive study characterizing the efficacy of logging practices across five large and widely used software systems. Across 250 randomly sampled reported failures, we first identify that more than half of the failures could not be diagnosed well using existing log data. Surprisingly, we find that majority of these unreported failures are manifested via a common set of generic error patterns (e.g., system call return errors) that, if logged, can significantly ease the diagnosis of these unreported failure cases. We further mechanize this knowledge in a tool called Errlog , that proactively adds appropriate logging statements into source code while adding only 1.4% performance overhead. A controlled user study suggests that Errlog can reduce diagnosis time by 60.7%.
Multiresolution genetic clustering algorithm for texture segmentation

This work plans to approach the texture segmentation problem by incorporating genetic algorithm and K-means clustering method within a multiresolution structure. As the algorithm descends the multiresolution structure, the coarse segmentation results are propagated down to the lower levels so as to reduce the inherent class–position uncertainty and to improve the segmentation accuracy. The procedure is described as follows. In the first step, a quad-tree structure of multiple resolutions is constructed. Sampling windows of different sizes are utilized to partition the underlying image into blocks at different resolution levels and texture features are extracted from each block. Based on the texture features, a hybrid genetic algorithm is employed to perform the segmentation. While the select and mutate operators of the traditional genetic algorithm are adopted in this work, the crossover operator is replaced with K-means clustering method. In the final step, the boundaries and the segmentation result of the current resolution level are propagated down to the next level to act as contextual constraints and the initial configuration of the next level, respectively. q 2003 Elsevier B.V. All rights reserved.
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

Multiple antennas can be used for increasing the amount of diversity or the number of degrees of freedom in wireless communication systems. In this paper, we propose the point of view that both types of gains can be simultaneously obtained for a given multiple-antenna channel, but there is a fundamental tradeoff between how much of each any coding scheme can get. For the richly scattered Rayleigh-fading channel, we give a simple characterization of the optimal tradeoff curve and use it to evaluate the performance of existing multiple antenna schemes.
Coping with child sexual abuse among college students and post-traumatic stress disorder: the role of continuity of abuse and relationship with the perpetrator.

The purpose of this study was to examine the effects of child sexual abuse (CSA) on the use of coping strategies and post-traumatic stress disorder (PTSD) scores in young adults, as well as the role of avoidance and approach coping strategies in those PTSD scores in CSA victims. The role of coping strategies was studied by considering their possible interactive effect with the continuity of abuse and the relationship with the perpetrator; the effect of coping strategies on PTSD was also compared between CSA victim and non-CSA victim participants.



The sample was comprised of 138 victims of CSA and another 138 participants selected as a comparison group. Data about child sexual abuse were obtained from a questionnaire developed for this purpose. Coping strategies were assessed with the How I Deal with Things Scale (Burt & Katz, 1987), while PTSD scores were assessed with the "Escala de Gravedad de Síntomas del Trastorno de Estrés Postraumático" (Severity of Symptoms of PTSD Scale; Echeburúa et al., 1997).



Participants who had been victims of CSA showed significantly higher PTSD scores and lower approach coping strategies scores. However, differences in avoidance coping strategies between groups were not consistent and did not always follow the expected direction. Only the use of avoidance coping strategies was related to PTSD, participants who used these showing higher scores. The effects of avoidance strategies were stronger in continued than in isolated abuse, in intrafamilial than in extrafamilial abuse and in CSA victims than in non-victims.



These results confirm the idea of CSA as a high-risk experience that can affect the victim's coping strategies and lead to PTSD to a lesser or greater extent depending on the coping strategy used. Moreover, the role of these strategies varies depending on whether or not the participant is a victim of CSA and on the characteristics of abuse (continuity and relationship with the perpetrator).



In terms of intervention, a reduction of avoidance-type strategies appears to have a beneficial effect, especially in the case of intrafamilial and/or continued CSA victims. The encouragement of "spontaneous" approach strategies (devised by the victim herself, without counseling) would probably not lead to more positive outcomes in terms of PTSD symptomatology. However, encouraging CSA survivors to engage in therapy aimed at developing effective approach strategies, as other studies have suggested, may help reduce PTSD symptoms.
ICTCP: Incast Congestion Control for TCP in Data-Center Networks

TCP incast congestion happens in high-bandwidth and low-latency networks, when multiple synchronized servers send data to a same receiver in parallel . For many important data center applications such as MapReduce[5] and Search, this many-to-one traffic pattern is common. Hence TCP in-cast congestion may severely degrade their performances, e.g., by increasing response time.
 In this paper, we study TCP incast in detail by focusing on the relationship among TCP throughput, round trip time (RTT) and receive window. Different from the previous approach to mitigate the impact of incast congestion by a fine grained timeout value, our idea is to design an ICTCP (Incast congestion Control for TCP) scheme at the receiver side. In particular, our method adjusts TCP receive window proactively before packet drops occur. The implementation and experiments in our testbed demonstrate that we achieve almost zero timeout and high goodput for TCP incast.
Online Learning in Markov Decision Processes with Changing Cost Sequences

In this paper we consider online learning in finite Markov decision processes (MDPs) with changing cost sequences under full and banditinformation. We propose to view this problem as an instance of online linear optimization. We propose two methods for this problem: MD (mirror descent with approximate projections) and the continuous exponential weights algorithm with Dikin walks. We provide a rigorous complexity analysis of these techniques, while providing near-optimal regret-bounds (in particular, we take into account the computational costs of performing approximate projections in MD). In the case of full-information feedback, our results complement existing ones. In the case of bandit-information feedback we consider the online stochastic shortest path problem, a special case of the above MDP problems, and manage to improve the existing results by removing the previous restrictive assumption that the statevisitation probabilities are uniformly bounded away from zero under all policies.
A Review of Software Quality Models for the Evaluation of Software Products

Actually, software products are increasing in a fast way and are used in almost all activities of human life. Consequently measuring and evaluating the quality of a software product has become a critical task for many companies. Several models have been proposed to help diverse types of users with quality issues. The development of techniques for building software has influenced the creation of models to assess the quality. Since 2000 the construction of software started to depend on generated or manufactured components and gave rise to new challenges for assessing quality. These components introduce new concepts such as configurability, reusability, availability, better quality and lower cost. Consequently the models are classified in basic models which were developed until 2000, and those based on components called tailored quality models. The purpose of this article is to describe the main models with their strengths and point out some deficiencies. In this work, we conclude that in the present age, aspects of communications play an important factor in the quality of software.
DeepEdge: A multi-scale bifurcated deep network for top-down contour detection

Contour detection has been a fundamental component in many image segmentation and object detection systems. Most previous work utilizes low-level features such as texture or saliency to detect contours and then use them as cues for a higher-level task such as object detection. However, we claim that recognizing objects and predicting contours are two mutually related tasks. Contrary to traditional approaches, we show that we can invert the commonly established pipeline: instead of detecting contours with low-level cues for a higher-level recognition task, we exploit object-related features as high-level cues for contour detection.
Self-Consistent Trajectory Autoencoder: Hierarchical Reinforcement Learning with Trajectory Embeddings

In this work, we take a representation learning perspective on hierarchical reinforcement learning, where the problem of learning lower layers in a hierarchy is transformed into the problem of learning trajectory-level generative models. We show that we can learn continuous latent representations of trajectories, which are effective in solving temporally extended and multi-stage problems. Our proposed model, SeCTAR, draws inspiration from variational autoencoders, and learns latent representations of trajectories. A key component of this method is to learn both a latent-conditioned policy and a latent-conditioned model which are consistent with each other. Given the same latent, the policy generates a trajectory which should match the trajectory predicted by the model. This model provides a built-in prediction mechanism, by predicting the outcome of closed loop policy behavior. We propose a novel algorithm for performing hierarchical RL with this model, combining model-based planning in the learned latent space with an unsupervised exploration objective. We show that our model is effective at reasoning over long horizons with sparse rewards for several simulated tasks, outperforming standard reinforcement learning methods and prior methods for hierarchical reasoning, model-based planning, and exploration.
Training techniques to improve endurance exercise performances.

In previously untrained individuals, endurance training improves peak oxygen uptake (VO2peak), increases capillary density of working muscle, raises blood volume and decreases heart rate during exercise at the same absolute intensity. In contrast, sprint training has a greater effect on muscle glyco(geno)lytic capacity than on muscle mitochondrial content. Sprint training invariably raises the activity of one or more of the muscle glyco(geno)lytic or related enzymes and enhances sarcolemmal lactate transport capacity. Some groups have also reported that sprint training transforms muscle fibre types, but these data are conflicting and not supported by any consistent alteration in sarcoplasmic reticulum Ca2+ ATPase activity or muscle physicochemical H+ buffering capacity. While the adaptations to training have been studied extensively in previously sedentary individuals, far less is known about the responses to high-intensity interval training (HIT) in already highly trained athletes. Only one group has systematically studied the reported benefits of HIT before competition. They found that >or=6 HIT sessions, was sufficient to maximally increase peak work rate (W(peak)) values and simulated 40 km time-trial (TT(40)) speeds of competitive cyclists by 4 to 5% and 3.0 to 3.5%, respectively. Maximum 3.0 to 3.5% improvements in TT(40) cycle rides at 75 to 80% of W(peak) after HIT consisting of 4- to 5-minute rides at 80 to 85% of W(peak) supported the idea that athletes should train for competition at exercise intensities specific to their event. The optimum reduction or 'taper' in intense training to recover from exhaustive exercise before a competition is poorly understood. Most studies have shown that 20 to 80% single-step reductions in training volume over 1 to 4 weeks have little effect on exercise performance, and that it is more important to maintain training intensity than training volume. Progressive 30 to 75% reductions in pool training volume over 2 to 4 weeks have been shown to improve swimming performances by 2 to 3%. Equally rapid exponential tapers improved 5 km running times by up to 6%. We found that a 50% single-step reduction in HIT at 70% of W(peak) produced peak approximately 6% improvements in simulated 100 km time-trial performances after 2 weeks. It is possible that the optimum taper depends on the intensity of the athletes' preceding training and their need to recover from exhaustive exercise to compete. How the optimum duration of a taper is influenced by preceding training intensity and percentage reduction in training volume warrants investigation.
The sequential maximum angle convex cone ( SMACC ) endmember model

A new endmember extraction method has been developed that is based on a convex cone model for representing vector data. The endmembers are selected directly from the data set. The algorithm for finding the endmembers is sequential: the convex cone model starts with a single endmember and increases incrementally in dimension. Abundance maps are simultaneously generated and updated at each step. A new endmember is identified based on the angle it makes with the existing cone. The data vector making the maximum angle with the existing cone is chosen as the next endmember to add to enlarge the endmember set. The algorithm updates the abundances of previous endmembers and ensures that the abundances of previous and current endmembers remain positive or zero. The algorithm terminates when all of the data vectors are within the convex cone, to some tolerance. The method offers advantages for hyperspectral data sets where high correlation among channels and pixels can impair un-mixing by standard techniques. The method can also be applied as a band-selection tool, finding end-images that are unique and forming a convex cone for modeling the remaining hyperspectral channels. The method is described and applied to hyperspectral data sets.
A framework for cloud-based context-aware information services for citizens in smart cities

In the context of smart cities, public participation and citizen science are key ingredients for informed and intelligent planning decisions and policy-making. However, citizens face a practical challenge in formulating coherent information sets from the large volumes of data available to them. These large data volumes materialise due to the increased utilisation of information and communication technologies in urban settings and local authorities’ reliance on such technologies to govern urban settlements efficiently. To encourage effective public participation in urban governance of smart cities, the public needs to be facilitated with the right contextual information about the characteristics and processes of their urban surroundings in order to contribute to the aspects of urban governance that affect them such as socio-economic activities, quality of life, citizens well-being etc. The cities on the other hand face challenges in terms of crowd sourcing with quality data collection and standardisation, services inter-operability, provisioning of computational and data storage infrastructure. In this paper, we highlight the issues that give rise to these multi-faceted challenges for citizens and public administrations of smart cities, identify the artefacts and stakeholders involved at both ends of the spectrum (data/service producers and consumers) and propose a conceptual framework to address these challenges. Based upon this conceptual framework, we present a Cloud-based architecture for context-aware citizen services for smart cities and discuss the components of the architecture through a common smart city scenario. A proof of concept implementation of the proposed architecture is also presented and evaluated. The results show the effectiveness of the cloud-based infrastructure for the development of a contextual service for citizens.