Compatible difference packing set systems and their applications to multilength variable-weight OOCs

2021 ◽  
Author(s):  
Rongcun Qin ◽  
Hengming Zhao ◽  
Huangsheng Yu
Keyword(s):  
Set Systems ◽  
Variable Weight

Symmetrizable Difference Dchemes

2005 ◽  
Vol 5 (1) ◽  
pp. 3-50 ◽  
Author(s):  
Alexei A. Gulin
Keyword(s):  
Initial Data ◽  
Difference Scheme ◽  
Difference Schemes ◽  
Time Dependent ◽  
Stability Boundaries ◽  
Typical Representative ◽  
Variable Weight ◽  
The Stability ◽  
Conditions Of Stability ◽  
The Right

AbstractA review of the stability theory of symmetrizable time-dependent difference schemes is represented. The notion of the operator-difference scheme is introduced and general ideas about stability in the sense of the initial data and in the sense of the right hand side are formulated. Further, the so-called symmetrizable difference schemes are considered in detail for which we manage to formulate the unimprovable necessary and su±cient conditions of stability in the sense of the initial data. The schemes with variable weight multipliers are a typical representative of symmetrizable difference schemes. For such schemes a numerical algorithm is proposed and realized for constructing stability boundaries.

Eudaimonism and Cosmopolitan Concern

2018 ◽  
Author(s):  
David O. Brink
Keyword(s):  
Common Good ◽  
Ethical Concern ◽  
The Common Good ◽  
Variable Weight ◽  
Ancient Ethics ◽  
The Common

This essay explores the adequacy of Sidgwick’s contrast between the egocentrism of ancient ethics and the impartiality of modern ethics by evaluating the resources of eudaimonists, especially Aristotle and the Stoics, to defend a cosmopolitan conception of the common good. Adapting ideas from Broad, we might contrast the scope and weight of ethical concern, distinguishing ethical conceptions that are parochial with respect to both scope and weight, conceptions that are cosmopolitan with respect to both scope and weight, and mixed conceptions that combine universal scope and variable weight. Aristotle’s conception of the common good appears doubly parochial. By contrast, the Stoic conception of the common good is purely cosmopolitan. But the Stoics have trouble providing a eudaimonist defense of their cosmopolitanism. However, Aristotelian eudaimonism has resources to justify a mixed conception. Mixed cosmopolitanism may be cosmopolitanism enough.

scholarly journals Unavoidable subprojections in union-closed set systems of infinite breadth

2021 ◽  
Vol 94 ◽  
pp. 103311
Author(s):  
Yemon Choi ◽  
Mahya Ghandehari ◽  
Hung Le Pham
Keyword(s):  
Closed Set ◽  
Set Systems

scholarly journals WON-OCDMA System Based on MW-ZCC Codes for Applications in Optical Wireless Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 539
Author(s):  
Saleh Seyedzadeh ◽  
Andrew Agapiou ◽  
Majid Moghaddasi ◽  
Milan Dado ◽  
Ivan Glesk
Keyword(s):  
Optical Networks ◽  
Video Surveillance ◽  
Multiple Access ◽  
Optical Sensing ◽  
Multiple Access Interference ◽  
Service Differentiation ◽  
Sensor Data ◽  
Variable Weight ◽  
Code Division Multiple ◽  
The Impact

The growing demand for extensive and reliable structural health monitoring resulted in the development of advanced optical sensing systems (OSS) that in conjunction with wireless optical networks (WON) are capable of extending the reach of optical sensing to places where fibre provision is not feasible. To support this effort, the paper proposes a new type of a variable weight code called multiweight zero cross-correlation (MW-ZCC) code for its application in wireless optical networks based optical code division multiple access (WON-OCDMA). The code provides improved quality of service (QoS) and better support for simultaneous transmission of video surveillance, comms and sensor data by reducing the impact of multiple access interference (MAI). The MW-ZCC code’s power of two code-weight properties provide enhanced support for the needed service differentiation provisioning. The performance of this novel code has been studied by simulations. This investigation revealed that for a minimum allowable bit error rate of 10−3, 10−9 and 10−12 when supporting triple-play services (sensing, datacomms and video surveillance, respectively), the proposed WON-OCDMA using MW-ZCC codes could support up to 32 simultaneous services over transmission distances up to 32 km in the presence of moderate atmospheric turbulence.

