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.
Motif finding problem is a major task to understand the mechanisms of gene expression regulation. Motif is generally defined as a recurring pattern in the sequence of nucleotides or amino acids. In the DNA sequence, it is usually a short segment that occurs frequently, but not required to be an exact copy for each occurrence. This property of motif makes motif mining very difficult. In fact, motif...
Pressure and strokes are the much natural input modalities from pens. This study investigates the potentials of coupling pressure and strokes with pen-based interactions by discussing the possible strategies of using them. Pressure can be used as discrete or continuous manners, which are explored by two presented techniques: two-layer operation and Pressure Cursor. An experiment was conduct to determine...
Building information modelling (BIM) is only a tool in the procurement of a building, but it is changing the way the whole process is undertaken. Having a single model which is used by all disciplines requires a different management structure and by consequence a restructuring of the resources required to complete a project.These changes are encompassed in Integrated Practice and more recently Integrated...
Applications of 3 dimensional (3-D) virtual reality are now possible on current mobile phones due to the advances in mobile 3-D graphics technologies. However, the user-interface to these applications is generally still limited to the basic phone keypad which detracts from the sophisticated experience 3-D worlds can provide. In this paper we present a solution to this problem which utilizes the accelerometers...
Three applications in wireless networks where model-free stochastic learning is applicable, are discussed. The learning based optimization problems are formulated and simulation results are presented. Some open issues are also discussed.
In this paper, we introduce a pricing model that ensures efficient resource allocation that provides guaranteed quality of service while maximizing profit in multiservice networks. Specifically, a dynamic allocation policy is examined that relies on online measurements while each service class operates under a probabilistic bound delay constraint. We present a rigorous analysis of the properties of...
As remarked in Cook (1980), we do not know any nonlinear lower bound on the circuit size of a language in P or even in NP. The best known lower bound seems to be due to Paul (1975). Instead of trying to prove lower bounds on the circuit-size of a "natural" language, this note raises the question of whether some language in a class is of provably high circuit complexity. We show that for...
Several representations of P, the class of deterministic polynomial time acceptable languages, are compared with respect to succinctness. It is shown that requirements such as polynomial running time, verifiability of running time, and verifiability of accepting a set in P can be causes for differences in succinctness that are not recursively bounded. Relating succinctness to nondeterminism, it is...
We consider the game of Checkers generalized to an N × N board. Although certain properties of positions are efficiently computable (e.g., can Black jump all of White's pieces in a single move?), the general question, given a position, of whether a specified player can force a win against best play by his opponent, is shown to be PSPACE-hard. Under certain reasonable assumptions about the "drawing...
A hybrid special-purpose computer based on a recursive algorithm for discrete Walsh transform computations is described. The device uses feedback in time to reduce the required number of summing junctions to N, the number of data points to be transformed. Computations are completed in 700 ??s when N = 256.
Some results concerning uniform modular decomposition are presented. The primary concern is with the number of inputs which a universal module must have and also with the conditions which a module must satisfy if it is to be output sufficient. It is shown that the number of inputs required by an output sufficient module grows exponentially with the number of inputs to the sequential machines to be...
The problem is treated of finding for a set of identical processing elements an interconnection structure that achieves a certain richness of interelement communication with only a limited number of actual inter-element connections. In graphical terms, this problem is one of finding a universal n-node graph of minimal degree D(n,d) in which every n-node graph of maximum degree d is branchembeddable...
It is generally recognized that asynchronous operation of logic networks offers specific advantages over synchronous operation controlled by a central clock when the network is subject to large or widely varying inter-module propagation delays. In this paper we characterize several previously described techniques for achieving asynchronous operation by a single model. Essential to the model is the...
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.