Miracle-dz/UniFAR-FTUs huggingface dataset:
Overcoming the limitations of conventional vector processors

Despite their superior performance for multimedia applications, vector processors have three limitations that hinder their widespread acceptance. First, the complexity and size of the centralized vector register file limits the number of functional units. Second, precise exceptions for vector instructions are difficult to implement. Third, vector processors require an expensive on-chip memory system that supports high bandwidth at low access latency. We introduce CODE, a scalable vector microarchitecture that addresses these three shortcomings. It is designed around a clustered vector register file and uses a separate network for operand transfers across functional units. With extensive use of decoupling, it can hide the latency of communication across functional units and provides 26% performance improvement over a centralized organization. CODE scales efficiently to 8 functional units without requiring wide instruction issue capabilities. A renaming table makes the clustered register file transparent at the instruction set level. Renaming also enables precise exceptions for vector instructions at a performance loss of less than 5%. Finally, decoupling allows CODE to tolerate large increases in memory latency at sublinear performance degradation without using on-chip caches. Thus, CODE can use economical, off-chip, memory systems.
Image Completion by Diffusion Maps and Spectral Relaxation

We present a framework for image inpainting that utilizes the diffusion framework approach to spectral dimensionality reduction. We show that on formulating the inpainting problem in the embedding domain, the domain to be inpainted is smoother in general, particularly for the textured images. Thus, the textured images can be inpainted through simple exemplar-based and variational methods. We discuss the properties of the induced smoothness and relate it to the underlying assumptions used in contemporary inpainting schemes. As the diffusion embedding is nonlinear and noninvertible, we propose a novel computational approach to approximate the inverse mapping from the inpainted embedding space to the image domain. We formulate the mapping as a discrete optimization problem, solved through spectral relaxation. The effectiveness of the presented method is exemplified by inpainting real images, where it is shown to compare favorably with contemporary state-of-the-art schemes.
Managing in polychronic times: Exploring individual creativity and performance in intellectually intensive venues

As competitive pressures mount, firms are attempting to do more with less – and far more quickly. They are downsizing, using teams, and pushing the time to market. These trends promote polychronic behavior in that they require additional variety in the tasks, activities, and roles that individuals must handle simultaneously. Although evidence suggests that creativity and polychronic preferences are positively related, demands for polychronic behavior appear to be defeating – and resisted – in creative venues such as R&D. This paper addresses this apparent disjunction by focusing on the definition of polychronicity, emphasizing the critical role of agency and the need to count as activities the not particularly visible workings of the mind. The paper proposes, in part, that among creative workers, individual creativity is more related to polychronicity than to monochronicity. Further, volition will play a moderating role in that the relationship between creative performance and either chronicity will be stronger the higher personal agency is in choosing tasks and schedules.
Multi-objective Service Similarity Metrics for More Effective Service Engineering Methods (Short Paper)

The usage of single-objective similarity functions in engineering tasks of service-oriented software may reduce their effectiveness, since a single similarity value can be misleading. In particular, a single similarity value cannot be clearly interpreted, since it hides the values of its individual objectives. The state-of-the-art approaches, which use service similarity functions, typically rely on single-objective functions. Going in a complementary direction, we propose the usage of multi-objective functions for calculating service similarity. We formally define such a function and we provide emerging results, which show that the effectiveness of service engineering tasks can be improved by using multi-objective functions.
Changing PM2.5 concentrations in China from 1998 to 2014

Ambient particulate matter air pollution (PM2.5) has been reported as a major pollutant that threatens human health, decreases visibility, and affects the regional and global climate. China, which is among world's most polluted countries of PM2.5, is faced with a severe challenge for PM2.5 mitigation. However, a lack of long-term PM2.5 concentration data on a large spatial scale has hindered comprehensive understanding of spatial and temporal variations of PM2.5 concentrations. Based on the satellite-derived PM2.5 concentration data, we generated maps of PM2.5 concentrations at county level in China. The cartogram and spatial analyst tool in ArcGIS 10.2 are used to visualize the changing temporal and spatial patterns of PM2.5 concentrations.
Dermoscopy: A Useful Tool for the Diagnosis of Angiokeratoma

