Miracle-dz/UniFAR-FTUs huggingface dataset:
Tipping the Balance : Towards Fairer Energy Consumption in Groups Connected via Device-to-Device Technologies

By using device-to-device communication capabilities of smartphones, opportunistic networks promise to fill the gap of infrastructure-based networks in remote areas, to support communication in disaster and emergency situations, as well as to enable new local social networking applications. Yet, to become feasible in practice and accepted by the users, it is crucial that opportunistic communication is energy-efficient and that the load on mobile phone batteries is evenly or fairly distributed among users. In this paper, we deal with the imbalance problem of today’s device-to-device communication technologies (Wi-Fi Direct, Bluetooth): the “host” of a connection consumes two to five times more energy than a “client”. For a pair of connected nodes, we have proposed a role switching scheme in previous work, in which we use the distribution of the remaining connection/contact time to derive an appropriate switching interval. Here, we lay the ground work for extending this solution to groups of more than two nodes. We first discuss several potential definitions of a group and its lifetime. Based on these definitions, we analyze the distribution of group lifetime in several real-world traces and show that, similarly to pairwise contact durations, group lifetimes obey a heavy-tailed distribution. Finally, we discuss how to use this generalization to design a role switching scheme for group connections, aimed at achieving a more balanced energy consumption among group members.
Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance

In previous work, we presented rules for defining overloaded functions that ensure type safety under symmetric multiple dispatch in an object-oriented language with multiple inheritance, and we showed how to check these rules without requiring the entire type hierarchy to be known, thus supporting modularity and extensibility. In this work, we extend these rules to a language that supports parametric polymorphism on both classes and functions. In a multiple-inheritance language in which any type may be extended by types in other modules, some overloaded functions that might seem valid are correctly rejected by our rules. We explain how these functions can be permitted in a language that additionally supports an exclusion relation among types, allowing programmers to declare "nominal exclusions" and also implicitly imposing exclusion among different instances of each polymorphic type. We give rules for computing the exclusion relation, deriving many type exclusions from declared and implicit ones. We also show how to check our rules for ensuring the safety of overloaded functions. In particular, we reduce the problem of handling parametric polymorphism to one of determining subtyping relationships among universal and existential types. Our system has been implemented as part of the open-source Fortress compiler.
An experimental and theoretical investigation of combined gas- and water-atomized powder deposition with a diode laser

Functionally graded or composite components (FGCs) have been recognized as having immense potential for many industries. So far, deposition of compositionally graded alloys is the only method that has been shown to be a practical way to produce FGCs. In this work, a second way, that allows graded structures of a single material to be formed by direct metal deposition, is investigated. Simple component samples are built using a diode laser direct metal deposition system with a side feed nozzle and blends of water- and gas-atomized 316L steel powder in varying proportions. Trends in surface finish, wall integrity, and overall wall dimensions are immediately apparent. Further analyses using optical microscopy, x-ray diffraction, and mechanical testing methods show that it is possible to produce differences in physical properties such as tensile strength and hardness across a formed component. The system is modeled and the results discussed in terms of the thermal cycle of the build material.
Voltage source converter MPC with optimized pulse patterns and minimization of integrated squared tracking error

Model predictive control schemes for power electronic applications are characterized by a great variety of problem formulations. In this paper, we consider a three phase voltage source converter with an arbitrary number of voltage levels and derive a model predictive control scheme involving a combination of optimized pulse patterns and the integral of squared predicted tracking error as a cost function. We obtain a nonlinear optimization problem with the switching times as optimization variables, and solve it using gradient projection algorithm. To obtain an easier optimization problem to be solved on-line, a linearization around nominal switching instants is performed bringing the problem to a quadratic programming form. Simulation results demonstrating the performance of the derived scheme are provided for the case of a grid-tied converter with LCL filter.
Performance analysis of beamformers using generalized loading of the covariance matrix in the presence of random steering vector errors

Robust adaptive beamforming is a key issue in array applications where there exist uncertainties about the steering vector of interest. Diagonal loading is one of the most popular techniques to improve robustness. In this paper, we present a theoretical analysis of the signal-to-interference-plus-noise ratio (SINR) for the class of beamformers based on generalized (i.e., not necessarily diagonal) loading of the covariance matrix in the presence of random steering vector errors. A closed-form expression for the SINR is derived that is shown to accurately predict the SINR obtained in simulations. This theoretical formula is valid for any loading matrix. It provides insights into the influence of the loading matrix and can serve as a helpful guide to select it. Finally, the analysis enables us to predict the level of uncertainties up to which robust beamformers are effective and then depart from the optimal SINR.
Wavelet-based built-in damage detection and identification for composites

