共查询到20条相似文献,搜索用时 46 毫秒
1.
Alexander V. Evako Ralph Kopperman Yurii V. Mukhin 《Journal of Mathematical Imaging and Vision》1996,6(2-3):109-119
Many applications of digital image processing now deal with three- and higher-dimensional images. One way to represent n-dimensional digital images is to use the specialization graphs of subspaces of the Alexandroff topological space n (where denotes the integers with the Khalimsky line topology). In this paper the dimension of any such graph is defined in three ways, and the equivalence of the three definitions is established. Two of the definitions have a geometric basis and are closely related to the topological definition of inductive dimension; the third extends the Alexandroff dimension to graphs. Diagrams are given of graphs that are dimensionally correct discrete models of Euclidean spaces, n-dimensional spheres, a projective plane and a torus. New characterizations of n-dimensional (digital) surfaces are presented. Finally, the local structure of the space n is analyzed, and it is shown that n is an n-dimensional surface for all n1. 相似文献
2.
J. Farkas 《Structural and Multidisciplinary Optimization》1991,3(1):51-58
A brief survey of selected literature shows that fabrication aspects play an important role in the economic design of welded structures. Fabrication costs and production requirements should be considered in the optimum design procedure.In a detailed numerical example some optimal solutions are determined for a simple box beam having transverse diaphragms and carrying a fluctuating load. In the objective function the material and fabrication costs are taken into account. The cost function formula enables the investigation of structural solutions for wide ranges of cost factors.Constraints on fatigue strength, local buckling of plate elements, shear stress and deflection are considered. Based on the active constraints, the cost function may be expressed as a function of the beam height as the main variable. The minimum cross-sectional area, volume and cost designs are calculated.Concerning the fillet welds of the transverse diaphragms two solutions are considered: (1) without post treatment with a lower fatigue strength; (2) with post toe burr grinding with improved fatigue strength. In the second case the cost of post treatment is also included in the cost function.A comparison of the above solutions shows that the post treatment of transverse fillet welds may be economic despite of the additional cost.Notation
A
cross-sectional area
-
A
f
cross-sectional area of a flange
-
a
w
fillet weld size
-
b
beam width
-
c
1
, c2
distances of diaphragms from the support
-
E
modulus of elasticity
-
G = V
mass
-
h
web height
-
I
x
moment of inertia
-
K
total cost
-
K
m
, K
f
material and fabrication cost, respectively
-
k
m
, k
f
material and fabrication cost factor, respectively
-
L
span length
-
L
w
weld length
-
M
bending moment
-
N
number of cycles
-
n
number of diaphragms
-
n
1
number of diaphragms with post treated welds
-
p
intensity of normal load
-
Q
shear force
-
S
x
statical moment
-
T
time
-
t
f
, t
w
/2
flange and web thickness, respectively
-
V
volume
-
W
x
section modulus
-
W
0
required section modulus
-
deflection
-
limiting plate slenderness of webs
-
difficulty factor
-
f
limiting plate slenderness of the compression flange
-
= k
f
/km
ratio of cost factors
-
number of structural elements
-
v
Poisson's ratio
-
density
-
normal stress
-
f
fatigue strength
-
shear stress
-
f
fatigue strength in shear
-
w
shear stress in welds 相似文献
3.
T. Lewiński 《Structural and Multidisciplinary Optimization》1993,6(1):59-64
The paper presents an up-to-date review of results concerning the evaluation of the stiffnesses of elastic plates with periodic structure. The homogenization formulae of Kohn and Vogelius (1984) (modela = 1) are viewed as the formulae of reference. The paper discusses the range of applicability of the homogenization formulae for the two-dimensional plate models of Kirchhoff and Reissner-Hencky. Transversely symmetric as well as asymmetric plates are considered. Particular attention is paid to plates stiffened asymmetrically with ribs in one direction. For this case, the closed formulae for effective membrane, reciprocal and bending stiffnesses are derived. The homogenization results overviewed are a prerequisite for the discussion of the methods of regularization of optimum design plate problems presented in Part II of the paper.Revised version of a paper presented at NATO ASI Optimization of Large Structural Systems, Berchtesgaden, Germany, Sept. 23 – Oct. 4, 1991 相似文献
4.
Ben Goertzel 《Minds and Machines》1993,3(3):313-317
Ideas from random graph theory are used to give an heuristic argument that associative memory structure depends discontinuously on pattern recognition ability. This argument suggests that there may be a certain minimal size for intelligent systems. 相似文献
5.
Companies that provide crane-lorry services are faced with the daily need to perform vehicle and driver allocation and scheduling. Many companies still do this manually due to the lack of suitable technologies. This manual approach is both time consuming and inaccurate and most probably will not lead to an optimized plan that can reduce operational costs. In this paper, we describe the design of a system called Crane Lorry Scheduling System (CLSS) that we have developed for the largest crane lorry company in Hong Kong. A crane lorry company is a company that provides lorries with different types of mounted crane equipment and drivers to service different types of moving and lifting jobs. CLSS is a Web-based application that streamlines communication with customers, subcontractors and employees/lorry drivers. We modeled the lorry-assignment problem as a constraint-satisfaction problem (CSP) algorithm, which we call the Crane Lorry Optimizing Engine (CLOE). CLOE was designed to be easily customizable to match the needs and requirements of different crane lorry companies. We experimented with two versions of CLOE, regular CLOE that finds best solutions and X-CLOE that finds optimal solutions. Results from our tests show that CLOE is faster and generates better quality plans than the manual approach. 相似文献
6.
This paper presents algorithms for multiterminal net channel routing where multiple interconnect layers are available. Major improvements are possible if wires are able to overlap, and our generalized main algorithm allows overlap, but only on everyKth (K 2) layer. Our algorithm will, for a problem with densityd onL layers,L K + 3,provably use at most three tracks more than optimal: (d + 1)/L/K + 2 tracks, compared with the lower bound of d/L/K. Our algorithm is simple, has few vias, tends to minimize wire length, and could be used if different layers have different grid sizes. Finally, we extend our algorithm in order to obtain improved results for adjacent (K = 1) overlap: (d + 2)/2L/3 + 5 forL 7.This work was supported by the Semiconductor Research Corporation under Contract 83-01-035, by a grant from the General Electric Corporation, and by a grant at the University of the Saarland. 相似文献
7.
Masakazu Nasu 《Theory of Computing Systems》1979,13(1):81-93
Indecomposable local maps of one-dimensional tessellation automata are studied. The main results of this paper are the following. (1) For any alphabet containing two or more symbols and for anyn 1, there exist indecomposable scope-n local maps over . (2) If is a finite field of prime order, then a linear scope-n local map over is indecomposable if and only if its associated polynomial is an irreducible polynomial of degreen – 1 over , except for a trivial case. (3) Result (2) is no longer true if is a finite field whose order is not prime. 相似文献
8.
Dr. T. Ström 《Computing》1972,10(1-2):1-7
It is a commonly occurring problem to find good norms · or logarithmic norms (·) for a given matrix in the sense that they should be close to respectively the spectral radius (A) and the spectral abscissa (A). Examples may be the certification thatA is convergent, i.e. (A)A<1 or stable, i.e. (A)(A)<0. Often the ordinary norms do not suffice and one would like to try simple modifications of them such as using an ordinary norm for a diagonally transformed matrix. This paper treats this problem for some of the ordinary norms.
Minimisierung von Normen und Logarithmischen Normen durch Diagonale Transformationen
Zusammenfassung Ein oft vorkommendes praktisches Problem ist die Konstruktion von guten Normen · und logarithmischen Normen (·) für eine gegebene MatrixA. Mit gut wird dann verstanden, daß A den Spektralradius (A)=max |1| und (A) die Spektralabszisse (A)=max Re i gut approximieren. Beispiele findet man für konvergente Matrizen wo (A)A<1 gewünscht ist, und für stabile Matrizen wo (A)(A)<0 zu zeigen ist. Wir untersuchen hier, wie weit man mit Diagonaltransformationen und dengewöhnlichsten Normen kommen kann.相似文献
9.
Rainer Kuhlen 《Computers and the Humanities》1991,25(2-3):93-101
This paper discusses terms which are of mutual importance to the fields of information science and computer science. Specifically we discuss the notions of information and knowledge: their interrelationships as well as their differences, and the concept of value-adding. Concrete examples are used in the discussion.Rainer Kuhlen is professor of Information Science at the University of Konstanz. 相似文献
10.
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems 总被引:3,自引:0,他引:3
In recent years, constraint satisfaction techniques have been successfully applied to disjunctive scheduling problems, i.e., scheduling problems where each resource can execute at most one activity at a time. Less significant and less generally applicable results have been obtained in the area of cumulative scheduling. Multiple constraint propagation algorithms have been developed for cumulative resources but they tend to be less uniformly effective than their disjunctive counterparts. Different problems in the cumulative scheduling class seem to have different characteristics that make them either easy or hard to solve with a given technique. The aim of this paper is to investigate one particular dimension along which problems differ. Within the cumulative scheduling class, we distinguish between highly disjunctive and highly cumulative problems: a problem is highly disjunctive when many pairs of activities cannot execute in parallel, e.g., because many activities require more than half of the capacity of a resource; on the contrary, a problem is highly cumulative if many activities can effectively execute in parallel. New constraint propagation and problem decomposition techniques are introduced with this distinction in mind. This includes an O(n2) edge-finding algorithm for cumulative resources (where n is the number of activities requiring the same resource) and a problem decomposition scheme which applies well to highly disjunctive project scheduling problems. Experimental results confirm that the impact of these techniques varies from highly disjunctive to highly cumulative problems. In the end, we also propose a refined version of the edge-finding algorithm for cumulative resources which, despite its worst case complexity in O(n3) , performs very well on highly cumulative instances. 相似文献
11.
Hans Ulrich Simon 《Acta Informatica》1989,26(8):771-785
Summary Many reductions among combinatorial problems are known in the context of NP-completeness. These reductions preserve the optimality of solutions. However, they may change the relative error of approximative solutions dramatically. In this paper, we apply a new type of reductions, called continuous reductions. When one problem is continuously reduced to another, any approximation algorithm for the latter problem can be transformed into an approximation algorithm for the former. Moreover, the performance ratio is preserved up to a constant factor. We relate the problem Minimum Number of Inverters in CMOS-Circuits, which arises in the context of logic synthesis, to several classical combinatorial problems such as Maximum Independent Set and Deletion of a Minimum Number of Vertices (Edges) in Order to Obtain a Bipartite (Partial) Subgraph. 相似文献
12.
Real-time Collision-free Path Planning of Robot Manipulators using Neural Network Approaches 总被引:4,自引:0,他引:4
In this paper, a novel neural network approach to real-time collision-free path planning of robot manipulators in a nonstationary environment is proposed, which is based on a biologically inspired neural network model for dynamic trajectory generation of a point mobile robot. The state space of the proposed neural network is the joint space of the robot manipulators, where the dynamics of each neuron is characterized by a shunting equation or an additive equation. The real-time robot path is planned through the varying neural activity landscape that represents the dynamic environment. The proposed model for robot path planning with safety consideration is capable of planning a real-time comfortable path without suffering from the too close nor too far problems. The model algorithm is computationally efficient. The computational complexity is linearly dependent on the neural network size. The effectiveness and efficiency are demonstrated through simulation studies. 相似文献
13.
Webbased browsers are quickly becoming ubiquitous in the workplace. Software development managers are quick to incorporate browsers into a broad range of software development projects, often inappropriately. The purpose of this paper is to examine the technical issues relevant to incorporating browsers as a component of a commercial offtheshelf (COTS)based solution. Issues examined include portability, performance, functionality, security, human factors, distribution, installation, upgrading, componentbased development, runtime configuration management, and licensing. 相似文献
14.
Peter Baumgartner Ulrich Furbach 《Annals of Mathematics and Artificial Intelligence》2003,38(1-3):211-228
This work is about a real-world application of automated deduction. The application is the management of documents (such as mathematical textbooks) as they occur in a readily available tool. In this Slicing Information Technology tool, documents are decomposed (sliced) into small units. A particular application task is to assemble a new document from such units in a selective way, based on the user's current interest and knowledge. It is argued that this task can be naturally expressed through logic, and that automated deduction technology can be exploited for solving it. More precisely, we rely on first-order clausal logic with some default negation principle, and we propose a model computation theorem prover as a suitable deduction mechanism. Beyond solving the task at hand as such, with this work we contribute to the quest for arguments in favor of automated deduction techniques in the real world. Also, we argue why we think that automated deduction techniques are the best choice here. 相似文献
15.
Garry Molholt 《Computers and the Humanities》1990,24(1-2):81-92
Though there are good reasons to improve instruction in pronunciation, the teaching of pronunciation has lost popularity among language teachers. This is because the traditional indirect analyses of sounds according to places and manners of articulation are clumsy when applied to classroom teaching. By shifting the focus of instruction to the direct feedback of real-time acoustic analysis in the visual mode, instructors are free from the complex and often unproductive terminology of articulatory phonetics, and students are free from the burden of translating instructors' general comments such as try again or repeat after me into plans for specific changes.
Garry Molholt is Assistant Professor of Linguistics and English as a Second Language, and Coordinator of Computer Assisted Instruction. His research interests are the applications of speech processing to instruction in the acquisition of second language phonology. He has published Computer Assisted Instruction in Pronunciation for Chinese Speakers of American English, in TESOL Quarterly, and (with Ari Presler), Correlation between Human and Machine Ratings of Test of Spoken English Reading Passages, in Technology and Language Testing. 相似文献
16.
Prof. Dr. Dr. h.c. W. Händler 《Computing》1992,48(1):5-20
A memory-coupled multiprocessor—well suited to bit-wise operation—can be utilized to operate as a 1024 items cellular processing unit. Each processor is working on 32 bits and 32 such processors are combined to a multiprocessor. The information is stored in vertical direction, as it is defined and described in earlier papers [1] on vertical processing. The two-dimensional array (32 times 32 bits) is composed of the 32 bit-machine-words of the coupled processors on the one hand and of 32 processors in nearest-neighbour-topology on the other hand. The bit-wise cellular operation at one of the 1024 points is realized by the program of the processor—possibly assisted by appropriate microprogam sequences.Dedicated to Professor Willard L. Miranker on the occasion of his 60th birthday 相似文献
17.
In many applications one has a set of discrete points at which some variable such as pressure or velocity is measured. In order to graphically represent and display such data (say, as contours of constant pressure), the discrete data must be represented by a smooth function. This continuous surface can then be evaluated at any point for graphical display. Sometimes data are arbitrarily located except that they occur along non-intersecting lines, an example occurring in wind tunnel tests where data are recorded at plug taps on an aircraft body. An algorithm is developed for this type of structured data problem and illustrated by means of color computer graphics. 相似文献
18.
O. V. Solonukha 《Cybernetics and Systems Analysis》2004,40(4):587-593
In studying the surjectivity of set-valued mappings, a modification of the acute-angle lemma (or the equilibrium theorem) is used. This allows one to weaken the coerciveness condition. Some applications to differential equations (inclusions) with Neumann boundary conditions are considered on Sobolev spaces W
p
1() in which operators are used that are not coercive in the classical sense. 相似文献
19.
The problem of classification of optimal ternary constant-composition codes is considered. Using a combinatorial-computer method, the number of inequivalent codes is determined for 3 d n 10. 相似文献
20.
Stit theory (a logic of seeing-to-it-that) is applied to cases involving many agents. First treated are complex nestings of stits involving distinct agents. The discussion is driven by the logical impossibility of a sees to it that b sees to it thatQ in the technical sense, even though that seems to make sense in everyday language. Of special utility are the concepts of forced choice, of the creation of deontic states, and of probabilities. Second, joint agency, both plain and strict (every participant is essential) is given a rigorous treatment. A central theorem is that strict joint agency is itself agentive. 相似文献