Aggregation problem - Factbites
 Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Aggregation problem


    Note: these results are not from the primary (high quality) database.


Related Topics

In the News (Sat 4 Jul 09)

  
 Physics Today November 2000
DLA was originally introduced by Tom Witten and Len Sander as a model for irreversible colloidal aggregation, although they and others quickly realized that the model is very widely applicable.
limit that the Toda hierarchy maps exactly onto the pure Hele-Shaw problem; this suggests a strong, yet still obscure mathematical relationship between the latter problem and string theory.
Suppose further that the density of the colloidal particles is quite low, so one might imagine that the aggregation process occurs one particle at a time.
www.aip.org /pt/vol-53/iss-11/p36.html

  
 DBMS - June 1996 - Object-Oriented Analysis and Design
Another aspect of the problem is that for most developers learning about objects in typical development projects using OO client/server tools such as PowerBuilder, Delphi, SQLWindows, NewEra (Informix Software Inc.), Smalltalk, and so on, the problem domain is the least intuitive place to start.
Object modeling and many other OO concepts in Objectory and OOSE are similar to OO concepts in other methodologies.
You must be able to recognize quickly if the object methodology isn't working for your particular project, and you must find another approach that does work, whether it is object oriented or not.
www.dbmsmag.com /9606d15.html

  
 Wired News: Aggregators Attack Info Overload
Gillmor argues that RSS will solve the spam problem with "mutual syndication," since aggregators subscribe and retrieve data in what's called a "pull model," as opposed to e-mail, which other people push to a user's e-mail account.
Aggregators, such as NewsGator and AmphetaDesk, allow users to subscribe to feeds from sources as diverse as the BBC, Sci-Fi Today, Slashdot and thousands of bloggers across the world.
For instance, the popular aggregator SharpReader, which runs on Microsoft's.NET framework, displays RSS feeds in a window similar to that of a standard e-mail client.
www.wired.com /news/infostructure/0,1377,60053,00.html   (873 words)

  
 Labor theory of value - Wikipedia, the free encyclopedia
Whereas the problem with Solow's model is aggregation from micro- to macroeconomics, one interpretation is that the problem with Marx's theory is disaggregation: in Capital, Marx starts from the whole of capitalism (values) and moves to the parts (prices).
The problems with Marx's "solution" to this mathematical problem have spawned a long debate concerning the "transformation problem." This problem of finding (or rejecting) mathematical formulae linking individual prices to individual values is central to the dominant interpretation of the Marxian LTV.
In 1969, Amit Bhaduri pointed out that the "transformation" problem of finding a mathematical relationship between individual prices and individual values has intractable difficulties that are mathematically identical to those seen in the famous "Cambridge" critique of Robert Solow's aggregate production function.
en.wikipedia.org /wiki/Labor_theory_of_value   (4136 words)

  
 Decision Making and Problem Solving, by Herbert A. Simon
In applying our knowledge of decision making and problem solving to society-wide, or even organization-wide, phenomena, the problem of aggregation must be solved; that is, ways must be found to extrapolate from theories of individual decision processes to the net effects on the whole economy, polity, and society.
Increasingly, research is being directed at decision making that takes realistic account of the compromises and approximations that must be made in order to fit real-world problems to the informational and computational limits of people and computers, as well as to the inconsistencies in their values and perceptions.
Human problem solving is usually studied in laboratory settings, using problems that can be solved in relatively short periods of time (seldom more than an hour), and often seeking a maximum density of data about the solution process by asking subjects to think aloud while they work.
dieoff.org /page163.htm   (8402 words)

  
 Scope 35 - Scales and Global Change, Chapter 3, Hierarchy Theory and Global Change 1,2
Stated as a general problem, the influence of lower levels on the higher is known as the 'aggregation problem.' The problem is of real importance to this workshop because the most extensive ecological information is at small scales; for example, physiological responses of organisms and processes operate at the ecosystem scale.
This chapter outlines the elements of Hierarchy Theory which are particularly relevant to this scaling problem.
This is not to say that we will not take advantage of what we already know, but it does mean that the new problem on the new scale is unlikely to reduce to the familiar and comfortable.
www.icsu-scope.org /downloadpubs/scope35/chapter03.html   (8402 words)

  
 Route Aggregation (Linktionary term)