In this paper, a wavelet-based built-in damage detection and identification algorithm for carbon fiber reinforced polymer (CFRP) laminates is proposed. Lamb waves propagating in laminates are first modeled analytically using higher-order plate theory and compared them with experimental results in terms of group velocity. Distributed piezoelectric transducers are used to generate and monitor the fundamental ultrasonic Lamb waves in the laminates with narrowband frequencies. A signal processing scheme based on wavelet analysis is applied on the sensor signals to extract the group velocity of the wave propagating in the laminates. Combined with the theoretically computed wave velocity, a genetic algorithms (GA) optimization technique is employed to identify the location and size of the damage. The applicability of this proposed method to detect and size the damage is demonstrated by experimental studies on a composite plate with simulated delamination damages.
The carbohydrate moiety of band-3 glycoprotein of human erythrocyte membranes.

Band-3 glycoprotein was purified from human blood-group-A erythrocyte membranes by selective solubilization and gel chromatography on Sepharose 6B in the presence of sodium dodecyl sulphate. The purified glycoprotein was subjected to hydrazinolysis in order to release the carbohydrate moiety. The released oligosaccharides were N-acetylated and applied to a column of DEAE-cellulose. Most of the band-3 oligosaccharides obtained were found to be free of sialic acids. When this neutral fraction was subjected to gel chromatography on a column of Sephadex G-50, two broad peaks were observed indicating that the band-3 glycoprotein was heterogeneous in the size of the oligosaccharide moieties. All fractions from gel chromatography were found to contain galactose, mannose, N-acetylglucosamine and fucose. The higher-molecular-weight (mol.wt. 3000-8000) peak consisted of fucose, mannose, galactose, N-acetylglucosamine and N-acetylgalactosamine in a molar proportion of 1.6:3.0:8.4:10.5:0.2. Most of these oligosaccharides were digested with a mixture of beta-galactosidase and beta-N-acetylhexosaminidase after alpha-L-fucosidase treatment to give a small oligosaccharide with the structure alpha Man2-beta Man-beta GlcNAc-GlcNAc. Methylation studies and limited degradation by nitrous acid deamination showed that the oligosaccharides contained the repeating disaccharide Gal beta 1----4GlcNAc beta 1----3, with branching points at C-6 of some of the galactose residues. These results indicate that a major portion of the band-3 oligosaccharide has a common core structure, with heterogeneity in the numbers of the repeating disaccharides, and contains fucose residues both in the peripheral portion and in the core portion. Haemagglutination tests were also carried out to determine the blood-group specificities of the glycoprotein and the results demonstrated the presence of both blood-group-H and I antigenic activities.
Hold-off time autotuning for a Geiger-mode avalanche photodiode

An FPGA-based signal processing unit for "self-tuning" the hold-off time of a Geiger-mode avalanche photodiode's (GMAP) active quench and reset circuit (AQRC) is presented. This prototype module eliminates afterpulsing effects in a GMAP using a method based on autocorrelation statistics.
Delay-bounded scheduling

We provide a new characterization of scheduling nondeterminism by allowing deterministic schedulers to delay their next-scheduled task. In limiting the delays an otherwise-deterministic scheduler is allowed, we discover concurrency bugs efficiently---by exploring few schedules---and robustly---i.e., independent of the number of tasks, context switches, or buffered events. Our characterization elegantly applies to any systematic exploration (e.g., testing, model checking) of concurrent programs with dynamic task-creation. Additionally, we show that certain delaying schedulers admit efficient reductions from concurrent to sequential program analysis.
Submodular Functions: Extensions, Distributions, and Algorithms. A Survey

Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of work has been concerned with maximizing or minimizing a submodular function, often subject to combinatorial constraints. Many of these algorithmic results exhibit a common structure. Namely, the function is extended to a continuous, usually non-linear, function on a convex domain. Then, this relaxation is solved, and the fractional solution rounded to yield an integral solution. Often, the continuous extension has a natural interpretation in terms of distributions on subsets of the ground set. This interpretation is often crucial to the results and their analysis. The purpose of this survey is to highlight this connection between extensions, distributions, relaxations, and optimization in the context of submodular functions. We also present the first constant factor approximation algorithm for minimizing symmetric submodular functions subject to a cardinality constraint.
A note on the pass-through from exchange rate and foreign price changes to inflation in selected emerging market economies

