Calculation of the point of intersection of the circles giving NaN first "tour".

Similar Questions

• Point of intersection between the line interpolated in Grapher

  How to find the point of intersection between interpolated lines using points offered as input to a file in grapher comps?

  What version of Mac OS X?

• Points of intersection of the lines

  Hi guys, I have a little problem. I have two sets of points, which sets two rectangles. I need to know what area they share. No idea how to do?

  

  I found "Polygon Area.vi" function. but I need points of intersection of these two rectangles to compute the inner area for this function.

  Thanks for any advice.

  I just did a quick check and did not see the convex polygon in LV 2011 VI of Intersection.

  It shouldn't be too hard to write your own.  You need to consider several possible cases: polygons do not intersect.  Polygons have exactly one thing in common (one is on an edge or one vertex on the other). Polygons have in common the segments in one or more edges. A polygon is completely contianied in the other. And if you showed polygons overlap but do not share an edge or a vertex.  If the polygons can be concave, additional complexity might be involved.

  Some simple analytic geometry will allow you to locate the intersection of two straight lines formed by the edges of the polygons. You must then determine if the intersections are on the edge or outside the polygon. Once you have found the 4 (or zero) points of intersection which are relevant, you can use the Poylgon Area.vi, which is in LV 2011, to calculate the desired area.

  Since you're using the student Edition, this is a school assignment?  If so, most of the participants on the Forums will not do your work for you because you don't learn something like that, but we'll help you learn LV

  The steps I would take are: 1. define the case of polygons possible in your situation. 2 analytical hand geometry to make you understand the issues. 3. set the program, with possibly a flow chart or a diagram of the State, with regard to points 1 and 2. 4. write code to implement 3 LabVIEW.

  Lynn

• How to find a point of intersection between two paths in the hierarchy? (2 G 11)

  Hi all!

  I need your help to write a hierarchical query.

  Suppose that we have a table hierarchycal as

  WITH h AS (SELECT 0 AS rn, to_number(NULL) AS prn, 'root' AS point_name   FROM dual
  UNION SELECT 1 AS rn, 0 AS prn, 'a' AS point_name  FROM dual
  UNION SELECT 2 AS rn, 1 AS prn, 'b' AS point_name  FROM dual
  UNION SELECT 3 AS rn, 1 AS prn, 'c' AS point_name  FROM dual
  UNION SELECT 4 AS rn, 2 AS prn, 'd' AS point_name  FROM dual
  UNION SELECT 5 AS rn, 3 AS prn, 'e' AS point_name  FROM dual
  UNION SELECT 6 AS rn, 2 AS prn, 'f' AS point_name  FROM dual
  UNION SELECT 7 AS rn, 3 AS prn, 'g' AS point_name  FROM dual
  UNION SELECT 8 AS rn, 6 AS prn, 'h' AS point_name  FROM dual
  UNION SELECT 9 AS rn, 5 AS prn, 'i' AS point_name  FROM dual
  UNION SELECT 10 AS rn, 7 AS prn, 'j' AS point_name  FROM dual
  UNION SELECT 11 AS rn, 10 AS prn, 'k' AS point_name  FROM dual)
  SELECT h.* 
  FROM h 
  CONNECT BY PRIOR h.rn=h.prn
  START WITH h.prn IS NULL
  

  I chose a single line, with rn = 11 for example, as a "starting point." After that I need to select one or more rows in this table under certain conditions. Whether rn = 8 and 9, for example. By the same query, to the next step, for each point that I chose by condition, I need to calculate, how far is it to the "starting point".

  I think, I need to find a point of intersection of the path from the root to the selected point along the same path of the "starting point". By comparing this tip I'll can understand which of them is closer to the "start".

  The only thing that I have arrived, it's trying to compare the results of sys_connect_by_path...

  Hello

  This indicates to what extent each of the nodes 'interest' are from the node of "start":

  WITH connect_by_results AS

  (

  SELECT CONNECT_BY_ROOT rn: the NURSE

  CONNECT_BY_ROOT SUBSTR (point_name,

  1

  8

  ) AS node_type

  rn AS ancestor

  LEVEL AS lvl

  H

  START WITH point_name = 'start '.

  OR point_name LIKE '% interest '.

  Rn = prn PRIOR CONNECTION

  )

  SELECT i.rn

  , MIN (i.lvl + s.lvl) - 2 AS distance

  Connect_by_results I have

  JOIN connect_by_results s ON s.ancestor = i.ancestor

  WHERE s.node_type = 'start '.

  AND i.node_type = 'interest '.

  GROUP BY i.rn

  ORDER BY i.rn

  ;

  Exit: (from your sample data, where 11 is the starting node):

  DISTANCE OF RN

  ---- --------

  8        7

  9        5

  14 3

