Miracle-dz/UniFAR-FTUs huggingface dataset:
Truthful online double auctions for dynamic mobile crowdsourcing

Stimulating both service users and service providers is of paramount importance to mobile crowdsourcing. A few incentive mechanisms have been proposed, but all of them have focused only on one-sided interactions either among service users or among service providers. For the first time, to the best of our knowledge, we investigate the important two-sided online interactions among service users and service providers in mobile crowdsourcing. We model such interactions as online double auctions, explicitly taking the dynamic nature of both users and providers into account We propose a general framework for the design of truthful online double auctions for dynamic mobile crowdsourcing. The framework is expressive and can work with different price schedules. We propose price-ranked online double auctions with four price schedules to implement the framework, which are suitable for different scenarios. With theoretical analysis and extensive simulations we demonstrate that the proposed auctions are strategy-proof, individual rational, and ensure budget balance.
Self-Help? Examining the Anti-Crime Effectiveness of Citizen Weapon Possession

Abstract This research examines the effects of individual protective weapon carrying on the likelihood of experiencing stranger-precipitated violent victimization. It is widely assumed that people at risk for victimization often arm themselves to counter their risk; thus, a positive association between weapon carrying and victimization should be anticipated but interpreted as spurious. Yet findings from hierarchical modeling of survey data from over 4,000 Seattle residents indicate that weapon carrying increases the odds of subsequent violent victimization, even when controlling for multiple victimization risk factors. Further, the positive effect of weapon carrying is constant across the 100 communities within which survey respondents were nested. Although other predictors of violent victimization demonstrate non-random variability across context, this suggests that even community-level victimization risk factors cannot explain the positive effect of weapon carrying on victimization found here. Implications for citizen-initiated “self-help” are discussed in light of these findings.
Comparing supply-side specifications in models of global agriculture and the food system

This article compares the theoretical and functional specification of production in partial equilibrium (PE) and computable general equilibrium (CGE) models of the global agricultural and food system included in the AgMIP model comparison study. The two model families differ in their scope—partial versus economy-wide—and in how they represent technology and the behavior of supply and demand in markets. The CGE models are “deep” structural models in that they explicitly solve the maximization problem of consumers and producers, assuming utility maximization and profit maximization with production/cost functions that include all factor inputs. The PE models divide into two groups on the supply side: (1) “shallow” structural models, which essentially specify area/yield supply functions with no explicit maximization behavior, and (2) “deep” structural models that provide a detailed activity-analysis specification of technology and explicit optimizing behavior by producers. While the models vary in their specifications of technology, both within and between the PE and CGE families, we consider two stylized theoretical models to compare the behavior of crop yields and supply functions in CGE models with their behavior in shallow structural PE models. We find that the theoretical responsiveness of supply to changes in prices can be similar, depending on parameter choices that define the behavior of implicit supply functions over the domain of applicability defined by the common scenarios used in the AgMIP comparisons. In practice, however, the applied models are more complex and differ in their empirical sensitivity to variations in specification—comparability of results given parameter choices is an empirical question. To illustrate the issues, sensitivity analysis is done with one global CGE model, MAGNET, to indicate how the results vary with different specification of technical change, and how they compare with the results from PE models.
Intravenous vitamin C administration improves quality of life in breast cancer patients during chemo-/radiotherapy and aftercare: results of a retrospective, multicentre, epidemiological cohort study in Germany.

AIM The aim of the study was to evaluate under praxis conditions the safety and efficacy of intravenous (i.v.) vitamin C administration in the first postoperative year of women with breast cancer. PATIENTS AND METHODS Epidemiological multicentre cohort study, including 15 gynaecologists and general practitioners representatively distributed in Germany. Data from 125 breast cancer patients in UICC stages IIa to IIIb were selected for the study. A total of 53 of these patients were treated with i.v. vitamin C (supplied as Pascorbin® 7.5 g) additional to standard tumour therapy for at least 4 weeks (study group) and 72 without this additional therapy (control group). Main outcome measures were efficacy in regard to outcome and severity of disease- or therapy-induced complaints during adjuvant chemo- and radiotherapy and aftercare. RESULTS Comparison of control and study groups revealed that i.v. vitamin C administration resulted in a significant reduction of complaints induced by the disease and chemo-/radiotherapy, in particular of nausea, loss of appetite, fatigue, depression, sleep disorders, dizziness and haemorrhagic diathesis. After adjustment for age and baseline conditions (intensity score before adjuvant therapy, chemotherapy, radiotherapy), the overall intensity score of symptoms during adjuvant therapy and aftercare was nearly twice as high in the control group compared to the study group. No side-effects of the i.v. vitamin C administration were documented. DISCUSSION Oxidative stress and vitamin C deficiency play an important role in the etiology of adverse effects of guideline-based adjuvant chemo-/radiotherapy. Restoring antioxidative capacity by complementary i.v. vitamin C administration helps to prevent or reduce disease-, or therapy-induced complaints in breast cancer patients. CONCLUSION Complementary treatment of breast cancer patients with i.v. vitamin C was shown to be a well tolerated optimization of standard tumour-destructive therapies, reducing quality of life-related side-effects.
Bit-Pragmatic Deep Neural Network Computing