scholarly journals Calculation Method of Permanent Deformation of Asphalt Mixture Based on Interval Number

Materials ◽  
2021 ◽  
Vol 14 (9) ◽  
pp. 2116
Author(s):  
Yue Xiao ◽  
Limin Tang ◽  
Jiawei Xie
Keyword(s):  
Interval Analysis ◽  
Calculation Method ◽  
Design Theory ◽  
Permanent Deformation ◽  
Asphalt Mixture ◽  
Design Parameters ◽  
Interval Variable ◽  
Road Design ◽  
Weight Assignment ◽  
Variable Weight

There are great uncertainties in road design parameters, and the traditional point numerical calculation results cannot reflect the complexity of the actual project well. Additionally, the calculation method of road design theory based on interval analysis is more difficult in the use of uncertain design parameters. In order to simplify the calculation process of the interval parameters in the road design theory, the asphalt pavement design is taken as the analysis object, and the permanent deformation of the asphalt mixture is simplified by combining the interval analysis theory. Considering the uncertainty of the design parameters, the data with boundaries but uncertain size are expressed in intervals, and then the interval calculation formula for the permanent deformation of the asphalt mixture is derived, and the interval results are obtained. In order to avoid the dependence of interval calculation on the computer code, according to the interval calculation rule, the interval calculation method with the upper and lower end point values as point operations is proposed. In order to overcome the contradiction between interval expansion results and engineering applications, by splitting the multi-interval variable formulas, the interval variable weights are reasonably given, and the synthesis of each single interval result realizes a simplified calculation based on interval variable weight assignment. The analysis results show that the interval calculation method based on the point operation rule is accurate and reliable, and the simplified method based on the interval variable weight assignment is effective and feasible. The simplified interval calculation method proposed in this paper provides a reference for the interval application of road design theory.

scholarly journals The Fair Division of Hereditary Set Systems

2021 ◽  
Vol 9 (2) ◽  
pp. 1-19
Author(s):  
Z. Li ◽  
A. Vetta
Keyword(s):  
Recent Work ◽  
Polynomial Time ◽  
Simple Algorithm ◽  
Fair Division ◽  
Set Systems

We consider the fair division of indivisible items using the maximin shares measure. Recent work on the topic has focused on extending results beyond the class of additive valuation functions. In this spirit, we study the case where the items form a hereditary set system. We present a simple algorithm that allocates each agent a bundle of items whose value is at least 0.3666 times the maximin share of the agent. This improves upon the current best known guarantee of 0.2 due to Ghodsi et al. The analysis of the algorithm is almost tight; we present an instance where the algorithm provides a guarantee of at most 0.3738. We also show that the algorithm can be implemented in polynomial time given a valuation oracle for each agent.

scholarly journals The VC Dimension of Metric Balls under Fréchet and Hausdorff Distances

2021 ◽  
Author(s):  
Anne Driemel ◽  
André Nusser ◽  
Jeff M. Phillips ◽  
Ioannis Psarros
Keyword(s):  
Density Estimation ◽  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Similarity Metrics ◽  
Vc Dimension ◽  
Set Systems ◽  
Polygonal Curves ◽  
The Individual ◽  
Curve Similarity ◽  
Metric Balls

AbstractThe Vapnik–Chervonenkis dimension provides a notion of complexity for systems of sets. If the VC dimension is small, then knowing this can drastically simplify fundamental computational tasks such as classification, range counting, and density estimation through the use of sampling bounds. We analyze set systems where the ground set X is a set of polygonal curves in $$\mathbb {R}^d$$ R d and the sets $$\mathcal {R}$$ R are metric balls defined by curve similarity metrics, such as the Fréchet distance and the Hausdorff distance, as well as their discrete counterparts. We derive upper and lower bounds on the VC dimension that imply useful sampling bounds in the setting that the number of curves is large, but the complexity of the individual curves is small. Our upper and lower bounds are either near-quadratic or near-linear in the complexity of the curves that define the ranges and they are logarithmic in the complexity of the curves that define the ground set.

Sign in / Sign up

Export Citation Format

Share Document