Angiokeratoma is a rare vascular malformation of the upper dermis that presents clinically as deep red to blue-black in color and tends to take a diverse configuration without self-limiting. Here, we reported dermoscopic findings by two cases of angiokeratoma; solitary angiokeratoma and angiokeratoma circumscriptum. A 24-year-old male presented with a 2-months history of 5 mm sized black colored papule on the right buttock. A dermoscopic pattern characterized by red and dark lacunae, whitish veil covered with scale. A 26-year-old woman presented with multiple, 2~10 mm, dark colored papules on the anterior neck with zosteriform fashion since childhood. A dermoscopic pattern presented by red lacunae intermingled with whitish veil. As a previous report, our two cases was the most common dermoscopic pattern of angiokeratoma; red lacunae and whitish veil. Angiokeratoma is often diagnosed as melanocytic nevi, Spitz nevi, malignant melanomas, pigmented basal cell carcinomas, seborrheic keratoses, dermatofibromas and other vascular lesions including hemangiomas and pyogenic granulomas. However, in the dermoscopic view, these above lesions hardly show red lacunae with whitish veils. Therefore, the dermscopic view is a useful differential method of angiokeratoma.
Licensed under Creative Commons Attribution Cc by Efficient Retrieval of Face Image from Large Scale Database Using Sparse Coding and Reranking

Due to largely mounting of photo sharing in social network services, there is a strong need for large scale content-based face image retrieval which is enabling device for many emerging applications. It is very exigent to find a human face image from large scale database which might hold huge amount of face images of people. Existing methods regulate the location and illumination differences between the faces and abolish background contents while retrieving face images, which leads to decline the important context information. This paper intends to utilize automatically discovered human attributes that contain semantic signs of the face photos to recover large scale content-based face image retrieval. In this paper two methods are used to develop image retrieval in both offline and online stages, they are attribute-enhanced sparse coding (ASC) and attribute-embedded inverted indexing (AEI). Reranking is further used with these two methods to attain significant retrieval outcome. Proposed system exploits automatically discovered human attributes which balance the information loss and attain good retrieval performance compared to existing system.
Anomaly-Based Intrusion Detection using Fuzzy Rough Clustering

It is an important issue for the security of network to detect new intrusion attack and also to increase the detection rates and reduce false positive rates in intrusion detection system (IDS). Anomaly intrusion detection focuses on modeling normal behaviors and identifying significant deviations, which could be novel attacks. The normal and the suspicious behavior in computer networks are hard to predict as the boundaries between them cannot be well defined. We apply the idea of the fuzzy rough c-means (FRCM) to clustering analysis. FRCM integrates the advantage of fuzzy set theory and rough set theory that the improved algorithm to network intrusion detection. The experimental results on dataset KDDCup99 show that our method outperforms the existing unsupervised intrusion detection methods
Force‐length characteristics of the in vivo human gastrocnemius muscle