Route aggregation is a technique of organizing network layer IP addresses in a hierarchical way so that addresses are "topologically significant." Route aggregation in the form of CIDR (Classless Inter-Domain Routing) helped to solve IP address depletion problem in the early 1990s.
As CIDR aggregation has been implemented, the number of routes in the global routing table has reduced to approximately 35,000 routes.
In addition, route aggregation summarizes routes so there are fewer routes to advertise across the Internet.
www.linktionary.com /r/route_aggregation.html   (8402 words)

  
 BGP Route Aggregation and Filtering
This may include, but is not limited to, imposing a filter change or temporary shutdown of the offending BGP session until the problem is corrected.
Route filter requests sent to Sprint to be placed on the Sprint side of the BGP session should be written as inclusive lists (i.e..
Sprint reserves the right to set or convert any and all route filters and filter types at their own discretion to preserve network stability and route sanity.
www.sprintlink.net /policy/bgp_filters.html   (8402 words)

  
 114563.htm
If one link fails, the other adapters in the team automatically accept the full traffic load, and an alert is generated to notify IT staff of the problem.
Link Aggregation can also aggregate traffic across multiple Gigabit server adapters, for throughputs up to 8 Gbps at full duplex.
Link Aggregation and Fast EtherChannel*(FEC) automatically balance full-duplex server traffic among as many as four network adapters.
www.intel.com /cd/network/connectivity/emea/eng/114563.htm   (185 words)

  
 Let it rip
The architecture still poses a problem though when considering how to implement a feature such as 802.3ad link aggregation (a.k.a.
In short, the aggregated interface is managed as a single interface with possibly one IP address and the data paths are managed as individual NICs by unique CPUs/Squeues providing aggregation capability to Solaris with near zero overheads and linear scalability with respect to number of MAC ports that are part of the aggregation group.
The 'aggr' module registers each MAC port which is part of the aggregation with the upper layer using the 'mac_resource_add' function such that the data paths and interrupts from each MAC port can be independently managed by the upper layers (see Section 8b).
blogs.sun.com /roller/page/sunay?entry=the_solaris_networking_the_magic   (3741 words)

  
 Link aggregation with 802.3ad
Cisco's proprietary Inter-Switch Link trunking (ISL) and Adaptec's Duralink port aggregation software are just a few of the popular names for aggregation techniques that have been supported by many switch and NIC manufacturers.
The basic problem with these techniques, and the reason we now have 802.3ad, is that they were only designed to work with a single brand of network equipment.
In other words, should one of the multiple ports used in a link fail, network traffic is dynamically redirected to flow across the remaining good ports in the link.
www.networkworld.com /news/tech/2000/1113tech.html   (1065 words)

  
 CSC-Computer Science Information
The cluster aggregation of carbon fullerenes, such as the C60 "buckyball", falls into the Grand Challenge class of problems---those with potential scientific and economic impact which can be advanced by the application of high performance computers.
One GA problem that would benefit greatly from the extra computational power is a physics problem: finding minimal Carbon cluster configurations.
The implementation of these problems on massively parallel processors provides an environment for the study of the communication characteristics of the machines.
www.cse.msu.edu /~enbody/cps.html   (452 words)

  
 Uwe Thiele, Diffusion Limited Aggregation
I did a little bit on this in my diploma work, read lots of articles and wrote at the end a small one, that shows you may work around certain problems but at the end you come to the same problem you started with only that it appears at a different point.
So people numerically computed a lot of these aggregates, studied their properties, changed the rules, compared the results to aggregates occuring in nature and started to make theoretical models about the numerical aggregates to understand the amazingly universal features.
Then, another particle is droped somewhere else onto the plate and allowed to move randomly by diffusion.
www.mpipks-dresden.mpg.de /~thiele/Subjects/dla.html   (452 words)

  
 decentralized web(sitelog) update notifications and content distribution / September 9, 2004 8:25pm @ trainedmonkey
even if you eliminated all of the polling that rss and atom aggregation clients did, you would have just traded it for a thundering-herd problem when a notification was sent out.
(this is the problem that shrook’s distributed checking has, aside from the distribution of notifications not being distributed.)
the latter is fairly easy to deal with (add a bit of fuzzy logic there, where clients sometime decide to check for themselves even when they’ve been told nothing is new), but i’m not so sure about the forgery problem in the absence of some sort of signing mechanism.
trainedmonkey.com /entry/1891   (452 words)

  
 The Cutting Stock Problem : Kantorovich ...
Aggregation of identical columns in the Master Problem.
However, Dantzig-Wolfe decomposition provides the same bound as the Gilmore-Gomory LP bound if sub-problems are solved as...
integer Knapsack Problems, (which provide extreme point columns).
www.crt.umontreal.ca /~soumis/Column/sld024.htm   (33 words)

  
 Solutions :: P-MP :: TeraStar™ Turbo :: EtherAnt-Turbo (-LR) :: Terabeam Wireless
The EtherAnt Turbo supports 1 to 5 wired users and features the award-winning industry standard TurboCell® software, a protocol which significantly enhances the performance of outdoor 802.11b systems through the use of adaptive dynamic polling, bandwidth allocation at the client, and packet aggregation.
TurboCell® solves the hidden node problem inherent in adding nodes to outdoor networks.
This all-in-one unit includes Terabeam's advanced chip set, an embedded 18 dBi antenna, and a 2.4 GHz radio.
www.terabeam.com /solutions/p-mp/802_11b_turbo/etherant_turbo.php   (536 words)

  
 Damian Fernandez Perez
A study of the fragile base class problem.
Observable or invocable behaviour - you have to choose.
Inheritance of object behavior - consistent extension of object life cycles.
www.cs.toronto.edu /~damian/oo.html   (536 words)

  
 Algorithms and Data Structures
In this paper we focus on the impact of data aggregation in terms of energy consumption reduction: we propose a combinatorial optimization problem that models the problem of designing routing algorithms that optimize the energy saving obtained by data aggregation.
The QoS-aware Multicommodity Flow (MCF) problem is an important generalization of the weighted MCF problem that models realistic network design scenarios where commodity demands and profits (for routing flow) are elastic to the Quality-of-Service of the paths along which the commodity is routed.
We study the computational power of a streaming model where at each pass one input stream is read and, differently from the classical read-only streaming model, one output stream is written.
gauguin.info.uniroma2.it /~italiano/Events/ADS2005   (3941 words)

  
 MicroQEDprogram.doc
Consumer theory (8 lectures) Reading: MWG 2A-D, 1B, 3A-D, 2E, 3E, 3G, 3I, 4B Topics: The basics of economic analysis, introduction to the consumer problem, classical demand theory, properties of utility and demand functions, solving the consumer problem, welfare evaluation, aggregation, consumption with endowments, consumption over time.
Producer theory (3 lectures) Reading: MWG 5 Topics: Production sets, production with a single output, cost minimization, the geometry of cost functions, aggregation, efficient production, constant returns technologies.
Formal requirements for the course include regular attendance and participation in lectures, a number of problem sets, a midterm exam and a final examination.
merlin.fae.ua.es /iturbe/MicroQEDprogram.doc   (950 words)

  
 Computer Science Colloquium
The methods used to attack this problem include an interior point algorithm, dual steepest edge simplex, cost perturbation, model aggregation, branching on set-partitioning constraints and prioritizing the order of branching.
Given a flight schedule and set of aircraft, the fleet assignment problem is to determine which type of aircraft should fly each flight segment.
Our model of the fleet assignment problem is a large multi-commodity flow problem with side constraints defined on a time-expanded network.
longwood.cs.ucf.edu /csdept/colloq/94-95/95-02-17.html   (515 words)

  
 Constraint-Directed Scheduling
A problem topology may be altered by problem reformulations, such as abstraction and aggregation.
A problem topology is represented by a constraint graph where nodes are activities and arcs are constraints among the activities, e.g., temporal and resource.
Problem textures are fundamental measures of constraint graphs that indicate decision complexity, uncertainty and elasticity.
www.eil.utoronto.ca /scheduling/chs   (234 words)

  
 NPG web focus: imaging in cell biology : Review
Overall, this aggregation problem would most easily be solved by using monomeric fluorescent proteins (Fig.
Indeed, DsRed tends to produce more serious aggregation when fused to a host protein, although, in an exception to this trend, fusion of DsRed to protein kinase C-) retains the dynamic redistribution of the enzyme after stimulation (Fig.
First, aggregation might be due to electrostatic or hydrophobic interactions between fluorescent proteins.
www.nature.com /focus/cellbioimaging/content/full/ncb1031.html   (4329 words)

  
 ARNO show document
This paper provides a discussion of the developments in econometric modelling that are designed to deal with the problem of spurious Granger causality relationships that can arise from temporal aggregation.
We do this by conducting causality tests in discrete time models that: (a) impose the temporal aggregation restrictions exactly; (b) impose the temporal aggregation restrictions approximately; and (c) do not impose these restrictions at all.
In an application to testing for money-income causality, we demonstrate the importance of incorporating exact temporal aggregation restrictions on the discrete time data.
arno.uvt.nl /show.cgi?did=138216   (4329 words)

  
 Chem 200A PROTEIN FOLDING -2 FALL 1991
Protein aggregation and precipitation is a major problem in such diverse areas as disease states, biotechnological development of drugs, production of recombinant proteins, and studies of protein folding and stability.
Protein aggregation is also an important factor in processes such as the crystallization of samples for X-ray diffraction studies and bone growth.
Lansbury has shown with AD peptides that a lag is observed in the aggregation process as monitored by light scattering; seeding the solution overcame the lag, suggesting that nucleation was responsible.
www.chemistry.ucsc.edu /~fink/200lecture/lecture17.htm   (4329 words)

  
 Linear classifier from LiveJournal
[math.ST/0511468] Given a collection of $M$ different estimators or classifiers, we study the problem of model selection type aggregation, i.e., we construct a new estimator or classifier, called aggregate, which is nearly as good as the best among them with respect to a given risk criterion.
(PMA), Alexandre Tsybakov (PMA) Given a collection of $M$ different estimators or classifiers, we study the problem of model selection type aggregation, i.e., we construct a new estimator or classifier, called aggregate, which is nearly as good as the best among them with respect to a given risk criterion.
We use a Bayesian classifier with class-conditional probability density functions (likelihoods) described as Gaussian mixtures, yielding a fast classification, while being able to model complex decision surfaces and compare...
www.ljseek.com /search/Linear%20classifier   (594 words)

  
 Production Functions Look at Unobservables
Three problems seem particularly troublesome: the "unobservables' problem, especially with regard to input utilization; the aggregation problem; and the simultaneous equations problem.
The other question is one with which most researchers on productivity have struggled: how to correct productivity for cyclical variations in the utilization of inputs.
Many economists currently take a somewhat jaundiced view of the estimation of aggregate production functions.
www.cepr.org /pubs/bulletin/dps/dp34.htm   (222 words)

  
 An Aggregation-Based Domain Decomposition Preconditioner for Groundwater Flow
An Aggregation-Based Domain Decomposition Preconditioner for Groundwater Flow: SIAM Journal on Scientific Computing Vol.
Computational results for Laplace's equation and Richards' equation show excellent scalability, although no theory is yet available to support the results for the difficult nonlinear problem.
We consider theoretical and computational issues associated with an aggregation-based domain decomposition preconditioner applied to a Bi-CGSTAB iterative solver used to solve both Laplace's equation and an important nonlinear model from hydrology used to simulate unsaturated flow, Richards' equation.
epubs.siam.org /sam-bin/dbq/article/37227   (222 words)

  
 Security Service
Finally papers [2], [5] and [6] discuss in details the enforcement of federated security policies using transitional graphs: [5] discusses the aggregation constraints based on true graphs, [6] address the false graphs, and [2] provides a uniform view of both [5] and [6].
Z Tari and P. Ratnasingham: A Framework for Aggregation Constraint Monitoring in Federated Databases.
Z Tari: Aggregation in Federated Databases: The DOK Approach.
goanna.cs.rmit.edu.au /~zahirt/DOK/security.html   (222 words)

  
 DBLP: Jan Mandel
Petr Vanek, Jan Mandel, Marian Brezina: Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems.
Jan Mandel, Marian Brezina: Balancing domain decomposition for problems with large jumps in coefficients.
Petr Vanek, Marian Brezina, Jan Mandel: Parallel Algebraic Multilevel Solver Based on Smoothed Aggregation Coarsening.
www.informatik.uni-trier.de /~ley/db/indices/a-tree/m/Mandel:Jan.html   (222 words)

  
 draft-bragg-ipv6-multihoming-00.txt
Other authors eg [3][4], have demonstrated that the "traditional" solution to this problem is incompatible with the route aggregation objectives of IPv6, because it requires the explicit exposure of the prefix of the multi-homed entity in the default-free zone.
Introduction The addressing scheme of IPv6 [2] is motivated by the need to perform the aggressive route aggregation required to keep routing tables in the default-free zone of the Internet to a manageable size.
November 2000 Routing support for IPv6 Multi-homing Status of this Memo This document is an Internet-Draft and is in full conformance with all provisions of Section 10 of RFC2026.
www.watersprings.org /pub/id/draft-bragg-ipv6-multihoming-00.txt   (1339 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.