• How to find the point of intersection of the two geometry?

  Hello
  Could someone give some suggestions on how to find the point of intersection of the two geometry?
  I need just point. (x, y, z)
  Thank you

  Can you post the full result of geometry returned?

  What you should have as a result:

  MDSYS. SDO_GEOMETRY (2001, 1, NULL, MDSYS.) SDO_ELEM_INFO_ARRAY (1,1,1), MDSYS. SDO_ORDINATE_ARRAY (2.0,2.0))

  Notice the sdo_intersection will use only the sdo_ordinate_array, even if the result is a point! (with the SDO_POINT is NULL.)

  where do you find these x, y, z values of?

  On your other question:

  -using the operator space sdo_relate (with mask = ANYINTERACT) will return in pairs, the result of the intersection of each anyinteracting polygon, line combination.

  -of course, these results will vary from point, multipoint, line or multiline even depending on how the interaction takes place.

  -try to explain a bit more what do you mean 'I want only points to return' of nit.

  Luke

• Bug during import of calculation and the point of application

  Hello
  
  I created a component export file which contains, among other things, a part of the application and a calculation of the claim on this point. Looking at the export file, this is the order of events:
  
  +...+
  Create calculations of the application
  Create the application point
  +...+
  
  However, when I import this file in our test environment, the point of application is created but not calculated. In fact, if I create the calculation manually and re - import the file, the calculation is actually deleted! However, if I change the import file and to reverse the order of events:
  
  +...+
  Create the application point
  Create calculations of the application
  +...+
  
  .. .it works very well. Is this a known bug?
  
  I use Apex 3.0 on Oracle 10 g btw.
  
  Thank you!
  Luis

  Luis - I filed a bug for the problem of calculation/pos. The problem is that a trgger on wwv_flow_items removes the corresponding calculations and the way in which the element is replaced is to remove it first and then re-create.

  The last date of update for components is not very reliable on this report. I wouldn't want to ignore them.

  Scott

• Calculations of the rate of aggregation in essbase ASO SEEP cubes

  The question (limitation to ASO) we tried to find a solution/workaround. ON PBCS (Cloud)
  

  Details of the application:

  
  Application: type of ASO in cloud Oracle planning 11.1.2.3 (PBCS) application

  
  Dimension : Total 8 dimensions. Account to the dynamic hierarchy. Remaining 7 dimensional hierarchies Stored value. Only 2 dimensions have about 5000 members and others are relatively small and flat hierarchies.

  Description of the question of the requirement: We have a lot of calculations in the sketch that use amount = units * rates type of logic. The obligation is such that these calculation logic should apply only to the intersections of Level0 and then data resulted must roll up (down) to the respective parents across all dimensions. But when apply us this hierarchical logic / formula calculation to ASO, the logic(i.e.,amount=units*rate) of calculation is applied at all levels (not only the leaf level) of remaining dimensions. Here, rates are also numbers derived using the formula MDX.

  Some of the options explored so far:
  Option1: This is an expected behavior in ASO as all stored hierarcies are calculated first, then the dynamic hierarchies. So we tried to change the formula for each of the calculated members to explicitly summarize data at parent levels using algorithm as shown below.

  IF (Leaf Level combination)
  amount = units * rate
  Else / * for all levels parents * /.
  Use the function sum adding up the amounts between the children of the current members of dimension1, dimension2 and so on.
  End

  Result: Recovery works through the parents for a dimension. When the summary level members are selected in 2 or more dimensions, the recovery freezes.

  Option2: Change the type of hierarchy to group all the dimensions to "Dynamic" so that they calc after account (i.e. after amount = units * rate runs at intersections Level0).

  Result: Same as option 1. Although the aggregation works through one or 2 dimensions, it freezes when the summary level members are from many dimensions.

  Option3: ASO use custom Calc.
  We created a custom calc by fixing the POV Level0 members of any size and with the amount of formul = units * rate.

  Result: Calc never ends because the rate used is a dynamic calc with formula MDX (which is needed to roll forward rates for a specified period at all the following exercises).

  If you could get any help on this, it would be a great help.

  
  

  Thank you and best regards,

  Alex keny
  

  
  

  
  

  Your best bet is to use the allocation of the ASO, what difference does make. (one ton)

  There are a few messages blog out there that can help you meet this goal. (including mine), the trick is to create a member calculated with a NONEMPTYMEMBER in the formula

  Then it will be a member with an inside MDX formula

  NONEMPTYMEMBER units, rates

  Units * rates

  Now, make a copy of data (allocation) of this member-to-Member stored.

  http://www.orahyplabs.com/2015/02/block-creation-in-ASO.html

  http://camerons-blog-for-Essbase-hackers.blogspot.com/2014/08/calculation-Manager-BSO-planning-and.html

  Concerning

  Celvin Kattookaran

  PS I found NONEMPTYTUPLE does not and still used NONEMPTYMEMBER