In this study, the force‐length characteristics of the in vivo medial (GM) and lateral (GL) heads of the human gastrocnemius muscle were estimated from measurements in eight healthy male subjects. This involved: 1) dynamometry‐based measurements of the moment generated during maximal isometric plantar flexion; 2) ultrasound‐based measurements of fascicular length and pennation angle; and 3) ultrasound‐based calculations of moment arm lengths. All measurements were taken over the ankle angle range from 20° of dorsiflexion to 30° of plantar flexion. Tendon forces were calculated by dividing the moments recorded by the muscle moment arm lengths, and fascicular forces were calculated by dividing the tendon forces estimated by the cosine of pennation angle. In the transition from 30° of plantar flexion to 20° of dorsiflexion, the GM muscle fascicular length and force increased linearly from 24 to 39 mm and from 222 to 931 N, respectively. Over the same ankle angle range, the GL muscle fascicular length and force increased linearly from 30 to 47 mm and from 139 to 393 N, respectively. Estimates of the sarcomeric lengths corresponding to the fascicular lengths measured indicated that the two muscles operated in the range 1.4–2.2 μm, below the optimal length region for force generation according to the cross‐bridge mechanism of contraction. These results indicate that the force–length relation of the in vivo human gastrocnemius muscle is limited to the ascending limb of the bell‐shaped force–length curve obtained from experiments on isolated material. Clin. Anat. 16:215–223, 2003. © 2003 Wiley‐Liss, Inc.
GreenOracle: Estimating Software Energy Consumption with Energy Measurement Corpora

Software energy consumption is a relatively new concern for mobile application developers. Poor energy performance can harm adoption and sales of applications. Unfortunately for the developers, the measurement of software energy con-sumption is expensive in terms of hardware and difficult in terms of expertise. Many prior models of software energy consumption assume that developers can use hardware instrumentation and thus cannot evaluate software runningwithin emulators or virtual machines. Some prior modelsrequire actual energy measurements from the previous versions of applications in order to model the energy consumption of later versions of the same application.In this paper, we take a big-data approach to software energy consumption and present a model that can estimate software energy consumption mostly within 10% error (in joules) and does not require the developer to train on energy measurements of their own applications. This model leverages a big-data approach whereby a collection of prior applications’ energy measurements allows us to train, trans-mit, and apply the model to estimate any foreign application’s energy consumption for a test run. Our model is based on the dynamic traces of system calls and CPU utilization.
Single-electron Circuits Performing Dendritic Pattern Formation with Nature-Inspired Cellular Automata

We propose a novel semiconductor device in which electronic-analogue dendritic trees grow on multilayer single-electron circuits. A simple cellular-automaton circuit was designed for generating dendritic patterns by utilizing the physical properties of single-electron devices, i.e. quantum and thermal effects in tunneling junctions. We demonstrate typical operations of the proposed circuit through extensive numerical simulations.
Hybrid Texture Synthesis

Patch-based texture synthesis algorithms produce reasonable results for a wide variety of texture classes. They preserve global structure, but often introduce unwanted visual artifacts along patch boundaries. Pixel-based synthesis algorithms, on the other hand, tend to blur out small objects while maintaining a consistent texture impression, which in return doesn't necessarily resemble the input texture. In this paper, we propose an adaptive and hybrid algorithm. Our algorithm adaptively splits patches so as to use as large as possible patches while staying within a user-defined error tolerance for the mismatch in the overlap region. Using large patches improves the reproduction of global structure. The remaining errors in the overlap regions are eliminated using pixel-based re-synthesis. We introduce an optimized ordering for the re-synthesis of these erroneous pixels using morphological operators, which ensures that every pixel has enough valid (i.e., error-free) neighboring pixels. Examples and comparisons with existing techniques demonstrate that our approach improves over previous texture synthesis algorithms, especially for textures with well-visible, possibly anisotropic structure, such as natural stone wall or scales.
Assessing Patients’ Mastery of the Skills of Cognitive Therapy: Initial Evaluation of the Patient Competencies Scale

