A user's profile, for the purpose of location management in a PCS network, is formalized as a subgraph of the network graph. This subgraph, the so-called individual profile graph (IPG), is determined after a perio...
详细信息
The problem considered is that of recognizing if a given convex polygon comes from a known collection by applying probes. Existing approaches use a number of probes that is linear in the number of sides of the polygon...
详细信息
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performance. Building a custom benchmark suite i...
详细信息
Nowadays, Problem-Based Learning (PBL for short) is a popular teaching strategy for teachers. In the PBL environment students can learn how to solve the real life problems by discussing with their teammates and develo...
详细信息
One-on-one educational computing refers to I student I computing device, which means every student in a group uses a digital learning device. In this paper, we present a model of student question generation called AGQ...
详细信息
ISBN:
(纸本)0805857826
One-on-one educational computing refers to I student I computing device, which means every student in a group uses a digital learning device. In this paper, we present a model of student question generation called AGQ, which stands for "asking a good question," supported by one-on-one educational computing in the classroom settings. AGQ is designed for engaging students in a challenging learning activity that potentially involves higher-level cognitive processing operations. We shall describe the general design of AGQ, called Product Evolution, and that the current version is a variation of it.
An appropriate definition and efficient computation of similarity (or distance) measures between two stochastic models are of theoretical and practical interest. In this work, a similarity measure, that is, a modified...
详细信息
Integration of version and access control of XML documents has the benefit of regulating access to rapidly growing archives of XML documents. Versioned XML documents provide us with valuable informations on dependenci...
详细信息
ISBN:
(纸本)9781595930453
Integration of version and access control of XML documents has the benefit of regulating access to rapidly growing archives of XML documents. Versioned XML documents provide us with valuable informations on dependencies between document nodes, but at the same time presenting the risk of undesirable data disclosure. In this paper we introduce the notion of relevancy-based access control, which realizes protection of versioned XML documents by various types of relevancy, such as version dependencies, schema similarities and temporal proximity. We define a new path query language XVerPath over XML document versions, which can be utilized for specifying relevancy-based access control policies. We also introduce the notion of relevancy class, for collectively and compactly specifying relevancy-based policies. Copyright 2005 ACM.
A scenario is envisaged in which agents have tasks to perform and are in a position to exchange tasks to improve their performance, and thus perhaps affect the overall performance of the system. Our model uses two com...
详细信息
A scenario is envisaged in which agents have tasks to perform and are in a position to exchange tasks to improve their performance, and thus perhaps affect the overall performance of the system. Our model uses two computing machines with their usual resources, and with random initial jobs to be processed. Their performance is dependent not only on absolute total load but also on how much of each machine's resources are in demand, thus giving scope for the beneficial exchange of jobs. This paper describes the development of a negotiation mechanism for job exchange between machines and measurement of system performance. The concept may be extended to multiple machines that act as agents exchanging resources and tasks.
We envisage a scenario where a system of network computer initially with random loads, exchange jobs to balance load among themselves to enhance their individual performance and to provide augmented quality of service...
详细信息
We envisage a scenario where a system of network computer initially with random loads, exchange jobs to balance load among themselves to enhance their individual performance and to provide augmented quality of service (QoS) to the user community. We model the individual machines as agents interacting with one another. The agents have beliefs and aspirations. The aspiration of an agent is seek load from other, when it did not have enough to begin with, and sheds the same of it finds itself excessively loaded. This paper develops the concept with a design of a utility function to reflect the agent aspiration. We also propose a measure of load imbalance between networked machines. Negotiation mechanism is developed for exchange of jobs between agents. We report our result of the simulation with two machines and extend the same for three machines. The extension of the idea to a large number of machines entail coming to term with complexity in form of administrative overloads. We discuss the "small word" concept in the content of a simulation massively large number of machines interconnected.
A selection of useful measures and a generation of rules for detecting attacks from network data are very difficult. Expert's experiences are commonly required to generate the detection rules. If the rules are gen...
详细信息
暂无评论