La mise au point a distance

Bonjour,
J'ai Labview 10 sous WinXp,
je désire créer des exécutables avec mise au point à distance.
J'ai suivi le tutoriel:
http://digital.ni.com/public.nsf/websearch/7F95D43​D3F50FCAC8625710E000068E1?opendocument&Submitted&&​...
Ca fonctionne en local, mais pas en distant...
J'ai désactivé les deux par-feu, local et distant.
Mais ça ne fonctionne pas.
Avez-vous déjà eu ce problème?
Cordialement 
Emmanuel
Pièces jointes :
REMOTE DEBUG.zip ‏136 KB

Le lien de votre post indique une connexion au serveur Web via une page Html (WebServer.Enabled) et pas le serveur de debug (DebugServerEnabled). Voulez-vous faire une prise de contrôle à distance via le serveur web ?
En local il suffit de connaître l’IP du PC serveur par exemple http://192.168.1.2/MaPageWeb.html
En distant cela est plus compliqué car cela signifie que vous passez par un routeur via internet, il faut donc indiquer dans l’adresse html l’IP public du routeur (et pas l’IP privé du PC). De plus dans le routeur, il fait rediriger le port 80 du serveur Web vers l’adresse du PC LabVIEW dans le réseau privé.
Luc Desruelle | Voir mon profil | LabVIEW Code & blog
Co-auteur livre LabVIEW : Programmation et applications
CLA : Certified LabVIEW Architect / Certifié Architecte LabVIEW
CLD : Certified LabVIEW Developer / Certifié Développeur LabVIEW

