Computer-Aided Mechanical Design Using Configuration Spaces
|
|
- Archibald Chapman
- 5 years ago
- Views:
Transcription
1 Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel Elisha Sacks (corresponding athor) Compter Science Department Prde University West Lafayette, IN 47907, USA Jne 24, 1999 Abstract The paper describes research in compter-aided design of mechanical systems sing configration spaces. The research addresses the core design task of rigid-body contact analysis and related tasks. Contact analysis is a comptational bottleneck in mechanical design, especially in systems with complex part shapes, tight fits, and contact changes. Manal analysis is error-prone and time-consming, whereas atomated analysis exceeds the capabilities of crrent design software. To address these problems, we have developed a general contact analysis method for planar mechanical systems based on configration space comptation. We have implemented a prototype design environment that integrates contact analysis with simlation, tolerance analysis, and visalization. The software helps designers stdy system fnction nder a range of operating conditions, find and correct design flaws, and optimize performance. Keywords: compter-aided design, mechanism theory, contact analysis, kinematics. To appear in IEEE Compters in Science and Engineering,
2 1 Introdction This paper describes or research in compter-aided design of mechanical systems sing configration spaces. Mechanical design is the task of devising an assembly of parts (a mechanical system) that performs a fnction reliably and economically. It is a biqitos activity with applications in mechanical, electrical, and biomedical engineering. Designers need to devise, analyze, and compare competing design prototypes to create good designs. Compter-aided design helps designers redce design time and improve qality by replacing physical prototypes with electronic ones. Or research addresses the core design task of rigid-body contact analysis and related tasks. We assme that the parts are rigid: they cannot change shape or overlap. This assmption is reasonable for most mechanical design tasks. Contact analysis determines the positions and orientations at which the parts of a system toch and the ways that the toching parts interact. The interactions consist of constraints on the part motions that prevent them from overlapping. The constraints are expressed as algebraic eqations that relate the part coordinates. For example, a rond ball on a flat floor obeys the constraint z r = 0 with z the height of its center point (a position coordinate) and r its radis. The constraints are a fnction of the shapes of the toching part featres (vertices, edges, and faces), hence they change when one pair of featres breaks contact and another makes contact. Contact analysis is a core design task becase contacts are the physical primitives that make mechanical systems ot of collections of parts. Systems perform fnctions by transforming motions via part contacts. The shapes of the interacting parts impose constraints on their motions that largely determine the system fnction. Designers perform contact analysis to derive this evolving seqence of contacts and motion constraints. The reslts help them simlate the system fnction, find and correct design flaws, measre performance, and compare design alternatives. We illstrate contact analysis and its role in design on the ratchet mechanism shown in Figre 1. The mechanism has for moving parts and a fixed frame. The driver, link, and ratchet are attached to the frame by revolte joints. (A revolte joint is a cylindrical pin on one part that fits in a matching cylindrical hole in the other part, ths restricting the part motions to rotation abot the cylinder axis.) The pawl is attached to the link by a revolte joint and is attached to a spring (not shown) that applies a conterclockwise torqe arond the joint. A motor rotates the driver with constant anglar velocity, casing the link pin to move left and right. This cases the link to oscillate arond its rotation point, which moves the pawl left and right. The leftward motion pshes a ratchet tooth, which rotates the ratchet conterclockwise. The rightward motion frees the pawl tip from the tooth, which allows the spring to rotate the pawl to engage the next tooth. Contact analysis validates the intended fnction by determining if the link oscillates far enogh, if the pawl pshes the ratchet teeth far enogh, if the system can jam, and so on. Revolte joints are standard and easy to analyze, althogh the combined effect of several joints is complex. The driver/link pair is harder to analyze becase the link pin interacts with the inner and oter driver profiles. The ratchet/pawl pair is mch harder yet becase the part shapes are complex and becase the pawl can translate horizontally, translate vertically, and rotate, whereas the other parts jst 2
3 pawl ratchet link driver (a) (b) (c) Figre 1: Ratchet mechanism: (a) pawl advancing ratchet; (b) pawl flly advanced; (c) pawl retracting. White circles indicate revolte joints. rotate. Contact analysis of the overall system is hardest of all becase we mst validate the intended interactions among all the parts, sch as the indirect relation between the driver and the ratchet, and mst rle ot interference, sch as the pawl hitting the frame. Contact analysis is a comptational bottleneck in mechanical systems with many potential part contacts. The complexity grows rapidly as the nmber of parts increases. A pair of toching parts interacts via contacts between featre pairs. Hndreds of featres per part is the norm, which leads to thosands of potential contacts per pair and to a combinatorial growth in system contacts. Or research shows that this complexity is common in modern mechanisms. Contact changes occr by design in 65% of the 2500 mechanisms in an engineering encyclopedia [1]. Examples inclde gears, cams, ratchets and cltches. Manfactring variation often introdces nintended, complex contacts into a system whose nominal fnction has simple contacts. For example variation in revolte joints cases play: the pin can translate as well as rotate becase it is smaller than the hole. Designers need to analyze these variations to ensre correct fnction. This process is called tolerance analysis. Manal contact analysis of complex systems is error-prone and time-consming, whereas atomated analysis exceeds the capabilities of crrent design software. This software consists mainly of simlators for systems whose parts interact via standard joints, sch as linkage mechanisms and robot maniplators [2]. It does not directly handle systems with non-standard joints, contact changes, and tight fits. To address these problems, we have developed a general contact analysis method for planar mechanical systems, which accont for over 90% of mechanisms. We have implemented a prototype design environment that integrates contact analysis with simlation, tolerance analysis, and visalization. The software helps designers stdy system fnction nder a range of operating conditions, find and correct design flaws, and optimize performance. The contact analysis method is based on configration space comptation. Configration space is a geometric representation of rigid body interaction that has seen extensive comptational se in robot motion planning [3]. We have fond that it is an effective tool for contact analysis. The configration space of a mechanical system describes all possible part interactions. It encodes 3
4 y a a θa a ψ v y b b θ b b x a x (a) b (b) Figre 2: Pairwise configrations: (a) absolte coordinates and (b) relative coordinates. qantitative information, sch as part motion paths, and qalitative information, sch as system failre modes. It provides a framework within which diverse design tasks can be performed. We have developed a configration space comptation algorithm for systems with crved parts, generalized it to toleranced parts, and applied it to mechanical design. This paper is a srvey of or research on contact analysis. We describe the configration space representation, explain its vale as a contact analysis tool, and illstrate it on simple examples. In so doing, we present the big pictre behind the diverse algorithms that appear in prior pblications. We assess the strengths and weaknesses of or approach for practical design tasks and identify isses for ftre research. 2 Configration space We perform contact analysis on a mechanical system by compting a configration space for each pair of parts. The prpose of the analysis is to identify the pairs of part featres that toch in some system configration, to compte the motion constraints for every pair, and to compte the configrations in which contacts change. This section explains what configration space is and how it spports contact analysis. We attach reference frames to the parts and define the configration of a part to be the position and orientation of its reference frame with respect to a fixed global frame. Figre 2a shows parts a and b, their reference frames, and their configrations (x a ; y a ; a ) and (x b ; y b ; b ). The configration space of the pair is the Cartesian prodct, (x a ; y a ; a ; x b ; y b ; b ), of the part configrations. The configration space coordinates represent the six independent motions of the parts, called degrees of freedom. As the parts move, the configration traces a path in configration space. Configration space partitions into three disjoint sets that characterize part interaction: blocked space where the parts overlap, free space where they do not toch, and contact space where they toch. The free and blocked spaces are open sets whose common bondary is contact space. This implies that the first two have the same dimension as the configration space, whereas the 4
5 dimension of the third is one lower. Intitively, free and blocked space are open becase disjoint or overlapping parts remain so nder all small motions, whereas contact space is closed becase toching parts separate or overlap nder some small motions. We illstrate these concepts with the simple example of a block that moves in a fixed frame. In Figre 3(a), the frame is fixed at the global origin with orientation 0, so we can ignore its coordinates from the configration space and consider only the block coordinates (; v; ). We first assme that the block translates in the displayed orientation withot rotating, which yields a two-dimensional configration space. The gray region is blocked space, the white region is free space, and the black lines are contact space. The dot in free space marks the displayed position of the block. Free space divides into a central rectangle where the block is inside the frame, an oter region where it is otside, and a narrow connecting rectangle where it is partly inside. The contact crves (lines in this case) bonding these regions represent contacts between the vertices and edges of the block and the frame. Changing the orientation of the block yields configration spaces with different topologies (Figre 3b, c). The free space consists of disconnected inside and otside regions becase the block does not fit throgh the frame opening. We now consider the same example, bt with the block orientation varying from to radians, The configration space becomes three dimensional with rotation coordinate (Figre 4). One way to visalize this space is as a stack of planar slices along the rotation axis. Each slice is the configration space of a block that translates at a fixed orientation, sch as the three examples above. The fll space is the nion of the slices. The free space consists of an oter region, two inner regions, and two connecting channels near = =2 where the block is nearly vertical. The oter tbe is the nion of the oter regions, the inner tbe is the nion of the inner rectangles, and the channels are the nion of the connecting regions. Blocked space is the region between the tbes and otside the channels. We can model general planar pairs with three-dimensional configration spaces even thogh they have six degrees of freedom. The reason is that the part contacts are invariant nder rigid motions of the pair. In other words, the relative configration of the parts determines the contacts. We compte the configration space of part a with respect to the reference frame of part b, which is eqivalent to fixing b in the (0; 0; 0) configration. The relation between the absolte and relative coordinate systems is given by = (x a x b ) cos b + (y a y b ) sin b v = (y a y b ) cos b (x a x b ) sin b = a b : (1) Figre 2 contrasts the two coordinate systems. In the example, the block is a, the frame is b, and (; v; ) = (x a ; y a ; a ) becase x b ; y b ; b = 0. Whatever its dimension, the configration space of a pair is a complete representation of the part contacts, so any contact qestion is answerable by a configration space qery. Testing if parts overlap, do not toch, or are in contact in a given configration corresponds to testing if the configration point is in blocked, free, or contact space. Contacts between pairs of featres 5
6 contact space block free space v frame blocked space (a) v v (b) v v (c) Figre 3: A translating block moving arond a fixed frame. 6
7 v ψ Figre 4: Contact space for block with three degrees of freedom shaded with a niqe color for each contact patch. 7
8 correspond to contact patches (crve segments in two dimensions and srface patches in three). The patch geometry encodes the motion constraint and the patch bondary encodes the contact change conditions. Part motions correspond to paths in configration space. A path is legal if it lies in free and contact space, bt illegal if it intersects blocked space. Contacts occr at configrations where the path crosses from free to contact space, break where it crosses from contact to free space, and change where it crosses between neighboring contact patches. The configration space representation generalizes from pairs of parts to systems with more than two parts. A system of n planar parts has a 3n-dimensional configration space whose points specify the n part configrations. A system configration is free when no parts toch, is blocked when two parts overlap, and is in contact when two parts toch and no parts overlap. System configration spaces allow s to analyze mlti-part interactions, sch as the motion relation between the driver and the ratchet in the ratchet mechanism. They are often impractical to compte and are not needed for the design tasks that we discss. 3 Configration space comptation Configration space comptation has algebraic and combinatorial components. The algebraic task is to derive the contact constraint for a pair of featres and to compte the reslting contact patch. The combinatorial task is to compte the configration space partition, which is determined by contact patch intersections. Both tasks are comptationally expensive and difficlt to implement for general shapes. The robotics literatre contains many specific configration space comptation algorithms (see [3] for the basic algorithms). That research provides practical algorithms for pairs of polygons and contact constraints for polyhedra. These algorithms do not extend to crved parts becase they rely on the special strctre of polygonal contact spaces, which are made p of rled srface patches generated by vertex/edge contacts. Polygons are fine for path planning, which is the primary robotics application of configration space, bt are inappropriate for mechanical design where precise motion constraints between crved featres are crcial to system fnction. We have developed a fast, robst configration space comptation algorithm for pairs of planar parts whose bondaries are comprised of line segments and of circlar arcs. These featres sffice for most engineering applications. The program distingishes between standard joints, fixed-axes pairs, and general pairs. The standard joint types are revolte, prismatic, and sliding. We have seen revolte joints in the ratchet mechanism; the other types are described in engineering texts. Each standard joint imposes a permanent contact that indces a fixed set of motion constraints, which the program retrieves from a table. Fixed-axes pairs consists of two parts with one degree of freedom apiece. They are analyzed by a fast algorithm that exploits their special strctre. Standard joints and fixed-axes pairs accont for over 90% of planar pairs based on or srvey of 2500 mechanisms [1]. The remaining pairs are analyzed by a general algorithm. Fixed-axes pairs have two-dimensional configration spaces whose coordinates are the motion 8
9 ω 0.15 π θ π Figre 5: Driver/link pair and its configration space. coordinates of the two parts. For example, Figre 5 shows the configration space of the driver/link pair. The configration space coordinates are the driver orientation and the link orientation!. The pper and lower contact crves represent contacts between the cylindrical pin and the oter and inner cam profiles. The free space is the region in between. As the driver rotates from = to = 0, its inner profile pshes the link pin right, which rotates the link conter-clockwise from! = 0:47 radians to! = 0:105 radians. As the driver rotates from = 0 to =, the pin breaks contact with the inner profile and makes contact with the oter one, which plls it left and rotates the link clockwise. The configration follows the lower contact crve from = to 0, travels horizontally throgh free space ntil it hits the pper contact crve, and follows it to. The fixed-axes program [4] comptes these two-dimensional configration spaces. The contact crves are obtained from a hand-compted table with one entry for each combination of featre types (line segments, arcs, and points) and motion types (horizontal translation, vertical translation, and rotation), for example a rotating line segment and a circle translating horizontally. The program enmerates the featre pairs, generates their contact crves from the table, discretizes them to an inpt tolerance (0:001 relative accracy in typical engineering applications, and comptes the configration space partition that they indce. The connected component that contains the initial configration is the reachable portion of the configration space. The program handles any realistic pair in well nder one second (100,000 contacts in 0.1 seconds on a workstation). The general program [5] comptes three-dimensional configration spaces. The contact patches are implicit, the patch bondary crves are parametric, and the contact space is in bondary representation. The patches and crves are obtained from a hand-compted table as before. The partition is compted with a planar line sweep by dimension redction. The entire comptation is exact. The rnning time is nder one minte for every pair that we have tested, inclding ones with 10,000 contacts. Figre 6 shows the three-dimensional configration space of the ratchet moving relative to the pawl. Althogh hard to visalize, it encodes a fll contact analysis. Let s examine the slice in 9
10 v 30 ψ (a) (b) (c) Figre 6: (a) Ratchet/pawl pair; (b) configration space slice at = 0:277 radians; (c) contact space; the inner region is blocked space, the oter region free space. -30 v the figre, which shows how the ratchet translates in the displayed orientation. The dot marks the displayed position of the ratchet relative to the pawl. It lies on a contact crve that represents contact between the pawl tip and the side of a ratchet tooth. The right end of the crve is the intersection point with a second contact crve that represents contact between the left corner of the pawl and the next tooth conter-clockwise. The ratchet can maintain this contact while translating right ntil the second contact occrs and frther translation is blocked. Rotation can only be expressed in the fll configration space. 4 Dynamical simlation Configration spaces spport a novel form of dynamical simlation that is well-sited to mechanical design. Dynamical simlation consists of compting the motions of the parts in accordance with Newton s laws. It is an important design tool for those aspects of system fnction that depend on dynamical effects, sch as inertia, friction, and gravity. It provides loads for finite-element analysis: a nmerical analysis of part interactions that lie otside the rigid-body idealization, sch as deformation and stress. We illstrate simlation on the ratchet mechanism. The external forces are a motor that rotates the driver, a torsional spring that rotates the pawl conterclockwise, and the weight of the pawl. A short simlation shows that the first cycle appears correct (Figre 1). Bt a longer simlation reveals a problem: the ratchet rotates faster at every cycle becase of the repeated pawl impacts. We can correct this problem by adding an external load or internal damping to the ratchet. Frther simlation tests how strong a spring is needed to maintain the pawl/ratchet contact with varios driving torqes. Contact analysis is a prereqisite for simlation becase contacts create forces that effect part motion. The simlator needs to know which part featres toch at every instant and when contact 10
11 changes occr. Given this information, it can compte the contact forces, combine them with the external forces, compte the part accelerations from Newton s laws, and nmerically integrate them to obtain the part configrations and velocities at the next time step. At each time step, the simlator checks for contact changes since the previos step, which force it to back p to the change time and pdate the contact eqations. Manal analysis is practical for systems with permanent contacts [6] and is implemented in commercial simlators [2], bt atomated analysis is crcial for systems with many contact changes. We have developed a simlator that ses configration spaces for atomated contact analysis [7]. The configration spaces of the interacting pairs are compted before the simlation. At each time step, the simlator qeries them for the contact data for contact force comptation. It tests for part collisions and contact changes between steps by qerying the configration spaces for transitions between free and contact space or between contact patches. We have simlated systems with tens of moving parts at interactive speeds. The largest simlation to date is a chain assembly with two gears, a 34-link chain connected by pin joints, and 68 link/gear higher pairs. An alternate approach, developed primarily in graphics research [8], is to test all pairs of parts for collisions at each time step. The test can be extremely fast even for large systems. The disadvantages for mechanical systems are that crrent algorithms do not handle crved parts and are inefficient when the parts are close together and interact often. The main advantage of collision detection algorithms is that they handle three-dimensional parts. 5 Tolerance analysis Configration spaces spport atomated tolerance analysis of mechanical systems. The task is to compte the variation in the system fnction de to manfactring variation in the parts. If we se parametric part models, the part variations can be represented as intervals arond the nominal parameter vales. In the ratchet mechanism, the parameters wold inclde the driver radis and eccentricity, the link length, the pawl length and tip angle, and the ratchet tooth length and slant. The analysis can be qalitative, qantitative, or statistical. Qalitative analysis tells s if the part parameter variations can case nintended contact effects, for example if the pawl can hit the frame or can fail to advance the ratchet. This analysis mst be performed first becase it provides the contact constraints for the other types. Qantitative analysis gives s the derivatives of the part configrations with respect to the parameters, which allows s to compte the maximal error in system fnction. Statistical analysis estimates the fraction of mechanisms that will fail. Tolerance analysis prespposes contact analysis becase the variation in the system fnction arises from variations in the part contact constraints. We need to know which contacts occr at each stage of the work cycle and how their constraints depend on the part parameters. Manal analysis is often infeasible becase of the many contacts and the complex relations between part parameters and contact constraints. We have developed a tolerance analysis algorithm for planar systems based on a generalization of configration space to parametric parts [9]. The algorithm 11
12 ω 0.12 θ 0.75 Figre 7: Detail of driver/link generalized configration space. performs qantitative and statistical analyses and helps designers perform qalitative analysis. It analyzes systems with 50 to 100 parameters in a few mintes, which permits interactive tolerancing of detailed fnctional models. Figre 7 shows a generalized configration space for the driver/link pair of the ratchet mechanism: colored crves sperimposed on the nominal configration space. The red and green crves are pper and lower bonds on the variation in the contact space de to the part variations. If the part parameters are in their tolerance intervals, the contact space mst be between these crves. The channel between the top green crve and the bottom red crve represents the worst-case pin clearance. It is smallest at = 0 where the pin is at its rightmost position and largest where the pin is at its leftmost position. Increasing the part tolerances brings these crves closer. When they meet, the the qalitative mechanism fnction alters (a failre mode) becase the pin cannot complete its cycle. 6 Conclsion We have seen that configration space comptation is a practical algorithm for contact analysis of planar mechanical systems and for the related design tasks of dynamical simlation and tolerance analysis. We have tested the algorithms on dozens of mechanical systems, inclding the gearshift of an atomotive transmission and varios micro-mechanisms. Or ltimate goal is to develop an atomated configration space-based program to spport the design engineer in all the steps of design. We are crrently psing research in spatial contact analysis, tolerance synthesis, interactive 12
13 parametric design, and configration space visalization. The next step in or contact analysis research is configration space comptation for pairs of three-dimensional parts. We have already developed an algorithm for pairs of rigid parts that move along fixed spatial axes and whose shapes are formed by planes, cylinders, or spheres [10]. Since we do not believe that the general spatial case, which reqires compting six-dimensional configration spaces (each part has three rotations and three translations) is tractable, we are focsing on on specialized algorithms for important special cases. For tolerance synthesis, we plan to se or tolerance space approach to compte the variability cost of each contact in the nominal contact seqence and atomatically derive the eqations and optimization fnctions for nonlinear optimization to obtain the best tolerance allocation. We will se the parametric contact fnctions and sensitivity analysis derived in or existing tolerance analysis algorithm. For parametric design we plan to develop algorithms that allow interactively inverting the mapping from parameter vales to configration spaces. The goal is to allow the designer to modify a configration space interactively while the design program pdates the assembly to realize the changing kinematics. Compter visalization is a powerfl tool for nderstanding the qalitative strctre of complex configration spaces. We are developing cstom visalization software that elcidates this strctre with graphics techniqes, sch as shading and color, and by correlating the configration space geometry with the system kinematics, for example by highlighting the part featres that generate a selected contact patch [11]. Acknowledgments Sacks is spported by NSF grants CCR and CCR and by the Prde Center for Comptational Image Analysis and Scientific Visalization. Joskowicz is spported by a grant from the Athority for Research and Development, The Hebrew University of Jersalem, Israel. Sacks and Joskowicz are spported by a Ford University Research Grant, the Ford ADAPT200 project, and by grant 98/536 from the Israeli Academy of Science. References [1] Leo Joskowicz and Elisha Sacks. Comptational kinematics. Artificial Intelligence, 51: , [2] W. Schiehlen. Mltibody systems handbook. Springer-Verlag, [3] Jean-Clade Latombe. Robot Motion Planning. Klwer Academic Pblishers,
14 [4] Elisha Sacks and Leo Joskowicz. Comptational kinematic analysis of higher pairs with mltiple contacts. Jornal of Mechanical Design, 117: , [5] Elisha Sacks. Practical sliced configration spaces for crved planar pairs. International Jornal of Robotics Research, 17(11), [6] Edward J. Hag. Compter-Aided Kinematics and Dynamics of Mechanical Systems, volme I: Basic Methods. Simon and Schster, [7] Elisha Sacks and Leo Joskowicz. Dynamical simlation of planar systems with changing contacts sing configration spaces. Jornal of Mechanical Design, 120: , [8] Ming C. Lin, Dinesh Manocha, Jon Cohen, and Stefan Gottschalk. Collision detection: Algorithms and applications. In Jean-Pal Lamond and Mark Overmars, editors, Algorithms for Robotic Motion and Maniplation. A. K. Peters, Boston, MA, [9] Elisha Sacks and Leo Joskowicz. Parametric kinematic tolerance analysis of general planar systems. Compter-Aided Design, 30(9): , [10] Iddo Drori, Leo Joskowicz, and Elisha Sacks. Spatial contact analysis of fixed-axes pairs sing configration spaces. In IEEE Conference on Robotics and Atomation, [11] Elisha Sacks and Leo Joskowicz. Configration space visalization for mechanical design. In Proceedings of Visalization 98 Conference, Research Triangle Park, NC,
A sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationMaster for Co-Simulation Using FMI
Master for Co-Simlation Using FMI Jens Bastian Christoph Claß Ssann Wolf Peter Schneider Franhofer Institte for Integrated Circits IIS / Design Atomation Division EAS Zenerstraße 38, 69 Dresden, Germany
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationAugmenting the edge connectivity of planar straight line graphs to three
Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight
More informationarxiv: v1 [cs.cg] 27 Nov 2015
On Visibility Representations of Non-planar Graphs Therese Biedl 1, Giseppe Liotta 2, Fabrizio Montecchiani 2 David R. Cheriton School of Compter Science, University of Waterloo, Canada biedl@waterloo.ca
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationThe Impact of Avatar Mobility on Distributed Server Assignment for Delivering Mobile Immersive Communication Environment
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the ICC 27 proceedings. The Impact of Avatar Mobility on Distribted Server Assignment
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationNash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns.
Convergence of Gradient Dynamics in General-Sm Games Satinder Singh AT&T Labs Florham Park, NJ 7932 bavejaresearch.att.com Michael Kearns AT&T Labs Florham Park, NJ 7932 mkearnsresearch.att.com Yishay
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationThe Intersection of Two Ringed Surfaces and Some Related Problems
Graphical Models 63, 8 44 001) doi:10.1006/gmod.001.0553, available online at http://www.idealibrary.com on The Intersection of Two Ringed Srfaces and Some Related Problems Hee-Seok Heo and Sng Je Hong
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More informationTopological Drawings of Complete Bipartite Graphs
Topological Drawings of Complete Bipartite Graphs Jean Cardinal Stefan Felsner y Febrary 017 Abstract Topological drawings are natral representations of graphs in the plane, where vertices are represented
More informationPARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT
PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies
More informationABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS
Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining
More informationAAA CENTER FOR DRIVING SAFETY & TECHNOLOGY
AAA CENTER FOR DRIVING SAFETY & TECHNOLOGY 2017 FORD MUSTANG PREMIUM CONVERTIBLE INFOTAINMENT SYSTEM* DEMAND RATING Very High Demand The Ford Mstang Convertible s SYNC 3 (version 2.20) infotainment system
More informationIntroduction to Computational Manifolds and Applications
IMPA - Institto de Matemática Pra e Aplicada, Rio de Janeiro, RJ, Brazil Introdction to Comptational Manifolds and Applications Part 1 - Constrctions Prof. Marcelo Ferreira Siqeira mfsiqeira@dimap.frn.br
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationEECS 487: Interactive Computer Graphics f
Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationTdb: A Source-level Debugger for Dynamically Translated Programs
Tdb: A Sorce-level Debgger for Dynamically Translated Programs Naveen Kmar, Brce R. Childers, and Mary Lo Soffa Department of Compter Science University of Pittsbrgh Pittsbrgh, Pennsylvania 15260 {naveen,
More informationCS 153 Design of Operating Systems Spring 18
CS 53 Design of Operating Systems Spring 8 Lectre 2: Virtal Memory Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Recap: cache Well-written programs exhibit
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationAdvanced Techniques for Predicting Mechanical Product Design via COMSOL Multiphysics
Advanced Techniqes for Predicting Mechanical Prodct Design via COMSOL Mltiphsics Shobing Zhang 1 1 CAEaid, Inc. *Corresponding athor: 184 Jeffs Ln, Astin, TX 78717, shobing.hang@caeaid.com Abstract: Mechanical
More informationObject Pose from a Single Image
Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the
More informationAutomating scientific and engineering computing
Automating scientific and engineering computing Elisha Sacks* Computer Science Department Princeton University Princeton, NJ 08544 Leo Joskowicz IBM T. J. Watson Research Center P.O. Box 704 Yorktown Heights,
More informationh-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationTri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
Tri-Edge-Connectivity Agmentation for Planar Straight Line Graphs Marwan Al-Jbeh 1, Mashhood Ishaqe 1, Kristóf Rédei 1, Diane L. Sovaine 1, and Csaba D. Tóth 1,2 1 Department of Compter Science, Tfts University,
More informationMaximum Weight Independent Sets in an Infinite Plane
Maximm Weight Independent Sets in an Infinite Plane Jarno Nosiainen, Jorma Virtamo, Pasi Lassila jarno.nosiainen@tkk.fi, jorma.virtamo@tkk.fi, pasi.lassila@tkk.fi Department of Commnications and Networking
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationWhat s New in AppSense Management Suite Version 7.0?
What s New in AMS V7.0 What s New in AppSense Management Site Version 7.0? AppSense Management Site Version 7.0 is the latest version of the AppSense prodct range and comprises three prodct components,
More informationTriangle-Free Planar Graphs as Segments Intersection Graphs
Triangle-ree Planar Graphs as Segments Intersection Graphs N. de Castro 1,.J.Cobos 1, J.C. Dana 1,A.Márqez 1, and M. Noy 2 1 Departamento de Matemática Aplicada I Universidad de Sevilla, Spain {natalia,cobos,dana,almar}@cica.es
More informationRequirements Engineering. Objectives. System requirements. Types of requirements. FAQS about requirements. Requirements problems
Reqirements Engineering Objectives An introdction to reqirements Gerald Kotonya and Ian Sommerville To introdce the notion of system reqirements and the reqirements process. To explain how reqirements
More informationMethod to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot
Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,
More informationLesson 1: Introduction to Pro/MECHANICA Motion
Lesson 1: Introduction to Pro/MECHANICA Motion 1.1 Overview of the Lesson The purpose of this lesson is to provide you with a brief overview of Pro/MECHANICA Motion, also called Motion in this book. Motion
More informationThe Configuration Space Method for Kinematic Design of Mechanisms
The Configuration Space Method for Kinematic Design of Mechanisms Elisha Sacks and Leo Joskowicz The MIT Press Cambridge, Massachusetts London, England ( 2010 Massachusetts Institute of Technology All
More informationAppearance Based Tracking with Background Subtraction
The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic
More informationarxiv: v1 [cs.cg] 26 Sep 2018
Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationThis chapter is based on the following sources, which are all recommended reading:
Bioinformatics I, WS 09-10, D. Hson, December 7, 2009 105 6 Fast String Matching This chapter is based on the following sorces, which are all recommended reading: 1. An earlier version of this chapter
More informationIsilon InsightIQ. Version 2.5. User Guide
Isilon InsightIQ Version 2.5 User Gide Pblished March, 2014 Copyright 2010-2014 EMC Corporation. All rights reserved. EMC believes the information in this pblication is accrate as of its pblication date.
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationA RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA
A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA Mei Zho*, Ling-li Tang, Chan-rong Li, Zhi Peng, Jing-mei Li Academy of Opto-Electronics, Chinese Academy of Sciences, No.9, Dengzhang
More informationIDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION
ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra
More informationDiscrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationStereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection
Stereo Matching and 3D Visalization for Gamma-Ray Cargo Inspection Zhigang Zh *ab, Y-Chi H bc a Department of Compter Science, The City College of New York, New York, NY 3 b Department of Compter Science,
More informationA GENERIC MODEL OF A BASE-ISOLATED BUILDING
Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes
More informationAlliances and Bisection Width for Planar Graphs
Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.
More informationPLANNING TRAJECTORY OF THE MOBILE ROBOT WITH A CAMERA
6TH DAAAM INTERNATIONAL SYMPOSIUM ON INTELLIGENT MANUFACTURING AND AUTOMATION PLANNING TRAJECTORY OF THE MOBILE ROBOT WITH A CAMERA Alexey Katsrin Abstract Institte of Atomation and Control Processes,
More informationPavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003
From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information
More informationMaximal Cliques in Unit Disk Graphs: Polynomial Approximation
Maximal Cliqes in Unit Disk Graphs: Polynomial Approximation Rajarshi Gpta, Jean Walrand, Oliier Goldschmidt 2 Department of Electrical Engineering and Compter Science Uniersity of California, Berkeley,
More informationSTABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION
STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWOR DYNAMICS FOR STATIC OPTIMIZATION Grsel Serpen and Yifeng X Electrical Engineering and Compter Science Department, The University of Toledo, Toledo, OH
More informationComputer User s Guide 4.0
Compter User s Gide 4.0 2001 Glenn A. Miller, All rights reserved 2 The SASSI Compter User s Gide 4.0 Table of Contents Chapter 1 Introdction...3 Chapter 2 Installation and Start Up...5 System Reqirements
More informationOn Plane Constrained Bounded-Degree Spanners
Algorithmica manscript No. (ill be inserted by the editor) 1 On Plane Constrained Bonded-Degree Spanners 2 3 Prosenjit Bose Rolf Fagerberg André an Renssen Sander Verdonschot 4 5 Receied: date / Accepted:
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationAn Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna
More informationEstimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function
Proceedings 999 IEEE Conf. on Compter Vision and Pattern Recognition, pp. 87-9 Estimating Model Parameters and Bondaries By Minimiing a Joint, Robst Objective Fnction Charles V. Stewart Kishore Bbna Amitha
More informationPipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,
More informationMETAPOST and the FIIT Logo
METAPOST and the FIIT Logo Matej KOŠÍK Slovak University of Technology Faclty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovakia kosik@fiit.stba.sk 1 The Tools Abstract.
More informationA personalized search using a semantic distance measure in a graph-based ranking model
Article A personalized search sing a semantic distance measre in a graph-based ranking model Jornal of Information Science XX (X) pp. 1-23 The Athor(s) 2011 Reprints and Permissions: sagepb.co.k/jornalspermissions.nav
More informationGEAR SHAPED CUTTER A PROFILING METHOD DEVELOPED IN GRAPHICAL FORM
HE ANNALS OF DUNAEA DE JOS UNIVESIY OF GALAI FASCICLE V, ECHNOLOGIES IN MACHINE BUILDING, ISSN - 4566, 05 GEA SHAPED CUE A POFILING MEHOD DEVELOPED IN GAPHICAL FOM Nicşor BAOIU, Virgil Gabriel EODO, Camelia
More informationPlenoPatch: Patch-based Plenoptic Image Manipulation
1 PlenoPatch: Patch-based Plenoptic Image Maniplation Fang-Le Zhang, Member, IEEE, Je Wang, Senior Member, IEEE, Eli Shechtman, Member, IEEE, Zi-Ye Zho, Jia-Xin Shi, and Shi-Min H, Member, IEEE Abstract
More informationPlenoPatch: Patch-based Plenoptic Image Manipulation
1 PlenoPatch: Patch-based Plenoptic Image Maniplation Fang-Le Zhang, Member, IEEE, Je Wang, Senior Member, IEEE, Eli Shechtman, Member, IEEE, Zi-Ye Zho, Jia-Xin Shi, and Shi-Min H, Member, IEEE Abstract
More informationEMC AppSync. User Guide. Version REV 01
EMC AppSync Version 1.5.0 User Gide 300-999-948 REV 01 Copyright 2012-2013 EMC Corporation. All rights reserved. Pblished in USA. EMC believes the information in this pblication is accrate as of its pblication
More informationSAMPLE STUDY MATERIAL. Mechanical Engineering. Postal Correspondence Course. Theory of Machines. GATE, IES & PSUs
TOM - ME GATE, IES, PSU 1 SAMPLE STUDY MATERIAL Mechanical Engineering ME Postal Correspondence Course Theory of Machines GATE, IES & PSUs TOM - ME GATE, IES, PSU 2 C O N T E N T TOPIC 1. MACHANISMS AND
More informationCompound Catadioptric Stereo Sensor for Omnidirectional Object Detection
Compond Catadioptric Stereo Sensor for mnidirectional bject Detection Ryske Sagawa Naoki Krita Tomio Echigo Yasshi Yagi The Institte of Scientific and Indstrial Research, saka University 8-1 Mihogaoka,
More informationarxiv: v3 [math.co] 7 Sep 2018
Cts in matchings of 3-connected cbic graphs Kolja Knaer Petr Valicov arxiv:1712.06143v3 [math.co] 7 Sep 2018 September 10, 2018 Abstract We discss conjectres on Hamiltonicity in cbic graphs (Tait, Barnette,
More informationIllumina LIMS. Software Guide. For Research Use Only. Not for use in diagnostic procedures. Document # June 2017 ILLUMINA PROPRIETARY
Illmina LIMS Software Gide Jne 2017 ILLUMINA PROPRIETARY This docment and its contents are proprietary to Illmina, Inc. and its affiliates ("Illmina"), and are intended solely for the contractal se of
More informationResolving Linkage Anomalies in Extracted Software System Models
Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationHigh-order 3D FEM of Prostate Needle Insertion Forces
High-order 3D FEM of Prostate Needle Insertion Forces Anitha Priya Krishnan Department of Biomedical Engineering University of Rochester 6 Elmwood Avene Rochester NY 464 ankrishn@bme.rochester.ed Walter
More informationInteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN:
Inteligencia Artificial. Revista Iberoamericana de Inteligencia Artificial ISSN: 1137-3601 revista@aepia.org Asociación Española para la Inteligencia Artificial España Zaballos, Lis J.; Henning, Gabriela
More informationarxiv: v2 [cs.cg] 5 Aug 2014
The θ 5 -graph is a spanner Prosenjit Bose Pat Morin André van Renssen Sander Verdonschot November 5, 2018 arxiv:12120570v2 [cscg] 5 Ag 2014 Abstract Given a set of points in the plane, e sho that the
More informationUnit Testing with VectorCAST and AUTOSAR
Unit Testing with VectorCAST and AUTOSAR Vector TechDay Software Testing with VectorCAST V1.0 2018-11-15 Agenda Introdction Unit Testing Demo Working with AUTOSAR Generated Code Unit Testing AUTOSAR SWCs
More informationSketch-Based Aesthetic Product Form Exploration from Existing Images Using Piecewise Clothoid Curves
Sketch-Based Aesthetic Prodct Form Exploration from Existing Images Using Piecewise Clothoid Crves Günay Orbay, Mehmet Ersin Yümer, Levent Brak Kara* Mechanical Engineering Department Carnegie Mellon University
More informationEfficient and Accurate Delaunay Triangulation Protocols under Churn
Efficient and Accrate Delanay Trianglation Protocols nder Chrn Dong-Yong Lee and Simon S. Lam Department of Compter Sciences The University of Texas at Astin {dylee, lam}@cs.texas.ed November 9, 2007 Technical
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationRepresenting a Cubic Graph as the Intersection Graph of Axis-parallel Boxes in Three Dimensions
Representing a Cbic Graph as the Intersection Graph of Axis-parallel Boxes in Three Dimensions ABSTRACT Abhijin Adiga Network Dynamics and Simlation Science Laboratory Virginia Bioinformatics Institte,
More informationWEEKS 1-2 MECHANISMS
References WEEKS 1-2 MECHANISMS (METU, Department of Mechanical Engineering) Text Book: Mechanisms Web Page: http://www.me.metu.edu.tr/people/eres/me301/in dex.ht Analitik Çözümlü Örneklerle Mekanizma
More informationThe LS-STAG Method : A new Immersed Boundary / Level-Set Method for the Computation of Incompressible Viscous Flows in Complex Geometries
The LS-STAG Method : A new Immersed Bondary / Level-Set Method for the Comptation of Incompressible Viscos Flows in Complex Geometries Yoann Cheny & Olivier Botella Nancy Universités LEMTA - UMR 7563 (CNRS-INPL-UHP)
More informationNew Architectures for Hierarchical Predictive Control
Preprint, 11th IFAC Symposim on Dynamics and Control of Process Systems, inclding Biosystems Jne 6-8, 216. NTNU, Trondheim, Norway New Architectres for Hierarchical Predictive Control Victor M. Zavala
More informationNETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS
ETWORK PRESERVATIO THROUGH A TOPOLOGY COTROL ALGORITHM FOR WIRELESS MESH ETWORKS F. O. Aron, T. O. Olwal, A. Krien, Y. Hamam Tshwane University of Technology, Pretoria, Soth Africa. Dept of the French
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationEUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name)
Volme X, No. 0X, 200X, X XX Web site: http://www.aimsciences.org EUCLIDEAN SKELETONS USING CLOSEST POINTS Songting Lo Department of Mathematics, University of California, Irvine Irvine, CA 92697-3875,
More informationOn Plane Constrained Bounded-Degree Spanners
On Plane Constrained Bonded-Degree Spanners Prosenjit Bose 1, Rolf Fagerberg 2, André an Renssen 1, Sander Verdonschot 1 1 School of Compter Science, Carleton Uniersity, Ottaa, Canada. Email: jit@scs.carleton.ca,
More informationLocal Run Manager. Software Reference Guide for MiSeqDx
Local Rn Manager Software Reference Gide for MiSeqDx Local Rn Manager Overview 3 Dashboard Overview 4 Administrative Settings and Tasks 7 Workflow Overview 12 Technical Assistance 17 Docment # 1000000011880
More informationCS224W Final Report. 1 Introduction. 3 Data Collection and Visualization. 2 Prior Work. Cyprien de Lichy, Renke Pan, Zheng Wu.
CS224W Final Report Cyprien de Lichy, Renke Pan, Zheng W 1 Introdction December 9, 2015 Recommender systems are information filtering systems that provide sers with personalized sggestions for prodcts
More information