Deep Neural Networks expose a high degree of parallelism, making them amenable to highly data parallel architectures. However, data-parallel architectures often accept inefficiency in individual computations for the sake of overall efficiency. We show that on average, activation values of convolutional layers during inference in modern Deep Convolutional Neural Networks (CNNs) contain 92% zero bits. Processing these zero bits entails ineffectual computations that could be skipped. We propose Pragmatic (PRA), a massively data-parallel architecture that eliminates most of the ineffectual computations on-the-fly, improving performance and energy efficiency compared to state-of-the-art high-performance accelerators [5]. The idea behind PRA is deceptively simple: use serial-parallel shift-and-add multiplication while skipping the zero bits of the serial input. However, a straightforward implementation based on shift-and-add multiplication yields unacceptable area, power and memory access overheads compared to a conventional bit-parallel design. PRA incorporates a set of design decisions to yield a practical, area and energy efficient design. Measurements demonstrate that for convolutional layers, PRA is 4.31$\times$ faster than DaDianNao [5] (DaDN) using a 16-bit fixed-point representation. While PRA requires 1.68$\times$ more area than DaDN, the performance gains yield a 1.70$\times$ increase in energy efficiency in a 65nm technology. With 8-bit quantized activations, PRA is 2.25$\times$ faster and 1.31$\times$ more energy efficient than an 8-bit version of DaDN. CCS CONCEPTS • Computing methodologies $\rightarrow$ Machine learning; Neural networks; • Computer systems organization $\rightarrow$ Single instruction, multiple data; • Hardware $\rightarrow$ Arithmetic and datapath circuits;
The Calculation of Language Lateralization Indices in Post-stroke Aphasia: A Comparison of a Standard and a Lesion-Adjusted Formula

Background: The language lateralization index (LI) is a valuable tool in functional magnetic resonance imaging (fMRI) research, especially in people with post-stroke aphasia. However, there is inconsistent consideration for the overlap of lesions with regions of interest (ROIs). The purpose of this study was to determine whether standard LI (SLI) and lesion-adjusted LI (LALI) formulae generate different LI values and language lateralization classification for people with post-stroke chronic aphasia. Methods: SLI and LALI were calculated for an event-related (overt) verb generation task in an anterior and a posterior language ROI. Twelve people with aphasia due to a single left-hemispheric infarct (11 right-handed; 1 left-handed; 77.2 ± 41.7 months post-stroke) were included (eight females; 57 ± 8.88 years). Spearman correlation coefficients and intraclass correlation coefficients were calculated to determine the relationship of the LI values generated by the SLI and the LALI formulas. Fischer’s exact test and a weighted Cohen’s Kappa determined the difference in language lateralization classification and agreement in the classification. Spearman correlation was used to examine the relationship between the difference in lateralization values produced by the LALI and SLI calculations with (1) lesion size, (2) the percentage of lesion overlap in each ROI, and (3) aphasia severity. Results: The two calculation methods were highly correlated and produced similar LI Values, yet yielded significantly different classification for language lateralization. Further, a more leftward LI resulted from application of the LALI formula in 10 participants, in either the anterior ROI (n = 3) or the posterior ROI (n = 7). Finally, for the posterior ROI only, significant correlations were revealed between the two calculation methods and the (1) lesion size and (2) percent of overlap with the ROI. Discussion: While both approaches produce highly correlated LI values, differences in activation lateralization between formulas were observed, including changes in lateralization classification. Examination of the issues raised in the current investigation need to be replicated with a larger sample to determine the utility of a LALI formula in predicting behavioral performance; the findings may have implications for understanding and interpreting fMRI data of people with post-stroke aphasia.
Heuristics for offset assignment in embedded processors

