The study of the shapes of sedimentary particles was presented. The shape of the particle was described by using the roundness as the measurement factor. The analysis study utilized a Fourier transform method to obtai...
详细信息
ISBN:
(纸本)0964345692
The study of the shapes of sedimentary particles was presented. The shape of the particle was described by using the roundness as the measurement factor. The analysis study utilized a Fourier transform method to obtain coordinates on the edge of the profile of the fragment being measured. The proposed method described the difference between the low pass filtered radii and original radii as the measure of roundness.
A weak decomposition of an incompletely specified function f is a decomposition of some completion of f. Using a graph-theoretical characterization of functions that admit such decompositions, we present a technique d...
详细信息
A weak decomposition of an incompletely specified function f is a decomposition of some completion of f. Using a graph-theoretical characterization of functions that admit such decompositions, we present a technique derived from the a priori algorithm that allows a data mining approach to identifying these decompositions.
In order to model and analyze the data traffic behaviors with feedback mechanism in high-speed data communication system, we start from the feedback control model proposed by Rauf Izmailov, which is based on different...
详细信息
In order to model and analyze the data traffic behaviors with feedback mechanism in high-speed data communication system, we start from the feedback control model proposed by Rauf Izmailov, which is based on differential delay equations. But, instead of specifying the processing rate to be constant, we extend it to a general functional model. We also add a random item for describing the uncertainties in a real communication system. We analyze the stability and robust stability of systems with these models. Theoretically the results show that the system can be stabilized and that the buffer size can be controlled even if the system is suffering from a large delay or has variations in its delay, or if some other uncertain situations are present.
The electronic markets vs. electronic hierarchies debate initiated by (Malone et al. 1987) has been superseded by the discussion about dis- or reintermediation in the electronic marketplace. Many of the arguments give...
详细信息
The electronic markets vs. electronic hierarchies debate initiated by (Malone et al. 1987) has been superseded by the discussion about dis- or reintermediation in the electronic marketplace. Many of the arguments given for either side are equally correct - because the arguments have been applied to different domains in different situations from specific perspectives - and yet the debate falls short of covering the complexity and dynamics of the ongoing market structure change. The goal of this paper is therefore to develop a more differentiated framework that facilitates the understanding of chances and threats resulting from inter- and cybermediation. The framework suggests to distinguish roles, opportunities and threats for cybermediaries in different situations. While the framework is meant to structure the debate in general, we will focus on public sector procurement to show its application.
The paper presents an approach for establishing correspondences in time and in space between two different video sequences of the same dynamic scene, recorded by stationary uncalibrated video cameras. The method simul...
详细信息
The paper presents an approach for establishing correspondences in time and in space between two different video sequences of the same dynamic scene, recorded by stationary uncalibrated video cameras. The method simultaneously estimates both spatial alignment as well as temporal synchronization (temporal alignment) between the two sequences, using all available spatio-temporal information. Temporal variations between image frames (such as moving objects or changes in scene illumination) are powerful cues for alignment, which cannot be exploited by standard image-to-image alignment techniques. We show that by folding spatial and temporal cues into a single alignment framework, situations which are inherently ambiguous for traditional image-to-image alignment methods, are often uniquely resolved by sequence-to-sequence alignment. We also present a "direct" method for sequence-to-sequence alignment. The algorithm simultaneously estimates spatial and temporal alignment parameters directly from measurable sequence quantities, without requiring prior estimation of point correspondences, frame correspondences, or moving object detection. Results are shown on real image sequences taken by multiple video cameras.
We present a data model for movies and movie databases. A movie is considered to be a 2D semi-algebraic figure that can change in time. We give a number of computability results concerning movies: it can be decided wh...
详细信息
We present a data model for movies and movie databases. A movie is considered to be a 2D semi-algebraic figure that can change in time. We give a number of computability results concerning movies: it can be decided whether a frame of a movie is only a topologically transformation of another frame; a movie has a finite number of scenes and cuts and these can be effectively computed. Based on these computability results we define an SQL-like query language for movie databases. This query language supports most movie editing operations like cutting, pasting and selection of scenes.
We describe a distributed computing primitive termed polling that is both a means of synchronization and communication in distributed or concurrent systems. The polling operation involves the collection of messages fr...
详细信息
We describe a distributed computing primitive termed polling that is both a means of synchronization and communication in distributed or concurrent systems. The polling operation involves the collection of messages from nodes in an interconnection network, in response to a query. We define the semantics of polling, and present algorithms for implementing the operation on complete and hypercube networks. Time and message lower bounds are presented, and are followed by an analysis of the number of operations performed at each node for every algorithm. We show that polling in a complete graph on 2n vertices can be completed in 2n rounds using 2n+2n-3+[2n-3+1/3]-1 messages. In case of n-cube, we show that polling in 2n rounds requires [2n+1/32n-1+1/6√2n-4/3] messages and we present an algorithm that completes polling in 2n rounds and sends 2n+3·2n-4-1 messages.
It is well known that for the case of a countable partial order, the ideal completion and the chain completion coincide. We investigate the boundary at which the chain and ideal completion do not coincide. We show in ...
It is well known that for the case of a countable partial order, the ideal completion and the chain completion coincide. We investigate the boundary at which the chain and ideal completion do not coincide. We show in particular that the ideal completion is not sequentially adequate; that is it is not possible in general to simply replace the ideal completion with a completion based on sequences as for instance the chain completion. The implications of this result for the Yoneda completion ([1]) and for the Smyth completion ([7,8,9,10,11]) which are based on the ideal completion, are discussed in an extended version of this paper, reported in [5].
We consider load balancing in the following setting. The on-line algorithm is allowed to use n machines, whereas the optimal off-line algorithm is limited to m machines, for some fixed m less than or equal n. We show ...
详细信息
暂无评论