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 consider the problem of identifying intersections between two sets of d-dimensional axis-parallel rectangles. This is a common operation that arises in many agent-based simulation studies, and is of central importance in the context of High Level Architecture (HLA), where it is at the core of the Data Distribution Management (DDM) service. Several realizations of the DDM service have...
A fundamental problem in many applications involving social and biological networks is to identify and count the number of embeddings of a given small sub graph in a large graph. Often, they involve dynamic graphs, in which the graph changes incrementally (e.g., by edge addition/deletion). We study the Dynamic Sub graph Enumeration (DSE) Problem, where the goal is to maintain a dynamic data structure...
As a rule, the mathematical description of the system in reliability analysis is defined as system with two states (failure and functioning), that is interpreted as Boolean function. The mathematical tools of Boolean algebra can be used for reliability estimation of the system. The Logical Differential Calculus is one of mathematical tools in Boolean algebra. This tool is used for analysis of influence...
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our distance oracle has size O(n5/3) = O(n1.66⋯) and, when queried about vertices at distance d, returns a path of length 2d + 1. For weighted graphs with m = n2/α edges, our distance oracle has size O(n2/3√α) and returns a factor 2 approximation...
By analysis of web user access sequence, we can find the factors of user's hobbies, interests, habits etc. and provide the necessary support of information for the upgrade and amendment of web sites. This article proposed a method of data mining MFASMDT (Maximal Frequent Access Sequence Mining of Duration Time). It can reduce the number of web pages of the session sequence and compress the size of...
Distributed mutual exclusion provides access to shared critical resources amongst different mobile nodes in a MANET. Several solutions for fixed networks like token-based and permission-based algorithms have been proposed in the literature. In this paper, we have come up with a novel permission-based algorithm for solving the problem that can handle site failures. Our approach introduces a new message...
A new model is proposed for early detection of Internet worm burst. This model consists mainly of two algorithms: A detection algorithm based on relationship of port number and destination addresses, and an invalidating algorithm derived from page switching method in OS. Simulation model has been designed and tested on an improved NS2 platform, and the results show our model is very efficient and...
The efficiency of subscription subsumption checking remains a key issue for content-based publish/subscribe systems. In this paper, we propose an efficient data structure called subscription subsumption graph (SSG). This data structure could differentiate the two types of subsumption relationships and help speed up the process of subsumption checking and subscription cancellation. We then present...
A variety of tasks in formal verification require finding small or minimal unsatisfiable cores (subsets) of an unsatisfiable set of constraints. This paper proposes two algorithms for finding a minimal unsatisfiable core or, if a time-out occurs, a small non-minimal unsatisfiable core. Our algorithms can be applied to either standard clause-level unsatisfiable core extraction or high-level unsatisfiable...
It is the key of Krusal Algorithm to select edges and judge loop. Though realized path-compression in operation of searching tree of Union-Find Sets Data Structure, and optimized merging-operation which the shallower tree has been merged into the deeper tree, the operation of selecting edges and judging loop in Krusal Algorithm is optimized and the time complexity of algorithm is reduced. Compared...
This paper presents an approach which extends a particle swarm optimizer for variable weighting (PSOVW) to handle the problem of text clustering, called text clustering via particle swarm optimization (TCPSO). PSOVW has been exploited for evolving optimal feature weights for clusters and has demonstrated to improve the clustering quality of high-dimensional data. However, when applying it for text...
While the CMOS analog circuits can be designed with the minimum-gate-length of the fabrication process in the alpha-power law MOSFET model, the length of a MOSFET gate has been chosen to be a larger scale than the minimum-gate-length in the conventional Shockleypsilas square model. In this paper, we describe a 6-b 100 MSPS CMOS current steering digital-to-analog converter (DAC) with the alpha-power...
There is a growing trend in using mobile computing environment for several applications, and It is important that the mobile systems are provided adequate support both at the systems level and at the communication level. Causal ordering is a useful property, particularly in applications that involve human intcractions. In this paper, we present three algorithms for causal ordering in mobile systems...
In this paper we introduce a model of Hierarchical Memory with Block Transfer (BT for short). It is like a random access machine, except that access to location x takes time f(x), and a block of consecutive locations can be copied from memory to memory, taking one unit of time per element after the initial access time. We first study the model with f(x) = xα for 0 ≪ α ≪ 1. A tight bound of θ(n log...
We present techniques for parallel divide-and-conquer, resulting in improved parallel algorithms for a number of problems. The problems for which we give improved algorithms include intersection detection, trapezoidal decomposition (hence, polygon triangulation), and planar point location (hence, Voronoi diagram construction). We also give efficient parallel algorithms for fractional cascading, 3-dimensional...
We present efficient algorithms for the following geometric problems: (i) Preprocessing of a 2-D polyhedral terrain so as to support fast ray shooting queries from a fixed point. (ii) Determining whether two disjoint interlocking simple polygons can be separated from one another by a sequence of translations. (iii) Determining whether a given convex polygon can be translated and rotated so as to fit...
This paper presents an algorithm for maximum matching on general graphs with integral edge weights, running in time O(n3/4m lg N), where n, m and N are the number of vertices, number of edges, and largest edge weight magnitude, respectively. The best previous bound is O(n(mlg lg lgd n + n lg n)) where d is the density of the graph. The algorithm finds augmenting paths in batches by scaling the weights...
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.