• Calculation of the page does not fire

  Using Oracle Application Express 4.0.0.00.46 on Oracle 11 g 2
  
  I just want to capture the UPDATE_DATE and UPDATE_USER in columns in my table during the submission of a form.
  
  I use out of the box 'Process line of TableName' to manage the updates of the table that the form is based.
  
  My thought was to use the calculations Page to replace the: APP_USER in the element UPDATE_USER to a Point of Compuation of 'After Submit' page
  and a query SQL Page calculation 'select sysdate from double' in the point to Point Compuation UPDATE_DATE page of "after"Submit."
  
  I expect this to substitute these new values in the elements of the page before submitting and then save them in the database.
  
  This does not seem to fire - no substitution occurs and no Message error of calculation - appears the table update all columns changed successfully but does not change the columns UPATE_DATE or UPDATE_USER.
  
  Any ideas of what I should check - or should take a different approach?

  Hello

  I would like to use the database.
  You can get the user name in the trigger using the function v

  v('APP_USER')
  

  and if someone insert the data directly into the database using

  NVL(v('APP_USER'),user)
  

  Kind regards
  Jari

• [8i] help with function with parameters (for the calculation of the work)

  Let me start by saying, I've never written a function before, and I do not have access to create a feature in my database (that is, I can't test this feature). I am trying to achieve a function I can ask my IT Department to add for me. I hope that someone can take a look at what I wrote and tell me if this should work or not, and if it's the right way to go to solve my problem.
  
  I'm creating a function to make a very simple calculation of work (add/subtract a number of days to a date in the calendar).
  
  The database, I work with has a table with the schedule of work. Here is a sample table and sample data, representative of what is in my work table calendar:
  

  CREATE TABLE caln
  (     clndr_dt     DATE,
       shop_days     NUMBER(5)
       CONSTRAINT caln_pk PRIMARY KEY (clndr_dt)
  );
  
  INSERT INTO     caln
  VALUES (To_Date('01/01/1980','mm/dd/yyyy'),0);
  INSERT INTO     caln
  VALUES (To_Date('01/02/1980','mm/dd/yyyy'),1);
  INSERT INTO     caln
  VALUES (To_Date('01/03/1980','mm/dd/yyyy'),2);
  INSERT INTO     caln
  VALUES (To_Date('01/04/1980','mm/dd/yyyy'),3);
  INSERT INTO     caln
  VALUES (To_Date('01/05/1980','mm/dd/yyyy'),3);
  INSERT INTO     caln
  VALUES (To_Date('01/06/1980','mm/dd/yyyy'),3);
  INSERT INTO     caln
  VALUES (To_Date('01/07/1980','mm/dd/yyyy'),4);
  INSERT INTO     caln
  VALUES (To_Date('01/08/1980','mm/dd/yyyy'),5);
  INSERT INTO     caln
  VALUES (To_Date('01/09/1980','mm/dd/yyyy'),6);
  INSERT INTO     caln
  VALUES (To_Date('01/10/1980','mm/dd/yyyy'),7);
  INSERT INTO     caln
  VALUES (To_Date('01/11/1980','mm/dd/yyyy'),8);
  INSERT INTO     caln
  VALUES (To_Date('01/12/1980','mm/dd/yyyy'),8);
  INSERT INTO     caln
  VALUES (To_Date('01/13/1980','mm/dd/yyyy'),8);
  INSERT INTO     caln
  VALUES (To_Date('01/14/1980','mm/dd/yyyy'),9);

  The table includes since 01/01/1980 but 31/12/2015.
  
  I have written (and validated) this parameter query that performs the calculation of my working day (mday):

  SELECT     cal.clndr_dt
  FROM     CALN cal
  ,     (
       SELECT     cal.shop_days+:mdays     AS new_shop_days
       FROM     CALN cal
       WHERE     cal.clndr_dt     =:start_date
       ) a
  WHERE     cal.shop_days     = a.new_shop_days
  AND     ROWNUM          =1
  ORDER BY     cal.clndr_dt;

  Based on this request, I created the following function (and I have no idea if it works or if the syntax is right, etc..):

  CREATE OR REPLACE FUNCTION add_mdays 
       (start_date     IN DATE,
       mdays          IN NUMBER(5))
  RETURN     DATE 
  IS
       new_date DATE;
  BEGIN
  
       SELECT     cal.clndr_dt
       FROM     CALN cal
       ,     (
            SELECT     cal.shop_days+mdays     AS new_shop_days
            FROM     CALN cal
            WHERE     cal.clndr_dt     =start_date
            ) a
       WHERE     cal.shop_days     = a.new_shop_days
       AND     ROWNUM          =1
       ORDER BY     cal.clndr_dt;
  
       RETURN     new_date;
  
  END add_mdays;  //edit 9:31 AM - noticed I left off this bit

  I'm also not sure how to do to have the function handle results that would return a date outside the range of dates that appear in the table (prior to 01/01/1980 or after until 31/12/2015 - or, another way to look at what was, before the caln.clndr_dt or the caln.clndr_dt MAX value MIN value).
  
  My goal is to be able to use the function in a situation similar to the following:
  
  First of all, here is a sample table and data:

  CREATE TABLE orders
  (     ord_no          NUMBER(5),
       plan_start_dt     DATE,
       CONSTRAINT orders_pk PRIMARY KEY (ord_no)
  );
  
  INSERT INTO orders
  VALUES (1,To_Date('01/08/1980','mm/dd/yyyy'));
  INSERT INTO orders
  VALUES (2,To_Date('01/09/1980','mm/dd/yyyy'));
  INSERT INTO orders
  VALUES (3,To_Date('01/10/1980','mm/dd/yyyy'));

  And here's how I would use my function:

  SELECT     orders.ord_no
  ,     orders.plan_start_dt
  ,     add_mdays(orders.plan_start_dt, -3) AS prep_date
  FROM     orders

  Thus, the function would allow me to come back, for each command in my table of orders, the date is 3 days working (mdays) before the start of the plan of each order.
  
  I go about it the right way? I have to create a function to do this, or is there a way for me to integrate my request (which makes my mday calculation) in the example query above (eliminating the need to create a function)?
  
  Thank you very much in advance!
  
  Published by: user11033437 on February 2, 2010 08:55
  Fixed some typos in the last insert statements
  
  Published by: user11033437 on February 2, 2010 09:31 (fixed some syntax in the function)

  Hello

  Ah, referring to Oracle 8 and is not not able to test your own code makes me nostalgic for the good old days, when you have entered your cards and led to a window to the computer center and waited an hour for the work to be performed and then seen printing to find that you had made a typo.

  If you write functions, you should really test yourself. Like all codes, functions forge be written small not: write a line or two (or sometimes just a part of what would later become a single line), test, make sure it is running properly and repeat.
  Ideally, your employer must create a pattern of development in a development database that you can use.
  You can legally download your own instance of Oracle Express Edition free; just be careful not to use features that are not available in the database where the code will be deployed.

  You need a function to get the desired results:

  SELECT       o.ord_no
  ,       o.plan_start_dt
  ,       MIN (e.clndr_dt)     AS prep_date
  FROM       orders     o
  ,       caln          l
  ,       caln          e
  WHERE       l.clndr_dt     = o.plan_start_dt
  AND       e.shop_days     = l.shop_days - 3
  GROUP BY  o.ord_no
  ,            o.plan_start_dt
  ;
  

  It would be more effective (and somewhat simpler) If you've added a column (let's call it work_day) identified whether each line represents a work_day or not.
  For each value of shop_days, exactly 1 row will be considered as a working day.
  Then, the query may be something like:

  SELECT       o.ord_no
  ,       o.plan_start_dt
  ,       e.clndr_dt          AS prep_date
  FROM       orders     o
  ,       caln          l
  ,       caln          e
  WHERE       l.clndr_dt     = o.plan_start_dt
  AND       e.shop_days     = l.shop_days - 3
  AND       e.work_day     = 1
  ;
  

  You can use the analytic LAG function to populate the work_day column.

  A function would certainly be useful, although perhaps slower.

  The function you have posted has some errors:
  an argument can be stated under NUMBER (5); Just NUMBER.
  (b) when you SELECT in PL/SQL, as you do, you must SELECT a variable to store the results.
  (c) ROWNUM is arbitrary (making it useless in this problem) unless you draw a neat subquery. I don't think you can use ORDER BY in subqueries in Oracle 8. Use the ROW_NUMBER analytic function.
  (d) the service must end with an END statement.

  Given your current caln table, here's how I would write the function:

  CREATE OR REPLACE FUNCTION add_mdays
       ( start_date     IN           DATE          DEFAULT     SYSDATE,
         mdays          IN           NUMBER          DEFAULT     1
       )
  RETURN     DATE
  DETERMINISTIC
  IS
       --     add_mdays returns the DATE that is mdays working days
       --     after start_date.  (If mdays < 0, the DATE returned
       --     will be before start_date).
       --     Work days do not include Saturdays, Sundays or holidays
       --     as indicated in the caln table.
  
       new_date     DATE;          -- to be returned
  BEGIN
  
       SELECT     MIN (t.clndr_dt)
       INTO     new_date
       FROM     caln     f     -- f stands for "from"
       ,     caln     t     -- t stands for "to"
       WHERE     f.clndr_dt     = TRUNC (start_date)
       AND     t.shop_days     = f.shop_days + TRUNC (mdays)
       ;
  
       RETURN     new_date;
  END     add_mdays;
  /
  SHOW ERRORS
  

  Production code forge be robust (which includes "fool-proofing").
  Try to anticipate what people errors might appeal to your function and correct for them where possible.
  For example, if it only makes sense for start_date at midnight, mdays to be an integer, use TRUNC in the function where soembody passes a good value.
  Allow default arguments.
  Comment of your function. Put all comments within the service (i.e. after CREATION and before the END) so that they will remain in the data dictionary.
  If, given the same arguments, the function always returns the same value, mark it as DETERMINISTIC, for efficiency. This means that the system will remember the values transmitted rather than to call the function whenever it is said to.

  I wish I could score questions such as 'Correct' or 'useful '; you get 10 points for sure.
  You posted CREATE TABLE and INSERT statements (without even be begged).
  You gave a clear description of the problem, including the expected results.
  The code is well formatted and easy to read.
  All around, one of the more thoughtful and well written questions I've seen.
  Play well! Keep up the good work!

  Published by: Frank Kulash, February 2, 2010 13:10
  Added to my own version of the function.