This note presents estimates of the pass-through of exchange rate changes and import price changes (measured in foreign currency) into domestic inflation in a group of 13 emerging market economies. The note focuses on the variation in the pass-through elasticities across and within countries, and on their evolution during the 1980s and 1990s. The model and estimation methods used are very simple and are intended to illustrate how the pass-through effects can be analysed with only a few data series in a bare bones framework that could be easily replicated by analysts and interpreted by policymakers in the emerging market economies. The main findings are as follows:
Evolutionary Layout of Graph Transformation Sequences

Graph transformation is used in various different research areas and has been implemented in several tool environments. However, the layout of graph transformation sequences is often perceived as not optimal and remains to be a difficult task. This is partly due to the slightly different requirements for layouting graph transformation sequences compared to standard graph sequences. In this paper, we clearly define these special requirements and present a layout algorithm which fulfills them. This layout algorithm allows the user to keep track of changes during transformation steps by introducing a concept of node aging and protection of senior node positions in the layout. Furthermore, this layout algorithm introduces a concept of layout patterns. We extended the well-known spring embedder layout algorithm by these new concepts and implemented the new algorithm in AGG, an environment for Attributed Graph Grammars. The layout algorithm has been tested with various graph grammars. A brief outlook describes how this layout algorithm can also be used for different kinds of graph sequences, e.g. sequences of successively developing class diagrams.
Lexical and pragmatic considerations of input structures

Increased access to computer-based tools has mad e only too clear the deficiencies in our ability to produc e effective user interfaces [I] . Many of our current problems are rooted in our lack of sufficiently powerfu l theories and methodologies . User interface desig n remains more of a creative art than a hard science . Following an age-old technique, the point of departure for much recent work has been to attempt t o impose some structure on the problem domain . Perhaps the most significant difference between this work an d earlier efforts is the weight placed on considerations falling outside the scope of conventional computer science . The traditional problem-reduction paradigm is being re placed by a holistic approach which views the problem as an integration of issues from computer science, electrical engineering, industrial design, cognitive psychology, psychophysics, linguistics, and kinesthetics . In the main body of this paper, we examine some o f the taxonomies which have been proposed and illustrat e how they can serve as useful structures for relatin g studies in user interface problems . In so doing, we attempt to augment the power of these structures b y developing their ability to take into account the effect o f gestural and positional factors on the overall effect of th e user interface .
A temperature control method for shortening thermal cycling time to achieve rapid polymerase chain reaction (PCR) in a disposable polymer microfluidic device

We present a temperature control method capable of effectively shortening the thermal cycling time of polymerase chain reaction (PCR) in a disposable polymer microfluidic device with an external heater and a temperature sensor. The method employs optimized temperature overshooting and undershooting steps to achieve a rapid ramping between the temperature steps for DNA denaturation, annealing and extension. The temperature dynamics within the microfluidic PCR chamber was characterized and the overshooting and undershooting parameters were optimized using the temperature-dependent fluorescence signal from Rhodamine B. The method was validated with the PCR amplification of mecA gene (162 bp) from methicillin-resistant Staphylococcus aureus bacterium (MRSA), where the time for 30 cycles was reduced from 50 min (without over- and undershooting) to 20 min.
Understanding the 3D virtual world market in China: A comparative case study of HiPiHi, Uworld and Novoking

The Chinese burgeoning Internet population will soon have an array of 3D virtual worlds in which to work and play. HiPiHi, Uworld and Novoking are considered as being the “Big3” local companies in this emerging market. Although some strategies of virtual worlds have been proven to be successful for attracting user acceptance in the western world, the effects of these strategies are questionable in the Chinese environment. For surviving in the Chinese environment, these three local companies have developed innovative strategies to attract Chinese users. Based on customer relationship management (CRM) and uses-and-gratifications (U&G) theories, this study compares the different strategies of these three virtual worlds, and explores which strategies can attract user acceptance in the Chinese environment.
MEMORY PROFILING FOR DIRECTING DATA SPECULATIVEOPTIMIZATIONS AND SCHEDULING

