is...(Busy)
Register for free to join our community of investors and share your ideas. You will also get access to streaming quotes, interactive charts, trades, portfolio, live options flow and more tools.
Register for free to join our community of investors and share your ideas. You will also get access to streaming quotes, interactive charts, trades, portfolio, live options flow and more tools.
> lol
.05's coming soon!
JMO
o/
Mine is, looks like they are doing some maitenance.
I got this message on my screen in red!
We are experiencing technical difficulties with Level 2. Sorry for the inconvenience, it will be fixed shortly.
o/
Re: Stairway to Heaven:
Who knows?
Not I.........................
The Stairway to heaven
o/
I am all in!
several years ago I had a problem with a cirtain JP!
Those days are over, looks like we have a real modern age JP on our side!
JMO
o/
Cheers
|^^^^^^^^^^^^^^^^^\||___
|....The RUM TRUCK.. ||||'""|""\__,
|__________________l||___|_|_|)
|(@)(@)"""""""**|(@)(@) **|(@)
I will invite you to the "Soiree" Sir > = common share holders!
cheers!
o/
QQ
_
I concur!
/
/
go ATRN /
It is just ghostly! Sir!
You make a good point!
I could bring the sail boat in, It doesn't use much fuel!
; )
Go ATRN.........
I'll let my buddies to pay for their share of the fuel!
|^^^^^^^^^^^^^^^^^\||___
|....The RUM TRUCK.. ||||'""|""\__,
|__________________l||___|_|_|)
|(@)(@)"""""""**|(@)(@) **|(@)
Cheers!
o/
; ) > Welcome to my daymare!
good to see another new comer!
|^^^^^^^^^^^^^^^^^\||___
|....The RUM TRUCK.. ||||'""|""\__,
|__________________l||___|_|_|)
|(@)(@)"""""""**|(@)(@) **|(@)
Go NEOM!
o/
OT > Nice > If my memory serves me correctly, wasn't there a lounge called Kokamo's there about 12 years ago?
Latitude 27*41.37 Longitude 82*43.40
|^^^^^^^^^^^^^^^^^\||___
|....The RUM TRUCK.. ||||'""|""\__,
|__________________l||___|_|_|)
|(@)(@)"""""""**|(@)(@) **|(@)
Go ATRN > I believe
o/
You got it! > lol
I will tell my buddies to make sure the bar is well stocked!
|^^^^^^^^^^^^^^^^^\||___
|....The Rum TRUCK. ||||'""|""\__,__
|_____________________l||___|___|_|)
|(@)(@)"""""""**|(@)(@)** |(@)
; )
o/
I agree > Been there!
; )
o/
Congrats!
Still looks like a perfect storm to me!
Thanks for the hard work on the DD!
> waiting, holding > long ....
I got me some NEOM : ) > any thoughts on ecdc?
Looks a little over-sold may pop again!
http://www.profitspi.com/stock-chart.aspx?id=ECDC&ca=386244836
TY, I have been watching NEOM
oops, I mean oversold, lol
Anyone still betting on ATRN here? looks a little under sold. looks like a buyers dream. jmo
Intraday chart looks like someone is using an etch-a-sketch to draw Vampire teeth!
Sometimes I buy into the fear!
OO
O
o/
QQ
_
Chart looks like a big martini glass with a little handle forming! > lol
Nobody is getting my shares!
o/
QQ
_
Not sure, I have not been here that long, however, the spyder is blue!
http://atrinsicaffiliatenetwork.com/
Greece increase > lol > I like that.
Looks like things are going to turn out better than the last debacle over there in 2010 = The Flash crash of 2010!
Re: On May 6, 2010 US stock markets opened down and trended down most of the day on worries about the debt crisis in Greece. At 2:42 pm, with the Dow Jones down more than 300 points for the day, the equity market began to fall rapidly, dropping more than 600 points in 5 minutes for an almost 1000 point loss on the day by 2:47 pm. Twenty minutes later, by 3:07 pm, the market had regained most of the 600 point drop.
OO
O
o/
QQ
_
I agree with the reasoning that they will wait.
With a show of that size, the news would be the main topic of discussion, and possibly could overwhelm the people manning the booth, while at the same time they are trying to attract new clients and show those new perspective clients what they do.
Although news would be good for us, (stock holders), Atrinsic still needs to build their customer base.
The other side of the coin, they do it all at once and get as much attention and media coverage as possible while they are in the lime light so to speak.
Another reason I agree with smoke_em on the time frame is,Fong sounds like the kind of guy that wants less filing and news articles, they can wrap it all up into one package so to speak, plus this seems to be Fong’s protocol, at least in the past from what I hear.
I’m just thinking out loud here!
JMO
No crystal ball here!
o/
QQ
Will this stock run today on news?
What is the impact?
Wall Street set to rise ahead of Greek deal!
Yeaahhh!!!!
QQ
-
http://finance.yahoo.com/news/u-stock-index-futures-point-105205115.html
Yeah!!!!
It was also good to wake up to the internet and electricity still on so far!
That sun flare is a BIGN!
Good morning, and, GLA!
o/
QQ
_
The Algorithm
Only for those who are interested!
Web crawlers are a central part of search engines, and details on their algorithms and architecture are kept as business secrets. When crawler designs are published, there is often an important lack of detail that prevents others from reproducing the work. There are also emerging concerns about "search engine spamming", which prevent major search engines from publishing their ranking algorithms.
An animation of the quicksort algorithm
By design paradigm
Another way of classifying algorithms is by their design methodology or paradigm. There is a certain number of paradigms, each different from the other. Furthermore, each of these categories will include many different types of algorithms. Some commonly found paradigms include:
Brute-force or exhaustive search. This is the naïve method of trying every possible solution to see which is best.
Divide and conquer. A divide and conquer algorithm repeatedly reduces an instance of a problem to one or more smaller instances of the same problem (usually recursively) until the instances are small enough to solve easily. One such example of divide and conquer is merge sorting. Sorting can be done on each segment of data after dividing data into segments and sorting of entire data can be obtained in the conquer phase by merging the segments. A simpler variant of divide and conquer is called a decrease and conquer algorithm, that solves an identical subproblem and uses the solution of this subproblem to solve the bigger problem. Divide and conquer divides the problem into multiple subproblems and so the conquer stage will be more complex than decrease and conquer algorithms. An example of decrease and conquer algorithm is the binary search algorithm.
Dynamic programming. When a problem shows optimal substructure, meaning the optimal solution to a problem can be constructed from optimal solutions to subproblems, and overlapping subproblems, meaning the same subproblems are used to solve many different problem instances, a quicker approach called dynamic programming avoids recomputing solutions that have already been computed. For example, Floyd–Warshall algorithm, the shortest path to a goal from a vertex in a weighted graph can be found by using the shortest path to the goal from all adjacent vertices. Dynamic programming and memoization go together. The main difference between dynamic programming and divide and conquer is that subproblems are more or less independent in divide and conquer, whereas subproblems overlap in dynamic programming. The difference between dynamic programming and straightforward recursion is in caching or memoization of recursive calls. When subproblems are independent and there is no repetition, memoization does not help; hence dynamic programming is not a solution for all complex problems. By using memoization or maintaining a table of subproblems already solved, dynamic programming reduces the exponential nature of many problems to polynomial complexity.
The greedy method. A greedy algorithm is similar to a dynamic programming algorithm, but the difference is that solutions to the subproblems do not have to be known at each stage; instead a "greedy" choice can be made of what looks best for the moment. The greedy method extends the solution with the best possible decision (not all feasible decisions) at an algorithmic stage based on the current local optimum and the best decision (not all possible decisions) made in a previous stage. It is not exhaustive, and does not give an accurate answer to many problems. But when it works, it will be the fastest method. The most popular greedy algorithm is finding the minimal spanning tree as given by Huffman Tree, Kruskal, Prim, Sollin.
Linear programming. When solving a problem using linear programming, specific inequalities involving the inputs are found and then an attempt is made to maximize (or minimize) some linear function of the inputs. Many problems (such as the maximum flow for directed graphs) can be stated in a linear programming way, and then be solved by a 'generic' algorithm such as the simplex algorithm. A more complex variant of linear programming is called integer programming, where the solution space is restricted to the integers.
Reduction. This technique involves solving a difficult problem by transforming it into a better known problem for which we have (hopefully) asymptotically optimal algorithms. The goal is to find a reducing algorithm whose complexity is not dominated by the resulting reduced algorithm's. For example, one selection algorithm for finding the median in an unsorted list involves first sorting the list (the expensive portion) and then pulling out the middle element in the sorted list (the cheap portion). This technique is also known as transform and conquer.
Search and enumeration. Many problems (such as playing chess) can be modeled as problems on graphs. A graph exploration algorithm specifies rules for moving around a graph and is useful for such problems. This category also includes search algorithms, branch and bound enumeration and backtracking.
1.Randomized algorithms are those that make some choices randomly (or pseudo-randomly); for some problems, it can in fact be proven that the fastest solutions must involve some randomness. There are two large classes of such algorithms: 1.Monte Carlo algorithms return a correct answer with high-probability. E.g. RP is the subclass of these that run in polynomial time)
2.Las Vegas algorithms always return the correct answer, but their running time is only probabilistically bound, e.g. ZPP.
2.In optimization problems, heuristic algorithms do not try to find an optimal solution, but an approximate solution where the time or resources are limited. They are not practical to find perfect solutions. An example of this would be local search, tabu search, or simulated annealing algorithms, a class of heuristic probabilistic algorithms that vary the solution of a problem by a random amount. The name "simulated annealing" alludes to the metallurgic term meaning the heating and cooling of metal to achieve freedom from defects. The purpose of the random variance is to find close to globally optimal solutions rather than simply locally optimal ones, the idea being that the random element will be decreased as the algorithm settles down to a solution. Approximation algorithms are those heuristic algorithms that additionally provide some bounds on the error. Genetic algorithms attempt to find solutions to problems by mimicking biological evolutionary processes, with a cycle of random mutations yielding successive generations of "solutions". Thus, they emulate reproduction and "survival of the fittest". In genetic programming, this approach is extended to algorithms, by regarding the algorithm itself as a "solution" to a problem.
An algorithm called OPIC (On-line Page Importance Computation)In OPIC, each page is given an initial sum of "cash" that is distributed equally among the pages it points to. It is similar to a Pagerank computation, but it is faster and is only done in one step. An OPIC-driven crawler downloads first the pages in the crawling frontier with higher amounts of "cash". Experiments were carried in a 100,000-pages synthetic graph with a power-law distribution of in-links. However, there was no comparison with other strategies nor experiments in the real Web.
o/
QQ
_
NAVY > I concur
In addition to your thoughts, add this to the list:
Online Spending Skyrockets -- Atrinsic and Sina Poised to Benefit
Press Release: Five Star Equities – Fri, Feb 10, 2012 8:20 AM EST
= http://finance.yahoo.com/news/Online-Spending-Skyrockets-iw-2564518170.html?x=0
Worldwide online advertising revenues continue to skyrocket as the worst of the recession fades and businesses begin to spend again. In the United States advertising revenues have hit new highs, reaching $7.88 billion in Q3 2011, representing a 2.7% increase from the previous peak in Q2 2011, according to the Internet Advertising Bureau (IAB) and PricewaterhouseCoopers (PwC US).
My point being, In addition to the reduction of debt that you mentioned, revenues should increase Substantially in 2012, with the trend.
IMO = A perfect storm
From my view, the sum af all data pionts to an APEX
Good luck!
raptor
o/
QQ
_
That is impressive for a pinky!
Thanks
yaeh!
You would think this Greek Debacle would be over already, geezzz
Looks like hope: Thirty major bondholders to take part in Greek bond swap
http://finance.yahoo.com/news/thirty-major-bondholders-part-greek-124940948.html
o/
QQ
_
Question,
Does anyone know if Fong has a history of, or is prone to stock splitts in his past?
Seems like I read some where, Atrinsic did a 4 for 1 a while back to stay listed.
I have not dug very deep on dd with Fong's past tactics.
o/
QQ
_
Does this company ever do any stock splitts, or, buy back their own shares?
I knowticed the blip on the radar a few days back when they had news.
sounds like the same news release just re-worded?
Any reason to invest here?
Thanks in advance
I think it is interesting that
Atrinsic is mentioned in the same news article as FrogAds!
February 14, 2012 - 7:30 AM EST
closeEmail this News Article
Your Name
Your Email
Friend's Name
Friend's Email
Receive Copy: yes
ATRN 0.1901 0.00
Today 5d 1m 3m 1y 5y 10y
FROG 0.20 0.00
Today 5d 1m 3m 1y 5y 10y
NSRS 0.15 0.00
Today 5d 1m 3m 1y 5y 10y
QUMI 0.47 0.00
Today 5d 1m 3m 1y 5y 10y
FrogAds.com (FROG) Lands Pamela Anderson as Their New Celebrity Spokesperson
http://at.marketwire.com/accesstracking/AccessTrackingLogServlet?PrId=851361&ProfileId=051205&sourceType=1
NEW YORK, NY -- (Marketwire) -- 02/14/12 -- FrogAds.com (OTCBB: FROG) announced yesterday that they have landed Pamela Anderson as their celebrity spokesperson. Anderson will be the spokesperson for their celebrity hosted Video News Release campaign.
Pamela Anderson, who has done a tremendous amount of work with People for the Ethical Treatment of Animals (PETA) and is widely known for her part on the hit television program, Baywatch, was the Company's choice to represent their Video News Release Campaign. The company stated "Pamela's reputation, credibility and sex appeal made her the obvious choice as host."
FrogAds.com, which merges the principles of Craigslist, eBay (EBAY), Amazon (AMZN) and YouTube offers traditional online auction business model with its leading online advertising platform. FrogAds.com is the first online destination to combine today's most actively used online arenas, positioning it as a game-changer within the online marketing industry.
Other active stocks are Quamtel Inc. (OTCBB: QUMI), North Springs Resources Corp. (OTCBB: NSRS), and Atrinsic Inc. (PINKSHEETS: ATRN)
Information, opinions and analysis contained herein are based on sources believed to be reliable, but no representation, expressed or implied, is made as to its accuracy, completeness or correctness. The opinions contained herein reflect our current judgment and are subject to change without notice. We accept no liability for any losses arising from an investor's reliance on or use of this report. This report is for information purposes only, and is neither a solicitation to buy nor an offer to sell securities. A third party has hired and paid OTC Report twelve hundred and ninety five dollars for the publication and circulation of this news release. Certain information included herein is forward-looking within the meaning of the Private Securities Litigation Reform Act of 1995, including, but not limited to, statements concerning manufacturing, marketing, growth, and expansion. Such forward-looking information involves important risks and uncertainties that could affect actual results and cause them to differ materially from expectations expressed herein. We have no ownership of equity, no representation; do no trading of any kind and send no faxes or emails.
Contact:
OTC Report
Email Contact
Source: Marketwire (February 14, 2012 - 7:30 AM EST)
News by QuoteMedia
good point
o/
QQ
-