• calculation of the average value of the sorted data and polar route drawing

  Hello

  I did a VI that calculates the average value of the wind rotor/speed-ratio in the sections of 30 degrees (wind direction). He also called the polar plot of calculated data. Everything works, but I would like to make more detailed calculations and drawings, by increasing the resolution to 1 degree, or...

  Problem is VI, I did, is not easy on a large scale. At the moment, I have 12 parallel structures of switch-box to calculate the average value and build the array function to collect data calculated for Polar plot to draw the image in real time. I know it's probably the worst way to do it, but since I have done a few things with LV, it was the only way I managed to do what I wanted.

  Now, if I continue in same way to reach my goal, I have to create 360 Parallels switch-case structures... that are crazy.

  Something like the calculation of the average of the table or matrix (zero/empty values should not be calculated on average) inside the loop or similar way would probably be the best solution.

  So, polar plot drawing is not a problem, but creating a reasonalbe average metering system is. Any ideas?

  I would also like to rotare northward to the top (0 deg), and degrees of increase in a clockwise direction on polar ground dial plate (as on the compass).

  VI on the attachment. (simplified version of the complete system)

  I have signals:

  -Wind speed

  -wind direction

  -Rotor speed

  I want to:

  -calculate the average value of the speed of the wind / rotor - ratio in sections (5 degrees, 1 degree)

  -Draw a polar path of the wind rotor/speed-ratio of averages in propotion of wind direction

  I'm using LabView 2009

  Thank you very much.

  It is closer to what you're looking for?