ii Acknowledgments. iv Vita . v List of Tables . viii Chapter 1: Introduction . 1 Variability in Outcome Achieved with CT . 3 Socratic Questioning . 6 Patient Skill Development in CT . 9 Assessment of Patient Skills . 10 Skills of Cognitive Therapy Scale . 13 Purpose . 15 Chapter 2: Method . 16 Participants . 16 Measures. 17 Axis I Diagnosis . 17 Depressive Symptom Severity . 17 Patient Competencies in CT Skills . 18 vii Depression Relapse. 20 Socratic Questioning. 20 Procedures . 21 Chapter 3: Results . 22 Validation analyses for the PCS-C and PCS-T . 22 The Factor Structure of the PCS . 22 Detecting Change from Pre to Post Treatment . 23 Differentiating between Patients with MDD and Controls . 24 Correlations with Depression Severity and Related Skills Measures . 24 Predicting Change in Depression Severity . 27 Predicting Risk of Relapse . 31 Socratic Questioning Analyses. 32 Chapter 4: Discussion . 35 Limitations . 42 References . 45 Appendix A: Patient Competencies ScaleClient Version. 51 Appendix B: Patient Competencies ScaleTherapist Version . 55 Appendix C: Tables . 57
Parallel Implementation of the Biorthogonal MRTD Method

The three-dimensional biorthogonal multi-resolution time-domain (Bi-MRTD) method is presented for both free-space and half-space scattering problems. The perfectly matched layer (PML) is used as an absorbing boundary condition. It has been shown that improved numerical-dispersion properties can be obtained with the use of smooth, compactly-supported wavelet functions as the basis, where here we employ the CohenDaubechies-Fouveau (CDF) biorthogonal wavelets. Using a CDF-wavelet expansion, the spatial sampling rate can be reduced considerably compared with the conventional finite difference time domain (FDTD) method − implying that larger targets can be simulated without sacrificing accuracy. The Bi-MRTD is implemented here on a cluster of allocated-memory machines, using the message-passing interface (MPI), such that very large targets can be modeled. Numerical results are compared with analytical ones and with those obtained via the traditional FDTD method.
Genetic Characterization of a Cell Envelope-Associated Proteinase from Lactobacillus helveticus CNRZ32

ABSTRACT A cell envelope-associated proteinase gene (prtH) was identified in Lactobacillus helveticus CNRZ32. TheprtH gene encodes a protein of 1,849 amino acids and with a predicted molecular mass of 204 kDa. The deduced amino acid sequence of the prtH product has significant identity (45%) to that of the lactococcal PrtP proteinases. Southern blot analysis indicates thatprtH is not broadly distributed within L. helveticus. A prtH deletion mutant of CNRZ32 was constructed to evaluate the physiological role of PrtH. PrtH is not required for rapid growth or fast acid production in milk by CNRZ32. Cell surface proteinase activity and specificity were determined by hydrolysis of αs1-casein fragment 1-23 by whole cells. A comparison of CNRZ32 and its prtH deletion mutant indicates that CNRZ32 has at least two cell surface proteinases that differ in substrate specificity.
Cryptographic Accumulators for Authenticated Hash Tables

Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server. Authenticating the hash table functionality, i.e., verifying the correctness of queries answered by the server and ensuring the integrity of the stored data, is crucial because the server, lying outside the administrative control of the client, can be malicious. We design efficient and secure protocols for optimally authenticating (non-)membership queries on hash tables, using cryptographic accumulators as our basic security primitive and applying them in a novel hierarchical way over the stored data. We provide the first construction for authenticating a hash table with constant query cost and sublinear update cost, strictly improving upon previous methods. Our first solution, based on the RSA accumulator, allows the server to provide a proof of integrity of the answer to a membership query in constant time and supports updates in O (nǫ log n) time for any fixed constant 0 < ǫ < 1, yet keeping the communication and verification costs constant. It also lends itself to a scheme that achieves different trade-offs—namely, constant update time and O(nǫ) query time. Our second solution uses an accumulator that is based on bilinear pairings to achieve O(nǫ) update time at the server while keeping all other complexities constant. Both schemes apply to two concrete data authentication models and an experimental evaluation shows good scalability. A preliminary version of this work was presented at the 15th ACM Conference on Computer and Communications Security (CCS), Alexandria, VA, 2008. Department of Computer Science, Brown University. Email: cpap@cs.brown. edu. Department of Computer Science, Brown University. Email: rt@cs.brown. edu. Department of Computer Science, Boston University and Department of Computer Science, Brown University. Email: nikos@cs.bu. edu. Research performed primarily while the author was with the Department of Computer Science at Aarhus University, Denmark.
A framework for reducing the cost of instrumented code