This thesis deals with the optimization of program size and performance in current generation embedded digital signal processors (DSPs) by the design of optimal memory layouts for data. Given the tight constraints on the size, power consumption, cost and performance of these processors, the minimization of the code size in terms of the number of instructions required and the associated reduction in execution time are important. Several DSPs provide limited addressing modes and the layout of data, known as offset assignment, plays a critical role in determining the code size and performance. Even the simplest variant of the offset assignment problem is NP-complete. Research effort in this area has focused on the design, implementation and evaluation of effective heuristics for several variants of the offset assignment problem. One of the most important factors in the determination of the size, and hence, the execution time of a code is the number of instructions required to access the variables stored in the processor memory. The indirect addressing mode common in DSPs requires memory accesses to be realized through address registers that hold the address of the memory location to be accessed. The architecture provides instructions for adding to and subtracting from the values of the address registers to compute the addresses of subsequent data that need to be accessed. In addition, some DSP processors include multiple memory banks that allow increased parallelism in memory access. Proper partitioning of variables across memory banks is critical to effectively using the increased parallelism. The work reported in this thesis aims to evolve efficient methods for designing memory layouts under the conditions of availability of one address register (SOA) or of
Solving maximum cut problems by simulated annealing

This paper gives a straightforward implementation of simulated annealing for solving maximum cut problems and compares its performance to that of some existing heuristic solvers. The formulation used is classical, dating to a 1989 paper of Johnson, Aragon, McGeoch, and Schevon. This implementation uses no structure peculiar to the maximum cut problem, but its low per-iteration cost allows it to find better solutions than were previously known for 40 of the 89 standard maximum cut instances tested within a few minutes of computation.
On shaping complex lattice constellations from multi-level constructions

Constructions of lattices are known to have a strong connection to the study of classical linear codes over F2; one such celebrated construction is that of Barnes-Wall (BW) lattices over Z[i], with i = √-1, wherein weighted sum of nested Reed-Muller codes over powers of the base 1 + i leads to the famous multi-level construction of BW lattices. Although these constructions facilitate simple encoding and decoding of information bits, the resulting codewords need to be mapped onto their representatives in order to reduce the average energy of the lattice code. Drawing inspirations from the case of BW lattices, in this work, we address a general question of how to arrive at representatives of the codewords of a lattice code over Ζ[θ], where θ is a quadratic integer, that is generated via a multi-level construction over linear codes over Fg, for q > 2. In particular, we introduce a novel shaping function τ : Ζ[θ] → Ζ[θ] on the components of lattice codewords, and prove that the natural constellation of lattices from multi-level constructions can be rearranged into a multi-dimensional cube or parallelepiped under such a map. We demonstrate numerically that our mapping results in a reduction of the average energy of lattice constellations. Our proposed mapping has applications in communications, particularly in encoding and decoding of lattice codes from multi-level constructions over q-ary linear codes.
EXAMINATION OF A SUBTLE ENERGY TRANSDUCTION DEVICE ON ANXIETY LEVELS OF STUDENTS IN A PUBLIC SCHOOL SETTING:The Clarus QLink ClearWave

This study examines the effects of the Clarus QLink ClearWave, a subtle energy transduction device, on anxiety levels ofstudents and teachers in a public school setting. Since anxiety may be caused by exposure to electromagnetic fields (EMFs), it is thought that by decreasing EMFs in the environment, anxiety in turn may be reduced. Quantitative measures used were the State-Trait Anxiety Inventory and the State-Trait Anxiety Inventory for Children. Findings indicate statistically significant differences (at p < .08) of state anxiety levels for students in the treatment condition group. No statistically significant differences were found for trait anxiety levels between the treatment and control conditions. Concl
Optimizing Data Partitioning for Data-Parallel Computing

Performance of data-parallel computing (e.g., MapReduce, DryadLINQ) heavily depends on its data partitions. Solutions implemented by the current state of the art systems are far from optimal. Techniques proposed by the database community to find optimal data partitions are not directly applicable when complex user-defined functions and data models are involved. We outline our solution, which draws expertise from various fields such as programming languages and optimization, and present our preliminary results.
Behavioral buffers on the effect of negativity on marital satisfaction: A longitudinal study.

