We survey results for Cameron-Liebler sets and low degree Boolean functions for Hamming graphs, Johnson graphs and Grassmann graphs from the point of view of association schemes. This survey covers selected results in...
详细信息
Führmann introduced Abstract Kleisli structures to model call-by-value programming languages with side effects, and showed that they correspond to monads satisfying a certain equalising condition on the unit. We ...
详细信息
As a new type of wireless network architecture, because of its self-organization, and support multi-hop and heterogeneous networks, Wireless Mesh networks has played an important role in building "wireless cities...
详细信息
As a new type of wireless network architecture, because of its self-organization, and support multi-hop and heterogeneous networks, Wireless Mesh networks has played an important role in building "wireless cities" and become an research spot in academia and industry. In practical applications, network capacity is the most important need and high network throughput is the most important network performance parameter. As a wireless Mesh network basic issue, network capacity associates the physical characteristics of the network, topology, routing algorithm and channel allocation scheme at all levels. Aiming the question of wireless Mesh network capacity, the paper proposes a hierarchy optimization model from bottom to up and a series of optimization ways based on programming theory. the main content in this paper includes: (1) Optimizing link-channel scheduling strategy, studying the wireless Mesh network channel allocation algorithm, and an interference-based model and linear programming channel allocation and routing joint algorithm is proposed;(2) research of network scalability, taking into account the network coverage and performance at the same time, the paper presents a mixed integer nonlinear programming algorithm for the deployment of the AP;(3) research of gateway deploying strategy, a linear programming based heuristic algorithm gateway deployment is proposed. Research on these issues of network capacity optimization will improve the performance of networks and promote the development of wireless mesh networks;it also has certain significance in the engineering practice.
A key index of the performance of a rule-based program used in real-time monitoring and control is its response time, defined by the maximum number of rule firings before a fixed point of the program is reached from a...
详细信息
A key index of the performance of a rule-based program used in real-time monitoring and control is its response time, defined by the maximum number of rule firings before a fixed point of the program is reached from a start state. Previous work in computing the response-time bounds for rule-based programs assumes that if two rules are enabled, then either one of them may be scheduled for firing. This assumption may be too conservative in the case when programmers choose to impose a priority structure on the set of rules. In this paper, we discuss how to get tighter bounds by taking rule-priority information into account. We show that the rule-suppression relation we previously introduced can be extended to incorporate rule-priority information. A bound-derivation algorithm for programs whose potential-trigger relations satisfy an acyclicity condition is presented, followed by its correctness proof and an analysis example.< >
The significance of programming CNC machine tools through online or shop floor approaches is discussed. Online requires a central hub of dedicated programmers to write numerical control (NC) code, which is posted and ...
详细信息
The significance of programming CNC machine tools through online or shop floor approaches is discussed. Online requires a central hub of dedicated programmers to write numerical control (NC) code, which is posted and sent to any machine tool on the shop floor via CAM system. Shop floor CNC programming uses some form of conversational or interactive software to aid program development and offers more benefits than CAM system online programming. One of the pioneers of conversational programming solutions for CNC, Japan's Mazak, designed Mazatrol T-1 CNC, to increase productivity and manufacturing competitiveness. This system offers conversational programming based on the format of questions and answers designed to eliminate the need for traditional punched tapes, tape punching machines, and tape readers at the machine tool and allows the operator to modify programs quickly with a few keystrokes at the machine as dimensional changes.
Low module coupling is considered to be a desirable quality for modular programs to have. Previously, coupling has been defined subjectively and not quantified, making it difficult to use in practice. In this article,...
详细信息
Low module coupling is considered to be a desirable quality for modular programs to have. Previously, coupling has been defined subjectively and not quantified, making it difficult to use in practice. In this article, we extend previous work to reflect newer programming languages and quantify coupling by developing a general software metric system that allows us to automatically measure coupling. We have precisely defined the levels of coupling so that they can be determined algorithmically, incorporated the notion of direction into the coupling levels, and accounted for different types of nonlocal variables present in modern programming languages. With our system, we can measure the coupling between all pairs of modules in a system, measure the coupling of a particular module with all other modules in a system, and measure the coupling of an entire system. We have implemented our metric system so that it measures the coupling between pairs of procedures in arbitrary C programs and have analyzed several well-used systems of various sizes.
We describe in this paper a new approach to Generic programming that combines our integration results with Partial Evaluation methods for adaptation. Our approach supports Partial Evaluation by providing much more inf...
详细信息
We describe in this paper a new approach to Generic programming that combines our integration results with Partial Evaluation methods for adaptation. Our approach supports Partial Evaluation by providing much more information than is usually available, including explicit meta-knowledge about the program fragments and their intended execution environments. We make some ambitious claims here, so we provide some detail about our methods, to justify our interest and expectations. We are not claiming to have solved the problem; only that we think our methods circumvent some of the know difficulties that were previously identified or encountered in approaches to Generic programming.
The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theorem for resource-bounded Kolmogorov co...
详细信息
The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theorem for resource-bounded Kolmogorov complexity is the key to obtaining fundamental results in average-case complexity, yet whether any samplable distribution admits a coding theorem for randomized time-bounded Kolmogorov complexity (rKpoly) is open and a common bottleneck in the recent literature of meta-complexity. Previous works bypassed this issue by considering probabilistic Kolmogorov complexity (pKpoly), in which public random bits are assumed to be available. In this paper, we present an efficient coding theorem for randomized Kolmogorov complexity under the non-existence of one-way functions, thereby removing the common bottleneck. This enables us to prove rKpoly counterparts of virtually all the average-case results that were proved only for pKpoly, and enables the resolution of the following concrete open problems. 1. The existence of a one-way function is characterized by the failure of average-case symmetry of information for randomized time-bounded Kolmogorov complexity, as well as a conditional coding theorem for randomized time-bounded Kolmogorov complexity. This resolves the open problem of Hirahara, Ilango, Lu, Nanashima, and Oliveira (STOC’23). 2. Hirahara, Kabanets, Lu, and Oliveira (CCC’24) showed that randomized time-bounded Kolmogorov complexity admits search-to-decision reductions in the errorless average-case setting over any samplable distribution, and left open whether a similar result holds in the error-prone setting. We resolve this question affirmatively, and as a consequence, characterize the existence of a one-way function by the average-case hardness of computing rKpoly with respect to an arbitrary samplable distribution, which is an rKpoly analogue of the pKpoly characterization of Liu and Pass (CRYPTO’23). The key technical lemma is that any distribution wh
Considering the most common cases in the test suit, a dependence test method for loop parallelization is designed based on the Banerjee-GCD and Banerjee-Bound methods. It is found out that not all the dependence direc...
详细信息
Considering the most common cases in the test suit, a dependence test method for loop parallelization is designed based on the Banerjee-GCD and Banerjee-Bound methods. It is found out that not all the dependence direction contribute equally to loop parallelization. A test of a small portion of the whole set of dependence directions covers most loop inter-iteration dependence. So these directions are tested to reduce the time complexity of the algorithm. The information got in GCD and Bound test can be used to extend the original algorithm. The main idea is: GCD test can find out a set of possible dependence vectors, then Bound test could check each bits of the vector and eliminate some dependence directions, which in fact does not exist. Furthermore, the information can be exchanged between GCD and Bound test to get more efficiency from the original one. The original GCD and Bound test method can be extended to make it support non-linear equations. By integrating these two dependence test method into one single algorithm and make the maximum use of them, a fast and ambitious dependence test method for the purpose of program parallelization can be provided.
Several mistakes in Transparency Lemma and Soundness Theorem proved by Bijlsma (1989) were pointed out by proposing some counter examples. Furthermore, the authors reproved the above results using intuitive methods wh...
详细信息
Several mistakes in Transparency Lemma and Soundness Theorem proved by Bijlsma (1989) were pointed out by proposing some counter examples. Furthermore, the authors reproved the above results using intuitive methods which are easier to be understood.
暂无评论