The Landweber iteration or Landweber algorithm is an algorithm to solve ill-posed linear inverse problems, and it has been extended to solve non-linear problems that involve constraints. The method was first proposed in the 1950s by Louis Landweber, and it can be now viewed as a special case of many other more general methods. == Basic algorithm == The original Landweber algorithm attempts to recover a signal x from (noisy) measurements y. The linear version assumes that y = A x {\displaystyle y=Ax} for a linear operator A. When the problem is in finite dimensions, A is just a matrix. When A is nonsingular, then an explicit solution is x = A − 1 y {\displaystyle x=A^{-1}y} . However, if A is ill-conditioned, the explicit solution is a poor choice since it is sensitive to any noise in the data y. If A is singular, this explicit solution doesn't even exist. The Landweber algorithm is an attempt to regularize the problem, and is one of the alternatives to Tikhonov regularization. We may view the Landweber algorithm as solving: min x ‖ A x − y ‖ 2 2 / 2 {\displaystyle \min _{x}\|Ax-y\|_{2}^{2}/2} using an iterative method. The algorithm is given by the update x k + 1 = x k − ω A ∗ ( A x k − y ) . {\displaystyle x_{k+1}=x_{k}-\omega A^{}(Ax_{k}-y).} where the relaxation factor ω {\displaystyle \omega } satisfies 0 < ω < 2 / σ 1 2 {\displaystyle 0<\omega <2/\sigma _{1}^{2}} . Here σ 1 {\displaystyle \sigma _{1}} is the largest singular value of A {\displaystyle A} . If we write f ( x ) = ‖ A x − y ‖ 2 2 / 2 {\displaystyle f(x)=\|Ax-y\|_{2}^{2}/2} , then the update can be written in terms of the gradient x k + 1 = x k − ω ∇ f ( x k ) {\displaystyle x_{k+1}=x_{k}-\omega \nabla f(x_{k})} and hence the algorithm is a special case of gradient descent. For ill-posed problems, the iterative method needs to be stopped at a suitable iteration index, because it semi-converges. This means that the iterates approach a regularized solution during the first iterations, but become unstable in further iterations. The reciprocal of the iteration index 1 / k {\displaystyle 1/k} acts as a regularization parameter. A suitable parameter is found, when the mismatch ‖ A x k − y ‖ 2 2 {\displaystyle \|Ax_{k}-y\|_{2}^{2}} approaches the noise level. Using the Landweber iteration as a regularization algorithm has been discussed in the literature. == Nonlinear extension == In general, the updates generated by x k + 1 = x k − τ ∇ f ( x k ) {\displaystyle x_{k+1}=x_{k}-\tau \nabla f(x_{k})} will generate a sequence f ( x k ) {\displaystyle f(x_{k})} that converges to a minimizer of f whenever f is convex and the stepsize τ {\displaystyle \tau } is chosen such that 0 < τ < 2 / ( ‖ ∇ f ‖ 2 ) {\displaystyle 0<\tau <2/(\|\nabla f\|^{2})} where ‖ ⋅ ‖ {\displaystyle \|\cdot \|} is the spectral norm. Since this is special type of gradient descent, there currently is not much benefit to analyzing it on its own as the nonlinear Landweber, but such analysis was performed historically by many communities not aware of unifying frameworks. The nonlinear Landweber problem has been studied in many papers in many communities; see, for example. == Extension to constrained problems == If f is a convex function and C is a convex set, then the problem min x ∈ C f ( x ) {\displaystyle \min _{x\in C}f(x)} can be solved by the constrained, nonlinear Landweber iteration, given by: x k + 1 = P C ( x k − τ ∇ f ( x k ) ) {\displaystyle x_{k+1}={\mathcal {P}}_{C}(x_{k}-\tau \nabla f(x_{k}))} where P {\displaystyle {\mathcal {P}}} is the projection onto the set C. Convergence is guaranteed when 0 < τ < 2 / ( ‖ A ‖ 2 ) {\displaystyle 0<\tau <2/(\|A\|^{2})} . This is again a special case of projected gradient descent (which is a special case of the forward–backward algorithm) as discussed in. == Applications == Since the method has been around since the 1950s, it has been adopted and rediscovered by many scientific communities, especially those studying ill-posed problems. In X-ray computed tomography it is called simultaneous iterative reconstruction technique (SIRT). It has also been used in the computer vision community and the signal restoration community. It is also used in image processing, since many image problems, such as deconvolution, are ill-posed. Variants of this method have been used also in sparse approximation problems and compressed sensing settings.
Autonomous logistics
Autonomous logistics describes systems that provide unmanned, autonomous transfer of equipment, baggage, people, information or resources from point-to-point with minimal human intervention. Autonomous logistics is a new area being researched and currently there are few papers on the topic, with even fewer systems developed or deployed. With web enabled cloud software there are companies focused on developing and deploying such systems which will begin coming online in 2018. == Autonomous logistics vehicles == There are several subclasses of autonomous logistics vehicles: Ground autonomous logistics Based on Unmanned ground vehicle technology, a large autonomous logistics tracked carrier, which can be deployed in a tropical forest for day and night, has been developed. Another example is the TerraMax autonomous truck based on Oshkosh's Medium Tactical Vehicle Replacement (MTVR) military truck platform. Most recently, TerraMax competed in the 2007 Darpa Urban Challenge. The MTVR was designed for the U.S. Marine Corps with a 70% off-road mission profile. TerraMax's unmanned ground vehicle kit does not interfere with the conventional operation of the vehicle. A robust sensor suite allows for 360-degree situational awareness around TerraMax. Elements of the autonomous navigation kit could be used to enhance driver awareness. The complete kit could be used in applications such as snow removal on airport runways. Aerial autonomous logistics Based on unmanned aerial vehicle technology, aerial autonomous logistics (or logistics UAVs) provides transfer of resources and equipment in disaster relief situations, replenishment operations, reconnaissance operations where information is gathered, and general parcel or package delivery. Space autonomous logistics Describes the ability to provide logistics to and from space, be that orbital, lunar or beyond. Current space logistics vehicle examples are the Progress spacecraft, Russian expendable freighter uncrewed resupply spacecraft and the Automated Transfer Vehicle, expendable uncrewed resupply spacecraft developed by the European Space Agency. Above Water autonomous logistics Based on unmanned surface vehicle technology, this class of vehicles provides a range of surface fleet replenishment and equipment transfer capabilities. Subsea autonomous logistics Using autonomous underwater vehicle technology, these vehicles provide re-supply to underwater facilities, reconnaissance of underwater structures, emergency recovery capability, and so on. == Agent-based logistics == Shipping containers handle most of today's intercontinental transport of packaged goods. Managing them in terms of planning and scheduling is a challenging task due to the complexity and dynamics of the involved processes. Hence, recent developments show an increasing trend towards autonomous control with software agents acting on behalf of the logistic objects. Despite the high degree of autonomy it is still necessary to cooperate in order to achieve certain goals. The current trends and recent changes in logistics lead to new, complex and partially conflicting requirements for logistic planning and control systems. Due to the distributed nature of logistics, the usage of agent technology is promising. Due to the mobile nature of logistics, the usage of mobile agent technology is promising as well. Scenarios of usage of mobile agents in logistics has been envisioned.
Texas Senate Bill 20
Texas Senate Bill 20 (S.B. 20), also known as the "Stopping AI-Generated Child Pornography Act", is a 2025 law in the state of Texas that creates new criminal offenses for those who possess, promote, or view visual material deemed obscene, which is said to depict a child, whether it is an actual person, animated or cartoon depiction, or an image of someone created through computer software or artificial intelligence. It was passed by the Texas Legislature on May 28, 2025, unanimously in both chambers. It was signed into law by Governor Greg Abbott on June 20, 2025. It went into effect on September 1, 2025. It was authored by Pete Flores and co-sponsored by Brent Hagenbuch, Juan Hinojosa, Joan Huffman, Phil King, and Tan Parker, as part of a package of legislation in the Texas House and Senate about A.I. and child pornography. Some supporters called it "common-sense" legislation falling within the "proper role" of government, protecting children and the "common good" within the state, with Heidi Ruiz, a police sergeant in Houston, describing the bill as "fantastic" and "fabulous." The bill drew comparisons to language, within Texas state legislation, which aimed to institute state-level book bans. Critics described the law as unconstitutional, saying it violated the Free Speech Clause of the First Amendment which prohibits abridgement of freedom of speech and the press, including the legal precedent set in Ashcroft v. Free Speech Coalition. The Comic Book Legal Defense Fund vowed to support those wrongly accused under the law. Much of the controversy regarding S.B. 20 involves the broad language pertaining to "obscene" pornographic images as including A.I.-created, animated, and cartoon depictions, with some critics arguing it could have a chilling effect on anime, manga, graphic novels, and other media produced, distributed, or created within Texas. == Provisions == S.B. 20 gives Texas police more provisions to restrict artificial intelligence-created child pornography, creating new criminal charge for possessing material depicting an underage person, under age 18, whether this child is an actual person or not. Those charged with this felony offense could go to state jail, but this could be elevated if the person charged has a prior conviction, of a $10,000 fine and two years in prison. == Reactions == === Support === Lieutenant Governor Dan Patrick applauded the unanimous passage of the law in the Texas Senate and called it "a priority" to protect children in Texas, and Texas citizens and thanked Pete Flores for his work on "this important issue". He later described the bill as part of the "bold, conservative agenda" that the Texas legislature passed during the 2025 legislative session. Phil King, one of the bill's co-sponsors, said that issue of child pornography had "infiltrated" the state's schools and said he was proud that the Texas legislature had "taken decisive action to protect our vulnerable Texans". Another co-sponsor of the legislation, Tan Parker described the law as "decisive action" to protect the children within Texas, and said he looked "forward to advancing this critical legislation" onward from the Texas Senate Criminal Justice Committee. He also described the legislation as "critical" action to protect the state's children from A.I.-generated child pornography and an "effective tool for law enforcement" to crack down on child porn perpetrators. Other supporters, such as police, and prosecutors, called the legislation an "important step" to ensure that images generated with A.I., along with deepfakes, "can't be shared with impunity" and necessary to ensure children's protection. Flores told senators that technology which enabled the production of "offensive" material by child predators had "no redeeming value whatsoever" and asserted that the materials had often been "used to groom and abuse children". John Leigh, a co-founder of Anime Matsuri, one of the largest conventions for anime within Texas, reassured those who contacted him, saying that the law is not targeted at anime and manga fans, stated that he supported the legislation, describing it as a step "in the right direction," and said that he did not believe it would "negatively impact" anime or related art in the state. Also, State Representative Dade Phelan emphasized the legislation's urgency to deal with A.I. and child pornography, adding that they need to "put some guardrails on it to where the public is being taken care of". The Texas Policy Research Foundation supported the legislation, saying that although it may lead to increased demands on state and local governmental resources, higher costs for local governments, and possible "civil liberty concerns" around online censorship, it represents a "necessary legal update" to address exploitation of children online, while "modernizing enforcement mechanisms" and recommended that lawmakers vote in favor of the law. Additionally, the group Texans for Fiscal Responsibility supported the law, arguing that it strengthened state law, upheld public safety, protected minors, and called it a "common-sense bill" protecting and promoting the "common good", children, and fell within the "proper role" of government. The Texas Public Policy Foundation also expressed their support for the law. A policy director for aforementioned conservative think tank, Zach Whiting, told the Texas Senate Committee on Criminal Justice, on March 4, 2025, that the foundation would assist legislators ans staff to "advance any and all measures to protect kids online" and shared an excerpt from of research paper about threats posed by A.I. in creating "sexually explicit deepfakes of children". === Opposition === Although the bill passed both chambers unanimously, there were some reports that the bill stalled due to opposition from Democratic lawmakers. Additionally, some individuals expressed concerns about the broad nature of the law's provisions. Anime Matsuri co-founder Deneice Leigh called for the law's wording to be clarified because "artists are anxious about displaying or selling fan art" even if the intention is "not be to penalize creators". She also described the bill as "vague and open to interpretation" as to what would be considered obscene and offensive while noting that the bill is not aiming to "target artists". Benjamin Napier, owner of Mansfield Comics and Manga in Mansfield, Texas, said that at first he felt the law was "ridiculous" and "kind of frivolous" at first, part of a "misguided puritanical onslaught", and noted that he would not cow "to the puritanical regime" if it was enacted. Kirsten Cather, an Asian Studies scholar at University of Texas, expressed concern at the law's misinterpretation because "many anime characters appear youthful, regardless of their actual age", said that the law could "stifle creative expression", and noted that the law's scope is broad enough to have manga and anime under scrutiny, a "real slippery slope here that's being breached". Marcel Green of Screen Rant said that the law's ambiguity led to concerns from manga and anime fans, and theorized that the law's application to a fan within Texas, who downloaded the 368th chapter of My Hero Academia, which has a "sexualized depiction" of an "underage high school student", would result in a criminal offense of "180 days to two years in state jail, along with a fine of up to $10,000". Green also said the law is problematic because many anime and manga characters are young, with many protagonists as minors and argued that the law could apply in limited cases, if state officials deemed an anime or manga under scrutiny as lacking "artistic value". Evan D. Mullicane, on the same site, said the vague wording of the legislation made it "dangerous" for anime such as Dragon Ball and Naruto, and could impact more than hentai, predicting it will be used against more than its "intended target" and be used to censor stories with "young LGBTQIA characters". Another critic on the same site, Carlyle Edmundson, called for anime fans to step up and prevent the law's enactment "for the good of artists and fans everywhere", saying that the legislation was "draconian" and claimed it was the most extreme case of anime and manga censorship in U.S. history. Nick Valdez of ComicBook.com said that the legislation could lead to censorship of "many anime and manga projects," like Kill la Kill and The 100 Girlfriends Who Really, Really, Really, Really, Really Love You, becoming a crime, and said that even if the law is enforced in a case-by-case basis, it could lead to a "much larger ban of materials in the state" itself due to the content of certain manga and anime. Vanessa Esguerra of The Mary Sue argued that possession of manga like Berserk and Vagabond, or viewing Dandadan, could be deemed illegal under the law, due to various parts of each of these media, and asserted that viewing and owning certain anime and other media, falling under the law's provisions,
Minimum intelligent signal test
The minimum intelligent signal test, or MIST, is a variation of the Turing test proposed by Chris McKinstry in which only boolean (yes/no or true/false) answers may be given to questions. The purpose of such a test is to provide a quantitative statistical measure of humanness, which may subsequently be used to optimize the performance of artificial intelligence systems intended to imitate human responses. McKinstry gathered approximately 80,000 propositions that could be answered yes or no, e.g.: Is Earth a planet? Was Abraham Lincoln once President of the United States? Is the sun bigger than my foot? Do people sometimes lie? He called these propositions Mindpixels. These questions test both specific knowledge of aspects of culture, and basic facts about the meaning of various words and concepts. It could therefore be compared with the SAT, intelligence testing and other controversial measures of mental ability. McKinstry's aim was not to distinguish between shades of intelligence but to identify whether a computer program could be considered intelligent at all. According to McKinstry, a program able to do much better than chance on a large number of MIST questions would be judged to have some level of intelligence and understanding. For example, on a 20-question test, if a program were guessing the answers at random, it could be expected to score 10 correct on average. But the probability of a program scoring 20 out of 20 correct by guesswork is only one in 220, i.e. one in 1,048,576; so if a program were able to sustain this level of performance over several independent trials, with no prior access to the propositions, it should be considered intelligent. == Discussion == McKinstry criticized existing approaches to artificial intelligence such as chatterbots, saying that his questions could "kill" AI programs by quickly exposing their weaknesses. He contrasted his approach, a series of direct questions assessing an AI's capabilities, to the Turing test and Loebner Prize method of engaging an AI in undirected typed conversation. Critics of the MIST have noted that it would be easy to "kill" a McKinstry-style AI too, due to the impossibility of supplying it with correct answers to all possible yes/no questions by ways of a finite set of human-generated Mindpixels: the fact that an AI can answer the question "Is the sun bigger than my foot?" correctly does not mean that it can answer variations like "Is the sun bigger than (my hand | my liver | an egg yolk | Alpha Centauri A | ...)" correctly, too. However, the late McKinstry might have replied that a truly intelligent, knowledgeable entity (on a par with humans) would be able to work out answers such as (yes | yes | yes | don't know | ...) by applying its knowledge of the relative sizes of the objects named. In other words, the MIST was intended as a test of AI, not as a suggestion for implementing AI. It can also be argued that the MIST is a more objective test of intelligence than the Turing test, a subjective assessment that some might consider to be more a measure of the interrogator's gullibility than of the machine's intelligence. According to this argument, a human's judgment of a Turing test is vulnerable to the ELIZA effect, a tendency to mistake superficial signs of intelligence for the real thing, anthropomorphizing the program. The response, suggested by Alan Turing's essay Computing Machinery and Intelligence, is that if a program is a convincing imitation of an intelligent being, it is in fact intelligent. The dispute is thus over what it means for a program to have "real" intelligence, and by what signs it can be detected. A similar debate exists in the controversy over great ape language, in which nonhuman primates are said to have learned some aspects of sign languages but the significance of this learning is disputed.
Hive (artificial intelligence company)
Hive is an American artificial intelligence company offering machine learning models via APIs to enterprise customers. Hive uses around 700,000 gig workers to train data for its models through its Hive Work app. One of Hive's major offerings is to provide automated content moderation services. == Products == Hive is reported to have been engaged to provide content moderation services to social news aggregator Reddit, Giphy, BeReal, Donald Trump-affiliated social network Truth Social, and on online chat website Chatroulette. Parler, after its shutdown by content service providers in early 2021 due to a lack of content moderation, integrated with Hive and was allowed back in the App Store. Hive's content moderation models have been leveraged widely in the livestreaming industry, where the cost of human moderation is high. Hive's models have also been used in events such as the Super Bowl and March Madness, and its contextual advertising models used by NBC Universal and Vevo. Hive provides APIs to detect deepfakes and AI-generated artwork. In early 2023, Hive released a free demo text classifier intended to detect AI-generated text. Mark Hachman at PC World rated Hive's classifier favorably and found it more reliable than OpenAI's AI text classifier. == History == Hive was founded by Kevin Guo and Dmitriy Karpman, and in April 2021, announced $85M in new capital at a valuation of $2 billion.
Inductive probability
Inductive probability attempts to give the probability of future events based on past events. It is the basis for inductive reasoning, and gives the mathematical basis for learning and the perception of patterns. It is a source of knowledge about the world. There are three sources of knowledge: inference, communication, and deduction. Communication relays information found using other methods. Deduction establishes new facts based on existing facts. Inference establishes new facts from data. Its basis is Bayes' theorem. Information describing the world is written in a language. For example, a simple mathematical language of propositions may be chosen. Sentences may be written down in this language as strings of characters. But in the computer it is possible to encode these sentences as strings of bits (1s and 0s). Then the language may be encoded so that the most commonly used sentences are the shortest. This internal language implicitly represents probabilities of statements. Occam's razor says the "simplest theory, consistent with the data is most likely to be correct". The "simplest theory" is interpreted as the representation of the theory written in this internal language. The theory with the shortest encoding in this internal language is most likely to be correct. == History == Probability and statistics was focused on probability distributions and tests of significance. Probability was formal, well defined, but limited in scope. In particular its application was limited to situations that could be defined as an experiment or trial, with a well defined population. Bayes's theorem is named after Rev. Thomas Bayes 1701–1761. Bayesian inference broadened the application of probability to many situations where a population was not well defined. But Bayes' theorem always depended on prior probabilities, to generate new probabilities. It was unclear where these prior probabilities should come from. Ray Solomonoff developed algorithmic probability which gave an explanation for what randomness is and how patterns in the data may be represented by computer programs, that give shorter representations of the data circa 1964. Chris Wallace and D. M. Boulton developed minimum message length circa 1968. Later Jorma Rissanen developed the minimum description length circa 1978. These methods allow information theory to be related to probability, in a way that can be compared to the application of Bayes' theorem, but which give a source and explanation for the role of prior probabilities. Marcus Hutter combined decision theory with the work of Ray Solomonoff and Andrey Kolmogorov to give a theory for the Pareto optimal behavior for an Intelligent agent, circa 1998. === Minimum description/message length === The program with the shortest length that matches the data is the most likely to predict future data. This is the thesis behind the minimum message length and minimum description length methods. At first sight Bayes' theorem appears different from the minimimum message/description length principle. At closer inspection it turns out to be the same. Bayes' theorem is about conditional probabilities, and states the probability that event B happens if firstly event A happens: P ( A ∧ B ) = P ( B ) ⋅ P ( A | B ) = P ( A ) ⋅ P ( B | A ) {\displaystyle P(A\land B)=P(B)\cdot P(A|B)=P(A)\cdot P(B|A)} becomes in terms of message length L, L ( A ∧ B ) = L ( B ) + L ( A | B ) = L ( A ) + L ( B | A ) . {\displaystyle L(A\land B)=L(B)+L(A|B)=L(A)+L(B|A).} This means that if all the information is given describing an event then the length of the information may be used to give the raw probability of the event. So if the information describing the occurrence of A is given, along with the information describing B given A, then all the information describing A and B has been given. ==== Overfitting ==== Overfitting occurs when the model matches the random noise and not the pattern in the data. For example, take the situation where a curve is fitted to a set of points. If a polynomial with many terms is fitted then it can more closely represent the data. Then the fit will be better, and the information needed to describe the deviations from the fitted curve will be smaller. Smaller information length means higher probability. However, the information needed to describe the curve must also be considered. The total information for a curve with many terms may be greater than for a curve with fewer terms, that has not as good a fit, but needs less information to describe the polynomial. === Inference based on program complexity === Solomonoff's theory of inductive inference is also inductive inference. A bit string x is observed. Then consider all programs that generate strings starting with x. Cast in the form of inductive inference, the programs are theories that imply the observation of the bit string x. The method used here to give probabilities for inductive inference is based on Solomonoff's theory of inductive inference. ==== Detecting patterns in the data ==== If all the bits are 1, then people infer that there is a bias in the coin and that it is more likely also that the next bit is 1 also. This is described as learning from, or detecting a pattern in the data. Such a pattern may be represented by a computer program. A short computer program may be written that produces a series of bits which are all 1. If the length of the program K is L ( K ) {\displaystyle L(K)} bits then its prior probability is, P ( K ) = 2 − L ( K ) {\displaystyle P(K)=2^{-L(K)}} The length of the shortest program that represents the string of bits is called the Kolmogorov complexity. Kolmogorov complexity is not computable. This is related to the halting problem. When searching for the shortest program some programs may go into an infinite loop. ==== Considering all theories ==== The Greek philosopher Epicurus is quoted as saying "If more than one theory is consistent with the observations, keep all theories". As in a crime novel all theories must be considered in determining the likely murderer, so with inductive probability all programs must be considered in determining the likely future bits arising from the stream of bits. Programs that are already longer than n have no predictive power. The raw (or prior) probability that the pattern of bits is random (has no pattern) is 2 − n {\displaystyle 2^{-n}} . Each program that produces the sequence of bits, but is shorter than the n is a theory/pattern about the bits with a probability of 2 − k {\displaystyle 2^{-k}} where k is the length of the program. The probability of receiving a sequence of bits y after receiving a series of bits x is then the conditional probability of receiving y given x, which is the probability of x with y appended, divided by the probability of x. ==== Universal priors ==== The programming language affects the predictions of the next bit in the string. The language acts as a prior probability. This is particularly a problem where the programming language codes for numbers and other data types. Intuitively we think that 0 and 1 are simple numbers, and that prime numbers are somehow more complex than numbers that may be composite. Using the Kolmogorov complexity gives an unbiased estimate (a universal prior) of the prior probability of a number. As a thought experiment an intelligent agent may be fitted with a data input device giving a series of numbers, after applying some transformation function to the raw numbers. Another agent might have the same input device with a different transformation function. The agents do not see or know about these transformation functions. Then there appears no rational basis for preferring one function over another. A universal prior insures that although two agents may have different initial probability distributions for the data input, the difference will be bounded by a constant. So universal priors do not eliminate an initial bias, but they reduce and limit it. Whenever we describe an event in a language, either using a natural language or other, the language has encoded in it our prior expectations. So some reliance on prior probabilities are inevitable. A problem arises where an intelligent agent's prior expectations interact with the environment to form a self reinforcing feed back loop. This is the problem of bias or prejudice. Universal priors reduce but do not eliminate this problem. === Universal artificial intelligence === The theory of universal artificial intelligence applies decision theory to inductive probabilities. The theory shows how the best actions to optimize a reward function may be chosen. The result is a theoretical model of intelligence. It is a fundamental theory of intelligence, which optimizes the agents behavior in, Exploring the environment; performing actions to get responses that broaden the agents knowledge. Competing or co-operating with another agent; games. Balancing short and long term rewards. In general no agent will always provi
Sense Networks
Sense Networks is a New York City based company with a focus on applications that analyze big data from mobile phones, carrier networks, and taxicabs, particularly by using machine learning technology to make sense of large amounts of location (latitude/longitude) data. In 2009, Sense was named one of "The 25 Most Intriguing Startups in the World" by Bloomberg Businessweek and was called "The Next Google" on the cover of Newsweek. In 2014, Sense Networks was acquired by YP, "the local search and advertising company owned by Cerberus Capital Management and AT&T." It was subsequently sold off to Verve in 2017 == History == Sense Networks was founded by Greg Skibiski in February 2006 (2003?) near his home in Northampton, Massachusetts. After establishing an office in NoHo, New York City near Silicon Alley, Skibiski recruited Alex Pentland, Director of Human Dynamics Research and former Academic Head of the MIT Media Lab, Tony Jebara, Associate Professor and Head of the Machine Learning Laboratory at Columbia University, and Christine Lemke, who would later become co-founders. Sense Networks investors include Intel Capital, Javelin Venture Partners, and Kenan Altunis. Founder Greg Skibiski was pushed out by lead investor Intel Capital in November 2009 following the company's B round of financing. During the same week, the company won the Emerging Communications Conference "Company to Watch" Award. The company has three published patent applications for analyzing sensor data streams: System and Method of Performing Location Analytics (US 20090307263), Comparing Spatial-Temporal Trails in Location Analytics (US 20100079336), and Anomaly Detection in Sensor Analytics (US 20100082301). The company was acquired by the Yellow Pages in 2014. This is a marketing conglomerate under AT&T and Cerberus Capital Management. == Products and services == The Citysense consumer application that shows hotspots of human activity in real-time from mobile phone location and taxicab GPS data was named by ReadWriteWeb (in The New York Times) as "Top 10 Internet of Things Products of 2009". The Cabsense consumer application that shows the best place to catch a New York City taxicab based on GPS data from the vehicle was launched in March 2010. The Macrosense platform is for mobile application providers and mobile phone carriers to analyze billions of customer location data points for predictive analytics in advertising and churn management applications. == Privacy and data ownership == The company allows users to opt-out of their service through their website, and users may monitor their profile through their application. The company does not collect identifiable data (such as phone numbers or names); it collects data received from cellphone to construct anonymous profiles of consumers. This anonymous data/profiles may then be sold to third parties. The company's privacy and data ownership policies are based on The New Deal on Data, as advocated by Alex "Sandy" Pentland, head of the Human Dynamics group at MIT.