The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions. A system is K-step opaque if the entrance of the system state within the last K observations to a set of secret states remains opaque to an intruder who has complete knowledge of the system model and observes...
Supporting high-performance computing pipelines in wide-area networks is crucial to enabling large-scale distributed scientific applications that require minimizing end-to-end delay for fast user interaction or maximizing frame rate for smooth data flow. We formulate and categorize the linear pipeline configuration problems into six classes with two mapping objectives, i.e. minimum end-to-end delay...
This paper deals with stabilization of networked control systems (NCS) affected by uncertain time-varying delays and data packet dropouts. We point out that such network effects are likely to render the classical control Lyapunov function (CLF) method unfeasible, mainly due to the monotonic decreasing condition. To solve this problem we make use of a discrete-time equivalent of a control Lyapunov-Razumikhin...
The end-to-end (e2e) arguments are of the most influential design principles for the Internet for about three decades, which basically suggest a design principle that puts the application-level functions at the network rather than inside the network as much as possible to simplify network design and implementation. In many cases moving some functions from a network edge into the network is often considered...
A novel contention aware adjusting mechanism is proposed in this letter. Compared with the Binary Exponential Backoff algorithm defined in standard, our scheme can determine the contention window based on the collision status rapidly and the collision probability can be reduced dramatically; moreover, the dynamical varying timing method can make the node adjust the number of packets sending to MAC...
A service composition system can be constructed via integration and collaboration of many component services. The system performance needs to be obtained rapidly for the purpose of dynamic and adaptive management. An EGSPN (extended generalized stochastic Petri net) model is presented to reflect the service composition system with complex timing constraints in a compact and comprehensible manner....
An improved buffer sizing method in critical chain scheduling is proposed to deal with resource constraints and fuzzy uncertainties in project management. This method integrates three uncertainties of resource provision, network complexity and risk preference of project manager to optimize the buffer configuration. Compared with the two traditionally suggested methods, C&PM and RSEM, it generates...
In distributed virtual environment (DVE) systems, a distributed server infrastructure is often used to reduce the latency between servers and clients. Under this infrastructure, mapping clients to proper servers is one of the key issues for improving the interactivity and overall performance. Most traditional methods of mapping the clients to servers only consider the load balancing problem. However,...
The problem of M activities of N > M parallel activities being adjusted to a procedure chain is one type of the project scheduling. In allusion to M = 3 , a new polynomial algorithm is proposed to minimize the total tardiness criterion. In order to present this algorithm, and search the optimal procedure chain, we propose a Normal Chain Theory by virtue of the relationships of activities' time...
This paper takes a philosophically new approach to throughput-optimal scheduling queueing systems with interference. All existing popular approaches (e.g. max-weight, greedy, ??pick-and-compare?? etc.) focus on the weights of individual queues. We take an alternative approach, by focusing instead on the aggregate queues of bottlenecks. A bottleneck is a set of mutually-interfering queues; a schedule...
Hierarchical architectures are more and more widely adopted for organizing wireless sensor networks. In such architectures, middle-tier nodes take important roles, and preventing a malicious node from impersonating a middle-tier node and injecting falsified messages becomes critical. In this paper, we propose an energy efficient, distributed scheme to secure the multicast messages from the middle-tier...
The detailed timing information obtained from design iteration can only be added into synthesis process manually. A new strategy for automatic synthesis of backing marked timing information is presented in this paper. As the carrier of backing marked timing information, the delay statements in VHDL is synthesized in scheduling process. And a new scheduling algorithm is presented in this paper. The...
In this paper, we focus on fair access to bandwidth in daisy-chained interconnects. We first analyze the original HyperTransport fairness protocol and show that it is not perfectly fair. We then propose a new, fair scheme whose complexity is similar to that of the HyperTransport protocol.
We propose an efficient method to recognize multi-stroke handwritten symbols. The method is based on computing the truncated Legendre-Sobolev expansions of the coordinate functions of the stroke curves and classifying them using linear support vector machines. Earlier work has demonstrated the efficiency and robustness of this approach in the case of single-stroke characters. Here we show that the...
This article describes a new approach for higher radix butterflies suitable for pipeline implementation. Based on the butterfly computation introduced by Cooley-Tukey [1], we introduce a novel approach for the factorization of the Discrete Fourier Transform (DFT), by redefining the butterfly computation, which is more suitable for efficient VLSI implementation. This proposed factorization motivated...
Deploying radio-capable gateways at the sea surface can mitigate the limitations of acoustic communications in underwater sensor networks (UWSN). Finding the best placement for gateways is formulated as an ILP problem. The choice of gateway candidate locations can affect both the feasibility and the quality of the solution. In this paper, we show the limitation of using a regular mesh of candidate...
Distributed Multi-party/Multi-stream systems require a multicast subnetwork capable of satisfying QoS constraints such as delay and delay variation bound so that the messages reach each destination node at almost the same time within a certain specified time limit. In addition, certain multi-stream systems also demand that different streams for each different destination node should reach with minimum...
Spectrum handoff occurs when the primary users appear in the licensed band occupied by the secondary users. Spectrum handoff procedures aim to help the secondary users to vacate the occupied licensed spectrum and find suitable target channel to resume the unfinished transmission. In this paper, we discuss how to select the target channels to minimize the total service time with multiple spectrum handoffs...
We propose new strategies in core selection methods and core-based tree (CBT) construction based on new methods of computing delay variation. As a result, we propose an algorithm, which guarantees that the delay from the source to any destination does not exceed a real-time constraint. Furthermore, we address the problem of satisfying the delay variation constraint under cost minimization. We present...
In the recent past, subquadratic space complexity multipliers have been proposed for binary fields defined by irreducible trinomials and some specific pentanomials. For such multipliers, alternative irreducible polynomials can also be used, in particular, nearly all one polynomials (NAOPs) seem to be better than pentanomials (see [7]). For improved efficiency, multiplication modulo an NAOP is performed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.