Instrumenting code to collect profiling information can cause substantial execution overhead. This overhead makes instrumentation difficult to perform at runtime, often preventing many known offline feedback-directed optimizations from being used in online systems. This paper presents a general framework for performing instrumentation sampling to reduce the overhead of previously expensive instrumentation. The framework is simple and effective, using code-duplication and counter-based sampling to allow switching between instrumented and non-instrumented code. Our framework does not rely on any hardware or operating system support, yet provides a high frequency sample rate that is tunable, allowing the tradeoff between overhead and accuracy to be adjusted easily at runtime. Experimental results are presented to validate that our technique can collect accurate profiles (93-98% overlap with a perfect profile) with low overhead (averaging 6% total overhead with a naive implementation). A Jalape~ no-specific optimization is also presented that reduces overhead further, resulting in an average total overhead of 3%.
Correction: AAA-ATPase FIDGETIN-LIKE 1 and Helicase FANCM Antagonize Meiotic Crossovers by Distinct Mechanisms

The sixth author's name is spelled incorrectly. The correct name is: Afef Lemhemdi. The correct citation is: Girard C, Chelysheva L, Choinard S, Froger N, Macaisne N, Lemhemdi A, et al. (2015) AAA-ATPase FIDGETIN-LIKE 1 and Helicase FANCM Antagonize Meiotic Crossovers by Distinct Mechanisms. PLoS Genet 11(7): e1005369. doi:10.1371/journal.pgen. 1005369
Systematic construction of exact magnetohydrodynamic models for astrophysical winds and jets

By a systematic method we construct general classes of exact and self-consistent axisymmetric magnetohydrodynamic (MHD) solutions describing flows that originate in the near environment of a central gravitating astrophysical object. The unifying scheme contains two large groups of exact MHD outflow models: (I) meridionally self-similar models with spherical critical surfaces; and (II) radially self-similar models with conical critical surfaces. This classification includes known polytropic models, such as the classical Parker description of a stellar wind and the Blandford &38; Payne model of a disc wind; it also contains non-polytropic models, such as those of winds/jets in Sauty &38; Tsinganos, Lima, Tsinganos &38; Priest, and Trussoni, Tsinganos &38; Sauty. Besides the unification of all known cases under a common scheme, several new classes emerge and some are briefly analysed; they could be explored for a further understanding of the physical properties of MHD outflows from various magnetized and rotating astrophysical objects in stellar or galactic systems.
A Linear Programming Heuristic for Optimal Planning

I introduce a new search heuristic for propositional STRIPS planning that is based on transforming planning instances to linear programming instances. The linear programming heuristic is admissible for finding minimum length plans and can be used by partial-order planning algorithms. This heuristic appears to be the first non-trivial admissible heuristic for partial-order planning. An empirical study compares Lplan, a partial-order planner incorporating the heuristic, to Graphplan, Satplan, and UCPOP on the tower of Hanoi domain, random blocks-world instances, and random planning instances. Graphplan is far faster in the study than the other algorithms. Lplan is often slower because the heuristic is time-consuming, but Lplan shows promise because it often perfonns a small search.
On secure communication over the Z-Channel

The discrete memoryless Z-Channel (DM-ZC) with a confidential cross-message is considered. Three messages are transmitted; encoder 1 transmits one message to be decoded by decoder 1. Encoder 2 transmits two messages, the first of them is to be decoded by decoder 2; the second message is to be decoded by decoder 1 and is required to be kept secret from decoder 2. The secrecy level is measured by the equivocation rate. An outer bound on a class of degraded DM-ZC is derived. An achievable secrecy-rate region of a special case of this class is obtained. Finally, a general inner bound for the secrecy-capacity region of the DM-ZC is proposed.