• Translate 'Weird' in the calculation of the capacity of MOSFET

  Hello world

  I have a problem with the result of the simulation to calculate N - CH Mosfet capacitance (Cgs, CGD and CBD).

  In this simulation, I tried to check my manual calculation with the result of Spice to 11.0 Multsim. But the result in Multism simulation is stopped different from the manual calculation or Pspice/Hspice simulation.

  

  Manual calculation:

  

  Multisim simulation:

  

  Definition of parameters in Multisim:

  

  . Multisim DC

  

  > DC of PSPICE

  

  It appears from these results that Pspice gave a value close to the theoretical calculation of the MOSFET here.  And I got the result in Multisim.

  Can someone help me solve this problem?... Multisim is not as powerful as other spices software? or simply, I messed up with the Multisim formatting settings and ended up with the wrong answer?

  According to me, you go always peripheral the capacitances output variables. These would be only the capabilities reported and identical to the DC - incorrect. We checked the code and capabilities used in the analysis are the right ones.

  To illustrate so, using variables real circuit - voltage and current, I calculated the impedance looking in the door to a range of 1 GHz (its a little non-trivial to demonstrate the impedance of specific capabilities because you can't get out easily aware of the capacity). The results are similar to PSpice.

  So to reiterate - the real circuit test results are not affected. For now, we ask that you do not watch the variable capacitance device because it is incorrect.

  Hope that helps.

• Rapid calculation of the exponential decay constants

  Hi all

  I try to develop a routine that quickly calculates the exponential decay of a given waveform constant.  I use two different techniques, dealing with the calculation of the directions and another using corrects successive integration (LRS).  The two usually give the correct time for the input waveform even constant with a significant amount of noise.  The LRS solution is significantly less sensitive to noise (desirable), but much more slowly (DFT computations run the order of 10s of microseconds for a waveform pt 1000, while the LRS, such that it is coded in Labview, running at about 1.5 ms).  The LRS technique has been developed by researchers at the George Fox University in Oregon, and they claim that they could perform some computation time on the order of 200 US for both techniques.  I have been unable to reach this time with the LRS technique (obviously) and attempted to use a node of the library Call to call a dll compiled this code in C.  However, at best, I get a growth factor 2 in speed.  In addition, additional calculations using the dll seem to be additive - i.e. for four calculations similar running in the same structure with no dependence on each other, the total computation time is about 4 times that of one.  In my case, this is not enough because I try to calculate 8 x to 1kH.

  Looking through the discussion, I have been unable to determine if I should wait for a performance for C gain well written on Labview well written (most seem to ask why you want to do something external).  In any case, I join the code, then you can be the judge as to if it's well-written, or if there is no improvement in performance.  The main function is the Test analysis Methods.vi that generates a wave exponential scale, offset and noise and then the decay constant tau is calculated using the VI is Tau.vi.  In addition, I am attaching the C code as well as the dll for solving the equations of LRS.  They were coded in Labview 8.6 and the C has been encoded using the latest version of Visual C++ Express Edition from Microsoft.  Themain VI uses the FPGA VI module ' Tick count to determine the rate of computation in microseconds, so if you do not have this module you should remove this code.

  Any thoughts are appreciated.  Thanks, Matt

  Hi Matt,

  After changing the summation loop in your calculation of CWR, the routine runs as fast (or faster) than the variants of the DFT... Anyway: check the results to be sure it is still correct.

• How do reinstall you the calculator in the start menu?

  original title: HOW to REINSTALL THE CALCULATOR ON YOUR COMPUTER at STARTUP PROGRAMSHOW you

  HOW DO REINSTALL YOU THE WINDOWS CALCULATOR IN THE MENU START IN ACCESSORIES?

  Go to: Add or remove programs, click Add/Remove Windows components, accessories and tools, click details, accessories, click details, and then put a checkmark in the calculator click OK, OK, then click.

  If there is already a check calculator uncheck, click OK, OK, then. Then go back and check, click OK, OK, then.

• need to take my computer back in the day that I first started it on7/21/2011 my restore point back up to now how can you start over from scratch with no disc?

  need to take my computer back in the day that I first started it on7/21/2011 my restore point back up to now how can you start over from scratch with no disc?

  Most OEM computers have a partition on the hard drive, that allows to give it bought as provided.  Usually, you activate this feature by pressing a key or combination of keys when the first splash screen appears at startup.  Look quickly at the first screen that appears, and you could see the key that you press.  Otherwise, go to your computer manufacturer's website and download the manual for your computer.  Instructions must be there.

  HTH,
  JW

• I have an exclamation point flashing in a yellow circle in the taskbar. Is it okay to open or is it a virus?

  I am running Windows Vista and when I opened my count I noticed an exclamation point flashing in a yellow circle in the taskbar.  Is it okay to open or is it a virus?  I ran my virus scan and it captures all the viruses.  How can I get rid of this exclamation point?

  Is Microsoft Security Essentials installed or...?