We classify up to isomorphism optimal (v, 4, 1) binary cyclically permutable constant- weight (CPCW) codes with v (<=) 76 and cyclic 2-(73, 4, 1) and 2-(76, 4, 1) designs. There is a one-to-one correspondence betwe...
详细信息
We classify up to isomorphism optimal (v, 4, 1) binary cyclically permutable constant- weight (CPCW) codes with v (<=) 76 and cyclic 2-(73, 4, 1) and 2-(76, 4, 1) designs. There is a one-to-one correspondence between optimal (v, 4, 1) CPCW codes, optimal cyclic binary constant-weight codes with weight 4 and minimum distance 6, (v, 4;left perpendicular(v -1)/12righ perpendicular) difference packings, and optimal (v, 4, 1) optical orthogonal codes. Therefore, the classification of CPCW codes holds for them too. Perfect (v, 4, 1) CPCW codes are equivalent to (v, 4, 1) cyclic difference families, and thus (73, 4, 1) cyclic difference families are classified too.
A two-level batch chromosome coding scheme is proposed to solve the lot splitting problem with equipment capacity constraints in flexible job shop scheduling, which includes a lot splitting chromosome and a lot schedu...
详细信息
A two-level batch chromosome coding scheme is proposed to solve the lot splitting problem with equipment capacity constraints in flexible job shop scheduling, which includes a lot splitting chromosome and a lot scheduling chromosome. To balance global search and local exploration of the differential evolution algorithm, a hybrid discrete differential evolution algorithm (HDDE) is presented, in which the local strategy with dynamic random searching based on the critical path and a random mutation operator is developed. The performance of HDDE was experimented with 14 benchmark problems and the practical dye vat scheduling problem. The simulation results showed that the proposed algorithm has the strong global search capability and can effectively solve the practical lot splitting problems with equipment capacity constraints.
We exploit the structure of the critical orbital sets of symmetry classes of tensors associated to sign uniform partitions and we establish new connections between symmetry classes of tensors, matchings on bipartite g...
详细信息
We exploit the structure of the critical orbital sets of symmetry classes of tensors associated to sign uniform partitions and we establish new connections between symmetry classes of tensors, matchings on bipartite graphs and coding theory. In particular, we prove that the orthogonal dimension of the critical orbital sets associated to single hook partitions lambda = (w, 1(n-w)) equals the value of the coding theoretic function A(n, 4, w). When w = 2 we reobtain this number as the independence number of the Dynkin diagram A(n-1). (C) 2011 Elsevier Inc. All rights reserved.
Passage of the Digital Millennium Copyright Act (DMCA) was a significant milestone in congressional information policy legislation. However, the results were widely criticized in some circles as providing too much pow...
详细信息
Passage of the Digital Millennium Copyright Act (DMCA) was a significant milestone in congressional information policy legislation. However, the results were widely criticized in some circles as providing too much power to certain stakeholder groups. This paper uses computer-based content analysis and a theoretical taxonomy of information policy values to analyze congressional hearing testimony. The results of document coding were then analyzed using a variety of statistical tools to map how different stakeholders framed issues in the debate and determine if congressional value statements about the legislation conformed more closely to certain stakeholders. Results of the analysis indicate that significant differences in the use of information policy terms occurred across stakeholders, and showed varying degrees of convergence between congressional or other stakeholders when framing information policy issues.
While neural BP-based (NBP) decoders exhibit superior error correction performance compared to belief-propagation (BP) decoders, the NBP decoder's high computational and memory requirements impede its practical de...
详细信息
While neural BP-based (NBP) decoders exhibit superior error correction performance compared to belief-propagation (BP) decoders, the NBP decoder's high computational and memory requirements impede its practical deployment in communication systems. To overcome this challenge, we propose a Coded Neural BP (CNBP) scheme to accelerate the NBP decoder in distributed environments, while considering storage constraints and providing resilience to stragglers. The key idea is to reformulate the primary operations of the NBP decoder as matrix-vector multiplications by introducing weight matrices and transformations. Based on this, the acceleration of the NBP decoder is achieved by speeding up matrix-vector multiplications using coded distributed computing. Extensive experiments conducted on Amazon EC2 cluster demonstrate that CNBP achieves notable acceleration and scalability performance without any loss in error correction performance.
We consider a generalization of the gradient coding framework where a dataset is divided across n workers and each worker transmits to a master node one or more linear combinations of the gradients over its assigned d...
详细信息
We consider a generalization of the gradient coding framework where a dataset is divided across n workers and each worker transmits to a master node one or more linear combinations of the gradients over its assigned data subsets. Unlike the conventional framework which requires the master node to recover the sum of the gradients over all the data subsets in the presence of straggler workers, we relax the goal to computing the sum of at least some a fraction of the gradients. We begin by deriving a lower bound on the computation load of any scheme and also propose two strategies which achieve this lower bound, albeit at the cost of high communication load and a number of data partitions which can be polynomial in n. We then propose schemes based on cyclic assignment which utilize n data partitions and have a lower communication load. When each worker transmits a single linear combination, we prove lower bounds on the computation load of any scheme using n data partitions. Finally, we describe a class of schemes which achieve different intermediate operating points for the computation and communication load and provide simulation results to demonstrate the empirical performance of our schemes.
We report on the implementation of a traveling wave (TW) based compression ratio ion mobility programming (CRIMP) approach within structures for lossless ion manipulations (SLIM) that enables both greatly enlarged tra...
详细信息
We report on the implementation of a traveling wave (TW) based compression ratio ion mobility programming (CRIMP) approach within structures for lossless ion manipulations (SLIM) that enables both greatly enlarged trapped ion charge capacities and also efficient ion population compression for use in ion mobility (IM) separations. Ion accumulation is conducted in a SLIM serpentine ultralong path with extended routing (SUPER) region after which CRIMP compression allows the large ion populations to be "squeezed". The SLIM SUPER IM module has two regions, one operating with conventional traveling waves (i.e., traveling trap;TT region) and the second having an intermittently pausing or "stuttering" TW (i.e., stuttering trap;ST region). When a stationary voltage profile was used in the ST region, ions are blocked at the TT ST interface and accumulated in the TT region and then can be released by resuming a conventional TW in the ST region. The population can also be compressed using CRIMP by the repetitive merging of ions distributed over multiple TW bins in the TT region into a single TW bin in the ST region. Ion accumulation followed by CRIMP compression provides the basis for the use of larger ion populations for IM separations. We show that over 10(9) ions can be accumulated with high efficiency in the present device and that the extent of subsequent compression is only limited by the space charge capacity of the trapping region. Approximately 5 X 10(9) charges introduced from an electrospray ionization source were trapped for a 40 s accumulation period, more than 2 orders of magnitude greater than the previously reported charge capacity of an ion funnel trap. Importantly, we show that extended ion accumulation in conjunction with CRIMP compression and multiple passes through the serpentine path provides the basis for a highly desirable combination of ultrahigh sensitivity and SLIM SUPER high-resolution IM separations.
In the paper, taint analysis problem is considered. To solve it, static interprocedural context-, flow-, and object-sensitive algorithm is proposed. Characteristics of the algorithm are evaluated, and specific feature...
详细信息
In the paper, taint analysis problem is considered. To solve it, static interprocedural context-, flow-, and object-sensitive algorithm is proposed. Characteristics of the algorithm are evaluated, and specific features of the implementation of the algorithm on the basis of the LLVM compiler infrastructure are discussed. Results of evaluation are presented.
The use of coding for error control is an integral part of the design of modern communication systems. Capacity-approaching codes such as turbo and LDPC codes, discovered or rediscovered in the past decade, offer near...
详细信息
The use of coding for error control is an integral part of the design of modern communication systems. Capacity-approaching codes such as turbo and LDPC codes, discovered or rediscovered in the past decade, offer near-Shannon-limit performance on the AWGN channel with rather low implementation complexity and are therefore increasingly being applied for error control in various fields of data communications. This article describes a generic multilevel modulation and coding scheme based on the use of turbo, turbo-like, or LDPC codes for DSL systems. It is shown that such codes provide significant gains in performance and allow an increase in data rate and/or loop reach that can be instrumental to the widespread deployment of future DSL services. Such techniques are also suitable for general multilevel modulation systems in other application areas.
Multidimensional multiphysics analysis of TRISO-coated particle fuel using the BISON finite element nuclear fuels code is described. The governing equations and material models applicable to particle fuel and implemen...
详细信息
Multidimensional multiphysics analysis of TRISO-coated particle fuel using the BISON finite element nuclear fuels code is described. The governing equations and material models applicable to particle fuel and implemented in BISON are outlined. Code verification based on a recent IAEA benchmarking exercise is described, and excellent comparisons are reported. Multiple TRISO-coated particles of increasing geometric complexity are considered. The code's ability to use the same algorithms and models to solve problems of varying dimensionality from 1D through 3D is demonstrated. The code provides rapid solutions of 10 spherically symmetric and 2D axially symmetric models, and its scalable parallel processing capability allows for solutions of large, complex 3D models. Additionally, the flexibility to easily include new physical and material models and straightforward ability to couple to lower length scale simulations makes BISON a powerful tool for simulation of coated-particle fuel. Future code development activities and potential applications are identified. (C) 2013 Elsevier B.V. All rights reserved.
暂无评论