A 2-year longitudinal study of newlyweds was conducted to explore the connection between negativity and satisfaction as a function of (a) the extent to which spouses create an atmosphere of friendliness (as indexed by the degree to which they are affectionally expressive) and (b) the reported extent to which they try to accommodate to each other's needs and work toward maintaining the quality of their relationship. Data concerning marital behavior (negativity, affectional expression, and maintenance) and marital satisfaction were gathered from 105 pairs of spouses on three occasions spaced approximately a year apart. Hierarchical regressions with the concurrent data revealed that affectional expression and maintenance appear to buffer the impact of husbands' negativity on wives' satisfaction. The buffering hypothesis was not supported, however, when wives' behavior was used to account for husbands' satisfaction. Consistent with the buffering hypothesis, the decline in wives' satisfaction associated with husbands' negativity was less great when husbands exhibited relatively high levels of affectional expression. Declines in husbands' level of satisfaction, in contrast, could not be predicted by wives' initial levels of negativity, considered alone, or in combination with either their level of affectional expression or maintenance behavior.
The Reliability and Validity of a Campus Caring Instrument Developed for Undergraduate Students in Hong Kong

This study validated a Perceived Campus Caring Scale with 1,520 university students. Using factor analysis, seven factors namely, Faculty Support, Nonfaculty Support, Peer Relationship, Sense of Detachment, Sense of Belonging, Caring Attitude, and Campus Involvement, are identified with high reliability, validity, and close correlation with the Satisfaction With Life Scale.
Programmable Force Fields for Distributed Manipulation, with Applications to MEMS Actuator Arrays and Vibratory Parts Feeders

Programmable force vector fields can be used to control a variety of flexible planar parts feeders such as massively parallel microactuator arrays or transversely vibrating (macroscopic) plates. These new automation designs promise great flexibility, speed, and dexterity—we believe they may be employed to position, orient, singulate, sort, feed, and assemble parts. However, since they have only recently been invented, programming and controlling them for manipulation tasks is challenging. When a part is placed on our devices, the programmed vector field induces a force and moment upon it. Over time, the part may come to rest in a dynamic equilibrium state. By chaining sequences of force fields, the equilibrium states of a part in the field may be cascaded to obtain a desired final state. The resulting strategies require no sensing, and enjoy efficient planning algorithms. This paper begins by describing new experimental devices that can implement programmable force fields. In particular, we describe our progress in building the M-CHIP (Manipulation CHIP), a massively parallel array of programmable micromotion pixels. Both the M-CHIP and other microarray devices, as well as macroscopic devices such as transversely vibrating plates, may be programmed with vector fields, and their behavior predicted and controlled using our equilibrium analysis. We demonstrate lower bounds (i.e., impossibility results) on what the devices cannot do, and results on a classification of control strategies yielding design criteria by which well-behaved manipulation strategies may be developed. We provide sufficient conditions for programmable fields to induce well-behaved equilibria on every part placed on our devices. We define composition operators to build complex strategies from simple ones, and show the resulting fields are also well behaved. We discuss whether fields outside this class can be useful and free of pathology. Using these tools, we describe new manipulation algorithms. In particular, we improve existing planning algorithms by a quadratic factor, and the plan length by a linear factor. Using our new and improved strategies, we show how to simultaneously orient and pose any part, without sensing, from an arbitrary initial configuration. We relax earlier dynamic and mechanical assumptions to obtain more robust and flexible strategies. Finally, we consider parts feeders that can only implement a very limited ”vocabulary” of vector fields (as opposed to the pixel-wise programmability assumed above). We show how to plan and execute parts posing and orienting strategies for these devices, but with a significant increase in planning complexity and some sacrifice in completeness guarantees. We discuss the trade-off between mechanical complexity and planning complexity.
Long-Term Results of Radiofrequency Volumetric Tissue Reduction of the Palate for Snoring

To assess the long-term efficacy and morbidity of radiofrequency volumetric tissue reduction (RFVTR) of the soft palate for snoring, we examined the medical records of 39 patients who received this treatment at an academic medical center. Telephone interviews were conducted with the patients to evaluate the long-term subjective efficacy and sequelae. The average follow-up was 14 months (range, 3 to 26 months). Twenty-eight patients (72%) responded to treatment, defined as a 4-point decrease on a 10-point scale. The self-reported snoring score decreased an average of 52% (8.8 ± 1.9 to 4.2 ± 2.9). Sixty-seven percent of the patients were satisfied. The response to treatment did not always correlate with patient satisfaction. The snoring relapse rate was 11% among responders. No significant differences were identified between responders and nonresponders. No significant complications or long-term sequelae were observed. We conclude that RFVTR of the palate is a relatively safe and effective long-term treatment for snoring. Defining realistic pretreatment expectations is important in maximizing patient satisfaction.