iii ACKNOWLEDGEMENTS I would rst like to thank my advisor, Professor Wen-mei Hwu, for giving me the opportunity to pursue my goals in computer architecture research. His integrity as an outstanding teacher has innuenced my graduate career more than any other teacher. My appreciation and thanks extend to many of the members of the IMPACT group. Among them, I would like to thank Rick Hank, my mentor, for giving me valuable advice concerning many things. For their help in the development of my thesis and my research, In addition, David August was instrumental to the writing and development of this thesis. I am especially grateful for my family and all my friends. Jaymie Braun's enthusiasm made my life in graduate school more enjoyable, while Margaret Carns' southern charm brightened my outlook on life. My brother Mel's sense of humor and caring nature helped me more than anyone on Earth. Also I would like to thank my sister Melody for being my biggest fan and giving me all of her attention. Finally and most importantly, I extend my love and appreciation to my mother. She is by far the most supportive person in my life.
On the Degree of Crystallinity in Some Cellulose Fibers Under Different Moisture Conditions

Fig. 2. _A2 VS 2 derived from pendulum indicator amplitudes which are approximately 20 times the shear plate amplitudes. under a variety of conditions. The curves are sufhciently well-defined to show small differences due to change in humidity, in lap direction, among different cottons, among laps that have been stacked for several days, among laps that have been drawn, and among laps that have been treated to change the surface properties. The data give well-defined curves in spite of using a small difference (10% to 15%) of two observations raised to the second power. In general, the results are consistent with what might he anticipated from earlier research and experience. ’ The . method seems to offer a new approach to the elusive surface properties that are important in the textile industry. Although the property of fiher assem,bly shear energy transformation seems to be closely allied with friction, its measurement is much more consistent and less variable than most friction measurements. Investigations are being pursued to answer more of the many questions raised by this new approach and will be reported more completely later.
Channel and complexity scalable image transmission

We present a source-channel coding system which is well suited for transmission over channels with varying channel states as common in mobile environments or broadcast scenarios. The system consists of a progressive source coder, a high-memory convolutional code (CC) with puncturing for unequal error protection (UEP) and a sequential decoding unit referred to as far end error decoder (FEED). In contrast to the conventional design goal of channel coding systems to minimize the bit error probability the presented system aims on maximizing the contiguously error-free part of the source message. Additionally, FEED allows one to localize the first error in the decoded message and only the virtually error free part is delivered to the source decoder. For image transmission gains up to 1.2 dB in average PSNR can be obtained compared to the best known system with the same channel decoder complexity. Finally, FEED allows a trade-off between receiver complexity and quality.
Modelling heterotachy in phylogenetic inference by reversible-jump Markov chain Monte Carlo

The rate at which a given site in a gene sequence alignment evolves over time may vary. This phenomenon—known as heterotachy—can bias or distort phylogenetic trees inferred from models of sequence evolution that assume rates of evolution are constant. Here, we describe a phylogenetic mixture model designed to accommodate heterotachy. The method sums the likelihood of the data at each site over more than one set of branch lengths on the same tree topology. A branch-length set that is best for one site may differ from the branch-length set that is best for some other site, thereby allowing different sites to have different rates of change throughout the tree. Because rate variation may not be present in all branches, we use a reversible-jump Markov chain Monte Carlo algorithm to identify those branches in which reliable amounts of heterotachy occur. We implement the method in combination with our ‘pattern-heterogeneity’ mixture model, applying it to simulated data and five published datasets. We find that complex evolutionary signals of heterotachy are routinely present over and above variation in the rate or pattern of evolution across sites, that the reversible-jump method requires far fewer parameters than conventional mixture models to describe it, and serves to identify the regions of the tree in which heterotachy is most pronounced. The reversible-jump procedure also removes the need for a posteriori tests of ‘significance’ such as the Akaike or Bayesian information criterion tests, or Bayes factors. Heterotachy has important consequences for the correct reconstruction of phylogenies as well as for tests of hypotheses that rely on accurate branch-length information. These include molecular clocks, analyses of tempo and mode of evolution, comparative studies and ancestral state reconstruction. The model is available from the authors' website, and can be used for the analysis of both nucleotide and morphological data.