Similar Messages

  • Activation de la Mise au point

    Bonjour,
    je cherche à activer la mise au point à distance d'une application Labview.
    Je suis sous LV2010, en version professionnelle.
    J'ai suivi la documentation mais je suis confronté à un problème.
    1.Construction de l'executable
    Dans les propriétés d'activation, j'ai selectionné Avancé/Activer la mise au point.
    J'ai construit l'executable : pas de problème.
    2. Lorsque je lance cet executable, j'ai le message d'erreur suivant :
    Echec du démarrage du serveur de mise au point.
    Je n'ai pas de firewall activé (même si j'avais créer l'exception sur le port 3580).
    Faut-il une license particulière ?
    Avez-vous des idées quand à l'origine de ce problème ?
    Cordialement,
    Frédéric

    Bonjour Ffx,
    Votre executable fonctionne-t-il correctement en local, sur votre ordinateur de développement?
    Autrement, sur le PC dédié à executer l'executable, avez-vous pensé à installer le RunTime standard? Vous pouvez le télécharger ici et l'installer sur le PC cible.
    Concernant l'utilisation d'un executable en mode debug, je vous encourage également à prendre connaissance des informations présentes depuis notre site internet sur le sujet: Remotely Debugging Executables in LabVIEW
    Cordialement,
    Rémi D.
    National Instruments France
    #adMrkt{text-align: center;font-size:11px; font-weight: bold;} #adMrkt a {text-decoration: none;} #adMrkt a:hover{font-size: 9px;} #adMrkt a span{display: none;} #adMrkt a:hover span{display: block;}
    >> Les rencontres techniques de NI - Mesures et acquisition de données : de la théorie à la mise en ...

  • How to find a second point on a line given a point and distance

    Hi All,
    My requirement is: Given a point on a line and distance, I have to find the second point. All geometries are in LRS.
    I tried using SDO_LRS.LOCATE_PT, it is returning the second point from the start of the segment but I want to locate the point from the given start point. Kindly suggest in how to solve this.
    SQL Used:
    SELECT SDO_LRS.LOCATE_PT(a.shape, m.diminfo, 9, 0)
    FROM lrs_access_fiber a, user_sdo_geom_metadata m
    WHERE m.table_name = 'LRS_ACCESS_FIBER' AND m.column_name = 'SHAPE' AND a.unique_id = 1996;
    Regards
    Venkat

    Hi Luc,
    Thanks for the information. I have implemented this in a slightly different way like:
    1. Firstly, found the distance (Distance_a of the point selected from the start point of the segment using:
    SELECT SDO_LRS.GET_MEASURE(SDO_LRS.PROJECT_PT(a.shape, m.diminfo,MDSYS.SDO_GEOMETRY(2301, 8307, NULL, MDSYS.SDO_ELEM_INFO_ARRAY(1, 1, 1), MDSYS.SDO_ORDINATE_ARRAY(xa,ya, NULL)) ), m.diminfo ) into Distance_a FROM LRS_ACCESS_FIBER a, user_sdo_geom_metadata m WHERE m.table_name = 'LRS_ACCESS_FIBER' AND m.column_name = 'SHAPE' AND a.unique_id = Input_Fiber_Id;
    2. Then added the given distance (b) to this computed distance (Distance_a ) to get the distance of the second point (Distance_b).
    Distance_b := abs (Distance_a + b);
    3. Then used SDO_LRS.LOCATE_PT with offset=0 and distance=Distance_b to get the second point.
    select SDO_LRS.LOCATE_PT(a.shape, distance_pt, 0) into point_geometry from LRS_ACCESS_FIBER a where a.unique_id = input_fiber_id;
    Please give your inputs and feedback.
    Regards
    Venkat

  • Mapping points on distance?

    Does anyone know of java program that can take a matrix of distances between some places and map these places by plotting them?
    For example, if I have the matrix
         A     B     C     D
    A    0     12    3      6
    B   12     0     4      7
    C    3     4     0      9
    D    6     7      9      0then I would like to be able to plot the points that represent A B C and D somehow.
    Any ideas?
    Thanks
    Andy

    Just convert the points into screen space using simple math.I think the problem is that the OP doesn't have the coordinates of the points. Once you have them the maths is simple - but how do you go from a set of distances between adjacent points to a (plausible) set of coordinates?
    In order to be plottable at all - as points in a 2D Euclidean space - these distances have to obey various rules: like AtoB=BtoA, AtoBtoC>=AtoC>0.
    Maybe someone has a link to a discussion of an alogrithm for this. You could begin by putting the first two points anywhere. Trigonometry provides two options for the third point (so the resulting maps are mirror images). Then add the others based on some more trig and the distances given to the first three.
    Sorry about the [Edits]

  • Add Anchor Points by Distance?

    I often need to add anchor points to a shape when I bring it into Cinema 4D to extrude and warp.
    The Object>Path>Add Anchor Points just adds an additional anchor between existing anchor points, effectively doubling the density every time its run.
    This isn't great for shapes with very long segments and very short segments. The short segments don't need subdividing, but the long segments need more subdivisions.
    Is there a script or plug-in that can add anchor points based on distance? Such as: Add an extra anchor point to a path every 10 mm?

    Navarro,
    You may do it in this roundabout way:
    1) Select the object and Select>Object>Direction Handles;
    2) Ctrl/Cmd+X to Cut;
    3) Press Delete;
    4) Ctrl/Cmd+F to Paste in Front;
    Now you have changed the path segments into separate paths;
    5) For each (path segment) path apply Object>Path>Add Anchor Points as needed or maybe (depending on version) use the more versatile free Divide script, see below;
    6) Select the paths and Ctrl/Cmd+J to join them (use Direct Selection in older versions).
    With the rectangle shown, it would be changed into two long horizontal paths and two short vertical ones; you can select each pair and add Anchor Points, or maybe just leave the vertical ones as they are.
    You may download the Divide script here:
    http://park12.wakwak.com/~shp/lc/et/en_aics_script.html

  • How to create multiple expanding outlines with all points equal distance to original shape?

    Here's an extremely simple example.. It works with a circle or a square, obviously because it has the same height and width. The problem is when you have irregular shapes, (or in this case, an oval). I know I've seen solutions to this in the past, but I just can't think of how to word this question and find them again.
    I know you can create multiple strokes for an object in the appearance palette, but I'm looking for something more effective than just having colored stroke > white stroke > colored stroke> white stroke > etc.
    Here's a couple examples of the kind of effect I'm looking for.
    Any help would be greatly appreciated.

    You need to use Offset path. Object>Path>Offset path. Use negative numbers to go inside of an existing shape, positive to go outside.
    [ signature removed by forum host - advertising is not permitted ]

  • Point in a CubicCurve2D - Not in the boundary of the shape

    Hello, I have a problem, because I wanna know, when a point is in the CubicCurve2D line (not inside the boundary of the shape), but I just find on the API when the point is inside the boundary of the shape... Some idea??
    Thanks,
    Javi.

    import java.awt.*;
    import java.awt.event.*;
    import java.awt.geom.*;
    import javax.swing.*;
    import javax.swing.event.MouseInputAdapter;
    public class WalkTheLine extends JPanel
        CubicCurve2D curve;
        Point2D.Double[] points;
        Point2D.Double hit;
        public WalkTheLine()
            double x1 = 100;
            double y1 = 90;
            double ctrlx1 = 100;
            double ctrly1 = 270;
            double ctrlx2 = 300;
            double ctrly2 = 90;
            double x2 = 300;
            double y2 = 270;
            points = new Point2D.Double[4];
            points[0] = new Point2D.Double(x1, y1);
            points[1] = new Point2D.Double(ctrlx1, ctrly1);
            points[2] = new Point2D.Double(ctrlx2, ctrly2);
            points[3] = new Point2D.Double(x2, y2);
            curve = new CubicCurve2D.Double();
            curve.setCurve(points, 0);
            hit = new Point2D.Double();
        protected void paintComponent(Graphics g)
            super.paintComponent(g);
            Graphics2D g2 = (Graphics2D)g;
            g2.setRenderingHint(RenderingHints.KEY_ANTIALIASING,
                                RenderingHints.VALUE_ANTIALIAS_ON);
            g2.setPaint(Color.blue);
            g2.draw(curve);
            g2.setPaint(Color.red);
            for(Point2D.Double p : points)
                g2.fill(new Ellipse2D.Double(p.x-2, p.y-2, 4, 4));
            g2.setPaint(Color.green.darker());
            g2.fill(new Ellipse2D.Double(hit.x-2, hit.y-2, 4, 4));
        public void setPoint(int index, double x, double y)
            points[index].setLocation(x, y);
            curve.setCurve(points, 0);
            repaint();
        public void setHit(Point p)
            hit.setLocation(p);
            repaint();
        public static void main(String[] args)
            WalkTheLine walkTheLine = new WalkTheLine();
            PointMover mover = new PointMover(walkTheLine);
            walkTheLine.addMouseListener(mover);
            walkTheLine.addMouseMotionListener(mover);
            JFrame f = new JFrame(walkTheLine.getClass().getName());
            f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
            f.add(walkTheLine);
            f.add(mover.getControlPanel(), "South");
            f.setSize(400,400);
            f.setLocation(200,200);
            f.setVisible(true);
    class PointMover extends MouseInputAdapter
        WalkTheLine walkTheLine;
        int selectedIndex;
        Point2D.Double offset;
        boolean dragging;
        int methodFlag;
        final int MIN_DISTANCE = 5;
        final int ITERATOR   = 0;
        final int PARAMETRIC = 1;
        public PointMover(WalkTheLine wtl)
            walkTheLine = wtl;
            offset = new Point2D.Double();
            dragging = false;
            methodFlag = ITERATOR;
        private boolean isOnCurve(Point p)
            switch(methodFlag)
                case ITERATOR:   return withIterator(p);
                case PARAMETRIC: return withParametric(p);
                default: return false;
        private boolean withIterator(Point p)
            // flatness ~ number of segments for initial curve:
            //     0.001 ~ 463;  0.01 ~ 199;  0.1 ~ 57
            PathIterator pit = walkTheLine.curve.getPathIterator(null, 0.001);
            double[] coords = new double[6];
            Point2D.Double next = new Point2D.Double();
            double minDist = 1.75;
            while(!pit.isDone())
                int type = pit.currentSegment(coords);
                switch(type)
                    case PathIterator.SEG_MOVETO:
                    case PathIterator.SEG_LINETO:
                        next.x = coords[0];
                        next.y = coords[1];
                        break;
                    case PathIterator.SEG_QUADTO:  break;
                    case PathIterator.SEG_CUBICTO: break;
                    case PathIterator.SEG_CLOSE:   break;
                    default:
                        System.out.println("unexpected type: " + type);
                if(next.distance(p) < minDist)
                    return true;
                pit.next();
           return false;
         *  from: PathIterator.SEG_CUBETO
         *  P(t) = B(3,0)*CP + B(3,1)*P1 + B(3,2)*P2 + B(3,3)*P3
         *  0 <= t <= 1
         *  B(n,m) = mth coefficient of nth degree Bernstein polynomial
         *         = C(n,m) * t^(m) * (1 - t)^(n-m)
         *  C(n,m) = Combinations of n things, taken m at a time
         *         = n! / (m! * (n-m)!)
        private boolean withParametric(Point p)
            Point2D.Double[] points = walkTheLine.points;
            int w = walkTheLine.getWidth();
            double minDist = 1.75;
            Point2D.Double next = new Point2D.Double();
            for(int j = 0; j <= w; j++)
                double t = (double)j/w;
                next.x = B(3,0,t)*points[0].x + B(3,1,t)*points[1].x +
                         B(3,2,t)*points[2].x + B(3,3,t)*points[3].x;
                next.y = B(3,0,t)*points[0].y + B(3,1,t)*points[1].y +
                         B(3,2,t)*points[2].y + B(3,3,t)*points[3].y;
                if(next.distance(p) < minDist)
                    return true;
            return false;
        private double B(int n, int m, double t)
            int c = factorial(n) / (factorial(m) * factorial(n-m));
            return c * Math.pow(t,m) * Math.pow(1.0 - t, n-m);
        private int factorial(int n)
            return n > 1 ? n*factorial(n-1) : n == 0 ? 1 : n;
        public void mouseMoved(MouseEvent e)
            Point p = e.getPoint();
            Point2D.Double hit = walkTheLine.hit;
            if(isOnCurve(p))
                walkTheLine.setHit(p);
        public void mousePressed(MouseEvent e)
            Point p = e.getPoint();
            Point2D.Double[] points = walkTheLine.points;
            for(int j = 0; j < points.length; j++)
                if(points[j].distance(p) < MIN_DISTANCE)
                    selectedIndex = j;
                    offset.x = p.x - points[j].x;
                    offset.y = p.y - points[j].y;
                    dragging = true;
                    break;
        public void mouseReleased(MouseEvent e)
            dragging = false;
        public void mouseDragged(MouseEvent e)
            if(dragging)
                double x = e.getX() - offset.x;
                double y = e.getY() - offset.y;
                walkTheLine.setPoint(selectedIndex, x, y);
        protected JPanel getControlPanel()
            String[] ids = { "iterator", "parametric" };
            JPanel panel = new JPanel();
            ButtonGroup group = new ButtonGroup();
            ActionListener l = new ActionListener()
                public void actionPerformed(ActionEvent e)
                    JRadioButton rb = (JRadioButton)e.getSource();
                    String ac = rb.getActionCommand();
                    if(ac.equals("iterator"))
                        methodFlag = ITERATOR;
                    if(ac.equals("parametric"))
                        methodFlag = PARAMETRIC;
            for(int j = 0; j < ids.length; j++)
                JRadioButton rb = new JRadioButton(ids[j], j==0);
                rb.setActionCommand(ids[j]);
                rb.addActionListener(l);
                group.add(rb);
                panel.add(rb);
            return panel;
    }

  • Can both Locator & spatial store three point curves or arcs?

    1) can both Oracle Locator and Oracle Spatial store three pint curves or arcs?
    2) Can both Oracle Locator and Oracle Spatial receive input of bearing / distance to creat a line segment?

    hmmm, i got this exact question in mail today. someone is double-dipping!
    Both Locator and Spatial allow storage of three point circular arcs. Circular arcs are only supported in non-geodetic coordinate systems.
    In Oracle 10g Release 2 both Locator and Spatial include a function called sdo_util.point_at_bearing. If you enter a point, a distance, and a bearing (in radians) we return the end point. With the end point and the original input point a line segment can be contructed very easily.

  • Problem!!! Moving point along the line

    hi,
    I need to move the point along the line. I want move this point using mouse.
    My program draws a line and a point that' s on this line.
    Could someone help me.

    import java.awt.*;
    import java.awt.event.*;
    import java.awt.geom.*;
    import javax.swing.*;
    import javax.swing.event.MouseInputAdapter;
    public class TraverseAgain extends JPanel {
        Point2D.Double[] points;
        Point2D.Double p1;
        Point2D.Double p2;
        /** An endPoint of one of the lines is being moved. */
        public void setEndPoint(int index, double x, double y) {
            int start;
            double ratio;
            switch(index) {
                case 0:
                    start = index == 0 ? 1 : 0;
                    ratio = getRatio(p1, start, index);
                    resetMidPoint(p1, points[start], x, y, ratio);
                    break;
                case 1:
                    start = index == 0 ? 1 : 0;
                    ratio = getRatio(p1, start, index);
                    resetMidPoint(p1, points[start], x, y, ratio);
                    start = index == 1 ? 2 : 1;
                    ratio = getRatio(p2, start, index);
                    resetMidPoint(p2, points[start], x, y, ratio);
                    break;
                case 2:
                    start = index == 1 ? 2 : 1;
                    ratio = getRatio(p2, start, index);
                    resetMidPoint(p2, points[start], x, y, ratio);
                    break;
                default:
                    System.out.println("illegal index: " + index);
            points[index].setLocation(x, y);
            repaint();
         * Design assumption/decision:
         * Preserve this ratio when repositioning a midPoint between the
         * end points of its line when one of the end points is being moved.
        private double getRatio(Point2D.Double p, int start, int end) {
            double d1 = points[start].distance(p);
            double d2 = points[start].distance(points[end]);
            return d1 / d2;
        private void resetMidPoint(Point2D.Double p, Point2D.Double end,
                                   double x, double y, double ratio) {
            double dy = y - end.y;
            double dx = x - end.x;
            double theta = Math.atan2(dy, dx);
            double length = end.distance(x, y);
            x = end.x + length*ratio*Math.cos(theta);
            y = end.y + length*ratio*Math.sin(theta);
            p.setLocation(x, y);
        /** A midPoint is being moved. */
        public void setMidPoint(int number, double x, double y) {
            switch(number) {
                case 1:
                    double dx = points[1].x - points[0].x;
                    double dy = points[1].y - points[0].y;
                    if(points[0].x < x && x < points[1].x ||
                       points[1].x < x && x < points[0].x)
                        y = points[0].y + (x - points[0].x)*(dy / dx);
                    else if(points[0].y < y && y < points[1].y ||
                            points[1].y < y && y < points[0].y)
                        x = points[0].x + (y - points[0].y)*(dx / dy);
                    else
                        return;
                    p1.setLocation(x, y);
                    break;
                case 2:
                    dx = points[2].x - points[1].x;
                    dy = points[2].y - points[1].y;
                    if(points[1].x < x && x < points[2].x ||
                       points[2].x < x && x < points[1].x)
                        y = points[1].y + (x - points[1].x)*(dy / dx);
                    else if(points[1].y < y && y < points[2].y ||
                            points[2].y < y && y < points[1].y)
                        x = points[1].x + (y - points[1].y)*(dx / dy);
                    else
                        return;
                    p2.setLocation(x, y);
                    break;
                default:
                    System.out.println("illegal number " + number);
            repaint();
        protected void paintComponent(Graphics g) {
            super.paintComponent(g);
            Graphics2D g2 = (Graphics2D)g;
            g2.setRenderingHint(RenderingHints.KEY_ANTIALIASING,
                                RenderingHints.VALUE_ANTIALIAS_ON);
            if(points == null)
                initGeoms();
            g2.setPaint(Color.blue);
            for(int j = 1; j < points.length; j++)
                g2.draw(new Line2D.Double(points[j-1].x, points[j-1].y,
                                          points[j].x,   points[j].y));
            g2.setPaint(Color.red);
            for(int j = 0; j < points.length; j++)
                mark(points[j], g2);
            g2.setPaint(Color.green.darker());
            mark(p1, g2);
            mark(p2, g2);
        private void mark(Point2D.Double p, Graphics2D g2) {
            g2.fill(new Ellipse2D.Double(p.x-2, p.y-2, 4, 4));
        private void initGeoms() {
            int w = getWidth();
            int h = getHeight();
            points = new Point2D.Double[3];
            points[0] = new Point2D.Double(w/4, h/3);
            points[1] = new Point2D.Double(w/16, h/2);
            points[2] = new Point2D.Double(w*13/15, h*3/4);
            double cx = points[0].x + (points[1].x - points[0].x)/2;
            double cy = points[0].y + (points[1].y - points[0].y)/2;
            p1 = new Point2D.Double(cx, cy);
            cx = points[1].x + (points[2].x - points[1].x)/2;
            cy = points[1].y + (points[2].y - points[1].y)/2;
            p2 = new Point2D.Double(cx, cy);
        public static void main(String[] args) {
            TraverseAgain test = new TraverseAgain();
            PointMover mover = new PointMover(test);
            test.addMouseListener(mover);
            test.addMouseMotionListener(mover);
            JFrame f = new JFrame();
            f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
            f.getContentPane().add(test);
            f.setSize(400,400);
            f.setLocation(200,200);
            f.setVisible(true);
    class PointMover extends MouseInputAdapter {
        TraverseAgain traverseAgain;
        int selectedEndIndex = -1;
        int selectedMidNumber = -1;
        Point2D.Double offset = new Point2D.Double();
        boolean dragging = false;
        final int MIN_DIST = 5;
        public PointMover(TraverseAgain ta) {
            traverseAgain = ta;
        public void mousePressed(MouseEvent e) {
            Point p = e.getPoint();
            Point2D.Double[] points = traverseAgain.points;
            for(int j = 0; j < points.length; j++) {
                if(points[j].distance(p) < MIN_DIST) {
                    selectedEndIndex = j;
                    rigForDrag(points[j], p);
                    break;
            if(selectedEndIndex == -1) {
                if(traverseAgain.p1.distance(p) < MIN_DIST) {
                    selectedMidNumber = 1;
                    rigForDrag(traverseAgain.p1, p);
                } else if(traverseAgain.p2.distance(p) < MIN_DIST) {
                    selectedMidNumber = 2;
                    rigForDrag(traverseAgain.p2, p);
        private void rigForDrag(Point2D.Double p, Point loc) {
            offset.x = loc.x - p.x;
            offset.y = loc.y - p.y;
            dragging = true;
        public void mouseReleased(MouseEvent e) {
            dragging = false;
            selectedEndIndex = -1;
            selectedMidNumber = -1;
        public void mouseDragged(MouseEvent e) {
            if(dragging) {
                double x = e.getX() - offset.x;
                double y = e.getY() - offset.y;
                if(selectedEndIndex != -1)
                    traverseAgain.setEndPoint(selectedEndIndex, x, y);
                else
                    traverseAgain.setMidPoint(selectedMidNumber, x, y);
    }

  • How to create a generalized version of the detailed polygons?

    How to create a generalized version of the detailed polygons?
    I have a table of detailed polygons (100+ vertices) and I want to get generalized version of these polygons.
    For example, assume I have a polygon with 100 vertices. Distance between vertex n and n+1 is 1.0.
    I want to get geometry (generalized polygon, line or point) where distance between vertex n and n+1 is 10.0 or more (I want vertices to be considered as one vertex if distance between them is less then 10.0).
    Is it possible to create generalized version of polygons on the fly?
    Any help is appreciated.
    Thanks.

    Scenario A:
    If all of your polygons have no interaction among them (No polygon shares any boundary with any other ones).
    In this case you can use the sdo_util.simplify in 10g to reduce the vertices in your polygons which returns new polygon geometries on the fly.
    If you found that simplify is not doing exactly what you want, you can always roll out your own implementation using PL/SQL or the new SDOAPI JGeoemtry class in Java. Both will give you complete access to the coordinate arrays in a polygon and update them back to the database after you have simplified them in your code.
    Scenario B:
    If your polygons share boundaries, then the above methods will not work since the simplification process may not preserve the topology among your polygons. What you can do then is to use the Java topo package to create a new topology by adding all of your polygons to to an empty topology (which you first create in the database and then load into memory using oracle.spatial.topo.TopoMap). Once you have a topology built in the memory, you can use methods such as oracle.spatial.topo.TopoMap.changeEdgeCoords() to simplify the edges of your polygons. You can then recreate the simplified polygons from the topology. This is just a rough guide; for more details you need to check out the java doc for the various packages mentioned above which are shipped with 10g spatial.

  • Wifi on ipad 2 Ios5 !

    Hi support guys !
    Nearly, I just bought a Ipad2 3G 32G white. I have updated to Ios5 for my ipad2. It 's problem that wifi signal of Ipad is not full althought my ipad was put nearly access point. Distance from ipad to access point is 3 or 4m. Wifi signal is often up and down.It often goes 2 or 3 turn.  I don't know why ? Could you explane to help me ?
    And my iphone and my macbook pro have never been same that. They have been full wifi signal.

    On the iPad tap Settings > General > Reset > Reset Network Settings.
    Then restart your iPad.
    If that didn't help try here >   iOS: Troubleshooting Wi-Fi networks and connections

  • ORA-13268: error obtaining dimension from USER_SDO_GEOM_METADATA

    I am receiving an error message if i send the query (Oracle Spatial) from my .NET application using ODP.NET. I am using OR operator and SDO_WITHIN_DISTANCE. Please find the query below. The query work perfectly when I run the query in SQL developer
    SELECT * from TABLE1
    WHERE SDO_WITHIN_DISTANCE( GEODATA.SHAPE, (SDO_CS.TRANSFORM(sdo_util.from_gml311geometry('<gml:Point srsName="SDO:4326" xmlns:gml="http://www.opengis.net/gml">
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    </gml:Point>'),4326)), 'distance=9999.98906889') <> 'True'
    OR (COLUMN1 IN
    (SELECT * from TABLE 2
    WHERE SDO_WITHIN_DISTANCE( GEODATA.SHAPE, (SDO_CS.TRANSFORM(sdo_util.from_gml311geometry('<gml:LinearRing xmlns:gml="http://www.opengis.net/gml" srsName="SDO:4326">
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">1 1</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">20 20</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">80 80</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    </gml:LinearRing>'),4326)), 'distance=9999.98906889') <> 'True'
    I have a table GEODATA with SRID as 4326 and I have created the index also.
    If I replace "</gml:Point>'),4326)), 'distance=9999.98906889') <> 'True'" with "</gml:Point>'),4326)), 'distance=9999.98906889') = 'True'" everything works fine.
    Its very urgent. Any help would be greatly appreciated.

    SELECT * from TABLE1
    WHERE SDO_WITHIN_DISTANCE( GEODATA.SHAPE, (SDO_CS.TRANSFORM(sdo_util.from_gml311geometry('<gml:Point srsName="SDO:4326" xmlns:gml="http://www.opengis.net/gml">
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    </gml:Point>'),4326)), 'distance=9999.98906889') <> 'True' //values not equal to true
    OR (COLUMN1 IN
    (SELECT * from TABLE 2
    WHERE SDO_WITHIN_DISTANCE( GEODATA.SHAPE, (SDO_CS.TRANSFORM(sdo_util.from_gml311geometry('<gml:LinearRing xmlns:gml="http://www.opengis.net/gml" srsName="SDO:4326">
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">1 1</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">20 20</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">80 80</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    </gml:LinearRing>'),4326)), 'distance=9999.98906889') <> 'True' // values not equal to true
    ))))

  • SQL Query - SDO_WITHIN_DISTANCE

    This is the SQL query i entered :
    select a.gblob_
    from sla_lbstr_int_bldg a
    where SDO_WITHIN_DISTANCE(a.gblob_, (select b.gblob_
    from sla_lbstr_int_bldg b
    where b.postal_code='640217'), 'distance=10') = 'true';And this is the error msg i got :
    select a.gblob_
    ERROR at line 1:
    ORA-29902: error in executing ODCIIndexStart() routine
    ORA-13207: incorrect use of the [SDO_WITHIN_DISTANCE] operator
    ORA-06512: at "MDSYS.SDO_INDEX_METHOD_10I", line 391
    ORA-06512: at line 1 I really dont know where i went wrong. Please help.

    SELECT * from TABLE1
    WHERE SDO_WITHIN_DISTANCE( GEODATA.SHAPE, (SDO_CS.TRANSFORM(sdo_util.from_gml311geometry('<gml:Point srsName="SDO:4326" xmlns:gml="http://www.opengis.net/gml">
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    </gml:Point>'),4326)), 'distance=9999.98906889') <> 'True' //values not equal to true
    OR (COLUMN1 IN
    (SELECT * from TABLE 2
    WHERE SDO_WITHIN_DISTANCE( GEODATA.SHAPE, (SDO_CS.TRANSFORM(sdo_util.from_gml311geometry('<gml:LinearRing xmlns:gml="http://www.opengis.net/gml" srsName="SDO:4326">
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">1 1</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">20 20</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">80 80</gml:pos>
    <gml:pos xmlns:gml="http://www.opengis.net/gml">14 50</gml:pos>
    </gml:LinearRing>'),4326)), 'distance=9999.98906889') <> 'True' // values not equal to true
    ))))

  • Help on polymorphism in my code

    Hi, I'd be glad if anyone could explain why java compiler gives errors
    compiling a class of a simple application.
    This is the scenario: class Point is meant to simplicistically abstract the
    concept of 2D point (x and y are the coordinates). Class Point3D extends Point,
    adding z coordinate. Attributes x, y and z are encapsulated (private and each
    one with setter and getter methods).
    There is a third class, called Ruler, its aim is to set the distance between
    two 2D points or two 3D points using the polymorphic method
    computeDistance(Point p1, Point p2).
    The compiler fails compiling the class Ruler with this message:
    Ruler.java:21: p1 is already defined in computeDistance(Point,Point)
    Point3D p1 = (Point3D) p1;
    ^
    Ruler.java:22: p2 is already defined in computeDistance(Point,Point)
    Point3D p2 = (Point3D) p2;
    ^
    2 errors
    This is the relevant part of the class:
    public class Ruler
        private double distance;
        public void computeDistance(Point p1, Point p2)
            if (p1 instanceof Point && p2 instanceof Point)
                // This is a 2D points case.
                // Obtain x1, x2, y1, y2 via getX() and getY() then  compute the
                // distance.
            else if (p1 instanceof Point3D && p2 instanceof Point3D)
                // This is a 3D points case.
                // Obtain x1, x2, y1, y2, z1, z2 using getX() and getY(), getZ().
                // BUT, in order to obtain z1, z2 it is needed a casting between
                // objects, because Point objects don't provide getZ(), while
                // Point3D do.
                Point3D p1 = (Point3D) p1;
                Point3D p2 = (Point3D) p2;
            else
                // This case is not valid.
    }If this piece of code is not enough I'll write in another post all the three
    classes exactly as they are.
    Thanks for any help!

    In Point, declare a computeDistance:
    public double computeDistance(Point other)
       // compute and return distance from this point to other point;
    }Override it in Point3D to account for the Z values:
    public double computeDistance(Point other)
       if (other instanceof Point3D)
          // Cast to Point3D
         // compute and return distance from this point to other point;
       else
           // decide how to handle (throw IllegalArgumentException, use Z=0, etc.)
    }Or, just try the cast, and allow the ClassCastException to fail [instead of explicitly throwing IllegalArgumentException]. Just document whatever it should do.
    In Ruler, do this, and it will do the polymorphism without instanceof:
    public void computeDistance(Point p1, Point p2)
       distance = p1.computeDistance(p2);
    }

  • Line2D.ptSegDist - bug or underflow?

    (1.6.0_01-b06 on XP)
    I'm running into an odd situation with Line2D's ptSegDist method. Here's hoping someone can enlighten me.
    public class Test
         public static void main(String[] args)
              System.out.println(Line2D.ptSegDist(-8275, 8785, -8275, 20, -8275, 8784.5));
              System.out.println(Line2D.ptSegDist(-8275, 8785, -8275, 20, -8275, 8784.7));
              System.out.println(Line2D.ptSegDist(-8275, 8785, -8275, 20, -8275, 8784.8));
    }(Apologies for the odd numbers; they fell out of some code I'm writing).
    Now, each of the 3 points I'm testing does indeed lie on the line - the results should be 0.0
    0.0
    0.0 Instead, I get 0.0
    1.220703125E-4
    0.0Wha?
    So, my question is this : Is this a bug? Or am I running into double limitations?
    My co-ordinate space is only 10000x10000, and double can handle 17 decimal places, so unless Line2D is using some odd internal maths, it shouldn't be underflowing. Also, if it was underflow, why don't the two adjacent tests also fail?
    And yes, I know I should be using an epsilon test. I am, but my epsilon is 1E-5, and I can't bring it any higher because I'll need the precision later.
    What's going on? What can I do about it? Why does Sun hate me so?
    Edited by: CodeMonkey9358 on Feb 23, 2008 10:07 PM

    You are running into double limitations. First I would advise you to take a look at the source of Line2D.ptSegDist (which will lead you to ptSegDistSq). With debugging I found the following:
    The imprecision already happens in ptSegDistSq: a subtraction of 2 almost identical values of about 7.7E7 (those 2 values are each calculated in a different way, which is the reason for the slight discrepancy).
    7.681996609E7
    minus
    7.681996609000002E7There you have the full 17 places of the mantissa. But 8 of them are on the left of the decimal point, which leaves only 9 on the right.
    When you look at the ptSegDistSq method you will see that if this subtraction results in a negative value, it will be set to 0. Thats why you get a nice 0.0 in the other cases (the same thing happens, but the other way around).
    So if your coordinate space is within [-10000, +10000], these numbers will get as high as 20'000^2 or 4E8, possibly resulting in imprecision of the point-segment-distance of up to about 1E-8.
    And since you are using ptSegDist the square root is taken from this, which blows the "error" up to about 1E-4 (note: square roots of values smaller than 1 are bigger than the values themselves).
    So I would advise you to use an epsilon of 1E-3 or 1E-2 to be on the safe side (or if it fits your purpose, maybe go with ptSegDistSq).
    import java.awt.geom.Line2D;
    public class PtSegDist {
        public static void main(String[] args) {
            System.out.println(Line2D.ptSegDist(-8275, 8785, -8275, 20, -8275, 8784.7));
            // critical line in Line2D.ptSegDist
            // double lenSq = px * px + py * py - projlenSq;
            double px = 0.0;
            double py = -8764.7;
            System.out.println(7.68225955E7 * 7.68225955E7);
            System.out.println(-8765.0 * -8765.0);
            double projlenSq = 7.68225955E7 * 7.68225955E7 / (-8765.0 * -8765.0);
            System.out.println("projlenSq=" + projlenSq);
            double pySquared = py * py;
            System.out.println("pySquared=" + pySquared);
            double lenSq = pySquared - projlenSq;
            System.out.println("lenSq=" + lenSq);
            System.out.println("sqrt(lenSq)=" + Math.sqrt(lenSq));
    }Output:
    1.220703125E-4
    5.90171117935662E15
    7.6825225E7
    projlenSq=7.681996609E7
    pySquared=7.681996609000002E7
    lenSq=1.4901161193847656E-8
    sqrt(lenSq)=1.220703125E-4--Numain (I hope what I told you doesn't contain too many mistakes or errors of a fundamental sort on my part)                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   

Maybe you are looking for