3 resultados para information structure
em DigitalCommons - The University of Maine Research
Resumo:
An effective solution to model and apply planning domain knowledge for deliberation and action in probabilistic, agent-oriented control is presented. Specifically, the addition of a task structure planning component and supporting components to an agent-oriented architecture and agent implementation is described. For agent control in risky or uncertain environments, an approach and method of goal reduction to task plan sets and schedules of action is presented. Additionally, some issues related to component-wise, situation-dependent control of a task planning agent that schedules its tasks separately from planning them are motivated and discussed.
Resumo:
The jumbo flying squid, Dosidicus gigas, support an important squid fishery off the Exclusive Economic Zone of Chilean waters. However, we only have limited information about their biology. In this study, age, growth and population structure of D. gigas were studied using statoliths from 333 specimens (386 females and 147 males) randomly sampled in the Chinese squid jigging surveys from 2007 to 2008 off the Exclusive Economic Zone of Chile. Mantle lengths (MLs) of the sample ranged from 206 to 702 mm, and their ages were estimated from 150 to 307 days for females and from 127 to 302 days for males. At least two spawning groups were identified, the main spawning peak tended to occur between August and November (austral spring group), and the secondary peak appeared during March to June (austral autumn group). The ML-age relationship was best modelled by a linear function for the austral spring group and a power function for the austral autumn group, and the body weight (BW)-age relationship was best described by an exponential function for both the groups. Instantaneous relative growth rates and absolute growth rates for ML and BW did not differ significantly between the two groups. The growth rate of D. gigas tended to be high at young stages, and then decreased after the sub-adult stage (>180 days old). This study suggests large spatial and temporal variability in key life history parameters of D. gigas, calling for the collection of more data with fine spatial and temporal scales to further improve our understanding of the fishery biology of D. gigas.
Resumo:
The study of operations on representations of objects is well documented in the realm of spatial engineering. However, the mathematical structure and formal proof of these operational phenomena are not thoroughly explored. Other works have often focused on query-based models that seek to order classes and instances of objects in the form of semantic hierarchies or graphs. In some models, nodes of graphs represent objects and are connected by edges that represent different types of coarsening operators. This work, however, studies how the coarsening operator "simplification" can manipulate partitions of finite sets, independent from objects and their attributes. Partitions that are "simplified first have a collection of elements filtered (removed), and then the remaining partition is amalgamated (some sub-collections are unified). Simplification has many interesting mathematical properties. A finite composition of simplifications can also be accomplished with some single simplification. Also, if one partition is a simplification of the other, the simplified partition is defined to be less than the other partition according to the simp relation. This relation is shown to be a partial-order relation based on simplification. Collections of partitions can not only be proven to have a partial- order structure, but also have a lattice structure and are complete. In regard to a geographic information system (GIs), partitions related to subsets of attribute domains for objects are called views. Objects belong to different views based whether or not their attribute values lie in the underlying view domain. Given a particular view, objects with their attribute n-tuple codings contained in the view are part of the actualization set on views, and objects are labeled according to the particular subset of the view in which their coding lies. Though the scope of the work does not mainly focus on queries related directly to geographic objects, it provides verification for the existence of particular views in a system with this underlying structure. Given a finite attribute domain, one can say with mathematical certainty that different views of objects are partially ordered by simplification, and every collection of views has a greatest lower bound and least upper bound, which provides the validity for exploring queries in this regard.