8,218 research outputs found
A Hypersequent Calculus for Łukasiewicz Logic without the Merge Rule
No full textwere the conclusion of an S rule, then the rule could be applied a third time. We do not have a proof that the rewriting rules terminate. So the admissibility of the M rule (and thus the equivalence of GL/2 to GL/) is a conjecture. Future Work . Proof of M rule admissibility in GL/2 , or a completeness proof (using cut elimination). . Evaluation of the implementation against alternative proof search systems for L/ukasiewicz logics. . Elimination of EC and S rules, and comparison of that system with Metcalfe's GL/ l labelled sequent calculus [4]. . Merge Compaction on other sequent and hypersequent systems where the M rule is admissible (such as RM). . Apply a similar technique for other kinds of shuffling rules in other sequent and hypersequent systems. Reference
Detroit cancer centers merge into foundation
No full textReports on Detroit, Michigan-based cancer institutions' plan to merge funds in cancer research and treatment programs under the Michigan Cancer Foundation. Consolidated foundations; Negotiators for the merger; Intellectual advantages; Specific criteria; History of research; Expectations of few layoffs.; Reports on Detroit, Michigan-based cancer institutions' plan to merge funds in cancer research and treatment programs under the Michigan Cancer Foundation. Consolidated foundations; Negotiators for the merger; Intellectual advantages; Specific criteria; History of research; Expectations of few layoffs
An Integrated Assessment of Climate Change, Air Pollution, and Energy Security Policy
No full textThis article presents an integrated assessment of climate change, air pollution, and energy security policy. Basis of our analysis is the MERGE model, designed to study the interaction between the global economy, energy use, and the impacts of climate change. For our purposes we expanded MERGE with expressions that quantify damages incurred to regional economies as a result of air pollution and lack of energy security. One of the main findings of our cost-benefit analysis is that energy security policy alone does not decrease the use of oil: global oil consumption is only delayed by several decades and oil reserves are still practically depleted before the end of the 21st century. If, on the other hand, energy security policy is integrated with optimal climate change and air pollution policy, the world’s oil reserves will not be depleted, at least not before our modeling horizon well into the 22nd century: total cumulative demand for oil then decreases by about 20%. More generally, we demonstrate that there are multiple other benefits of combining climate change, air pollution, and energy security policies and exploiting the possible synergies between them. These benefits can be large: for Europe the achievable CO2 emission abatement and oil consumption reduction levels are significantly deeper for integrated policy than when a strategy is adopted in which one of the three policies is omitted. Integrated optimal energy policy can reduce the number of premature deaths from air pollution by about 14,000 annually in Europe and over 3 million per year globally, by lowering the chronic exposure to ambient particulate matter. Only the optimal strategy combining the three types of energy policy can constrain the global average atmospheric temperature increase to a limit of 3ºC with respect to the pre-industrial level.Climate Change, Air Pollution, Energy Security, Cost-Benefit Analysis
Enhanced Merge Sort- A New Approach to the Merging Process
No full textAbstractOne of the major fundamental issues of Computer Science is arrangement of elements in the database. The efficiency of the sorting algorithms is to optimize the importance of other sorting algorithms11. The optimality of these sorting algorithms is judged while calculating their time and space complexities12. The idea behind this paper is to modify the conventional Merge Sort Algorithm and to present a new method with reduced execution time. The newly proposed algorithm is faster than the conventional Merge Sort algorithm having a time complexity of O(n log2 n). The proposed algorithm has been tested, implemented, compared and the experimental results are promising
Adapt: Global Image Processing with the Split and Merge Model
No full textAdapt is a simple architecture-independent language for both local and global image processing operations based on the split and merge programming model. In the split and merge model, the image is divided into portions, each portion is processed independently, and then the separate results are combined. The split and merge model is examined, and is found capable of computing any image processing operation that can be computed in forward or reverse order over a data strcture. Moreover, the split and merge model is amenable to efficient implementation on a wide variety of parallel architectures. The Adapt language is described, and Adapt programming techniques are presented. Several algorithms for important image processing operations, including image warping, image connected components, and two-dimensional fast Fourier transform, are presented in detail. Implementations of Adapt on several parallel computers are described. The performance of several algorithms on the Sun, the Carnegie M..
FPGA-Based High Throughput Merge Sorter
No full textAs database systems have shifted from disk-based to in-memory, and the scale of the database in big data analysis increases significantly, the workloads analyzing huge datasets are growing. Adopting FPGAs as hardware accelerators improves the flexibility, parallelism and power consumption versus CPU-only systems. The accelerators are also required to keep up with high memory bandwidth provided by advanced memory technologies and new interconnect interfaces. Sorting is the most fundamental database operation. In multiple-pass merge sorting, the final pass of the merge operation requires significant throughput performance to keep up with the high memory bandwidth. We study the state-of-the-art hardware-based sorters and present an analysis of our own design. In this thesis, we present an FPGA-based odd-even merge sorter which features throughput of 27.18 GB/s when merging 4 streams. Our design also presents stable throughput performance when the number of input streams is increased due to its high degree of parallelism. Thanks to such a generic design, the odd-even merge sorter does not suffer throughput drop for skewed data distributions and presents constant performance over various kinds of input distributions.Electrical Engineering | Microelectronic
Disperse-Then-Merge: Pushing the Limits of Instruction Tuning via Alignment Tax Reduction
No full textSupervised fine-tuning (SFT) on instruction-following corpus is a crucial
approach toward the alignment of large language models (LLMs). However, the
performance of LLMs on standard knowledge and reasoning benchmarks tends to
suffer from deterioration at the latter stage of the SFT process, echoing the
phenomenon of alignment tax. Through our pilot study, we put a hypothesis that
the data biases are probably one cause behind the phenomenon. To address the
issue, we introduce a simple disperse-then-merge framework. To be concrete, we
disperse the instruction-following data into portions and train multiple
sub-models using different data portions. Then we merge multiple models into a
single one via model merging techniques. Despite its simplicity, our framework
outperforms various sophisticated methods such as data curation and training
regularization on a series of standard knowledge and reasoning benchmarks.Comment: Accepted to the findings of ACL202
Impact of Bottleneck Merge Control Strategies on Freeway Level of Service
No full textAbstractFreeway work zones typically mandate lane closures that often induce bottlenecks. Merge maneuvers and the accompanying increase in the rate of lane changes at these bottlenecks can become problematic resulting in undesirable mobility and safety impacts. Traditionally, merge control strategies are deployed to mitigate such impacts. Literature sources indicate that available merge control strategies fall into one of four categories, namely: (i) early merge control, (ii) late merge control, (iii) temporary ramp metering, and (iv) mainline merge metering. However, little is known about the proper criteria for selecting and implementing one of the available merge control strategies. In addition, the impact of the various control strategies on freeway Level of Service (LOS) is currently under-researched. The purpose of this study is to evaluate the operational impacts of the above-mentioned freeway merge control strategies. The goal is to provide work-zone-aware LOS indicators that would help transportation agencies in selecting the most appropriate merge control strategy to minimally impact the freeway operations. In order to meet the research goals and objectives, this study used the CORSIM micro-simulation platform to evaluate impacts of various merge control strategies at a freeway study corridor in Birmingham, AL. The 2010 Highway Capacity Manual methods for calculating LOS were considered and modifications were proposed to align the calculated LOS with the assessed impacts of each merge control strategy. This study is significant for its contribution to providing transportation researchers and professionals with tools and methods to evaluate freeway LOS under work zone conditions and assisting them in mitigating the adverse impacts of work zones on traffic operations
On Batcher's Merge Sorts as Parallel Sorting Algorithms
No full textIn this paper we examine the average running times of Batcher's bitonic merge and Batcher's odd-even merge when they are used as parallel merging algorithms. It has been shown previously that the running time of odd-even merge can be upper bounded by a function of the maximal rank difference for elements in the two input sequences. Here we give an almost matching lower bound for odd-even merge as well as a similar upper bound for (a special version of) bitonic merge. From this follows that the average running time of odd-even merge (bitonic merge) is \Theta((n=p)(1+log(1+p 2 =n))) (O((n=p)(1+log(1+p 2 =n))), resp.) where n is the size of the input and p is the number of processors used. Using these results we then show that the average running times of odd-even merge sort and bitonic merge sort are O((n=p)(log n+ (log(1 + p 2 =n)) 2 )), that is, the two algorithms are optimal on the average if n p 2 =2 p log p . The derived bounds do not allow to compare the two sorting ..
Priority Merge and Intersection Modalities
No full textWe study the logic of so-called lexicographic or priority merge for multi-agent plausibility models. We start with a systematic comparison between the logical behavior of priority merge and the more standard notion of pooling through intersection, used to define, for instance, distributed knowledge. We then provide a sound and complete axiomatization of the logic of priority merge, as well as a proof theory in labeled sequents that admits cut. We finally study Moorean phenomena and define a dynamic resolution operator for priority merge for which we also provide a complete set of reduction axioms
- …
