pinecone/core-2020-05-10-deduplication huggingface dataset:
A Power Saving Architecture for Web Access from Mobile Computers

This work proposes new power-saving strategies for mobile access to the Web. User mobility is a key factor in the evolution of Web services. Unfortunately, the legacy approach for Web access is very inefficient when applied to mobile users. One of the critical issues is the inefficient usage of energetic resources when adopting the legacy TCP/IP architecture for Web access from mobile devices. In this paper we address this problem by proposing a new architecture,namely PS-Web, which works at the transport layer and exploits some knowledge about the application behavior. PS-Web is transparent with respect to the application and independent from the sub-network technology. We implemented a prototype of PS-Web. Experimental results provided by this prototype have shown that a relevant energy savings (about 70% on average) can be achieved with respect to the legacy TCP/IP approach. Furthermore, power saving is obtained without a significant degradation in the QoS perceived by the users. Specifically, PS-Web introduces almost neglible additional delays (with respect to the legacy approach) in the downloading of a Web page
A simple model for calculating SIP signalling flows in 3GPP IP multimedia subsystems

[Abstract]: The 3rd Generation Partnership Project (3GPP) uses the\ud
IETF Session Initiation Protocol (SIP) as a signalling protocol in the IP Multimedia Subsystem for 3rd generation UMTS networks. Signalling Messages sent using the SIP protocol pass through intermediate SIP nodes in such a way that the message size grows as a result of additional\ud
data being added to the message. Modelling of network \ud
flows in this case requires careful attention. A simple \ud
flow model is presented to get an appreciation for the size of the expected signalling flows. This is particularly\ud
important for developing dimensioning models for SIP in 3GPP\ud
networks and for the further investigation of Quality of Service (QoS) mechanisms to provide resources needed for signalling. A methodology is presented which defines the minimum requirements for the bit error rate on links used by signalling traffic
Adaptive Hypermedia made simple using HTML/XML Style Sheet Selectors

This paper addresses enhancing HTML and XML with adaptation
functionalities. The approach consists in using the path selectors
of the HTML and XML style sheet languages CSS and XSLT for expressing
content and navigation adaptation. Thus, the necessary extensions of
the selector languages are minimal (a few additional constructs suffice),
the processors of these languages can be kept almost unchanged, and no
new algorithms are needed. In addition, XML is used for expressing the
user model data like browsing history, browsing environment (such as
device, location, time, etc.), and application data (such as user performances
on exercises). The goal of the research presented here is not to
propose novel forms or applications of adaptation, but instead to extend
widespread web standards with adaptation functionalities. Essential features
of the proposed approach are its simplicity and both the upwards
and downwards compatibility of the extension.
Minimal Surfaces for Stereo

Determining shape from stereo has often been posed as a global minimization problem. Once formulated, the minimization problems are then solved with a variety of algorithmic approaches. These approaches include techniques such as dynamic programming min-cut and alpha-expansion. In this paper we show how an algorithmic technique that constructs a discrete spatial minimal cost surface can be brought to bear on stereo global minimization problems. This problem can then be reduced to a single min-cut problem. We use this approach to solve a new global minimization problem that naturally arises when solving for three-camera (trinocular) stereo. Our formulation treats the three cameras symmetrically, while imposing a natural occlusion cost and uniqueness constraint.Engineering and Applied Science
Type-Safe Prototype-Based Component Evolution

Component-based programming is currently carried out us-  ing mainstream object-oriented languages. These languages have to  be used in a highly disciplined way to guarantee flexible component  composition and extensibility. This paper investigates abstractions for  component-oriented programming on the programming language level.  We propose a simple prototype-based model for first-class components  on top of a class-based object-oriented language. The model is formalized  as an extension of Featherweight Java. Our calculus includes a minimal  set of primitives to dynamically build, extend, and compose software  components, while supporting features like explicit context dependen-  cies, late composition, unanticipated component extensibility, and strong  encapsulation. We present a type system for our calculus that ensures  type-safe component definition, composition, and evolution
Genetic algorithms for design of liquid retaining structure

Series: Lecture notes in computer scienceIn this paper, genetic algorithm (GA) is applied to the optimum design of reinforced concrete liquid retaining structures, which comprise three discrete design variables, including slab thickness, reinforcement diameter and reinforcement spacing. GA, being a search technique based on the mechanics of natural genetics, couples a Darwinian survival-of-the-fittest principle with a random yet structured information exchange amongst a population of artificial chromosomes. As a first step, a penalty-based strategy is entailed to transform the constrained design problem into an unconstrained problem, which is appropriate for GA application. A numerical example is then used to demonstrate strength and capability of the GA in this domain problem. It is shown that, only after the exploration of a minute portion of the search space, near-optimal solutions are obtained at an extremely converging speed. The method can be extended to application of even more complex optimization problems in other domains.Department of Civil and Environmental EngineeringAuthor name used in this publication: K. W. Chau2001-2002 > Academic research: refereed > Publication in refereed journalpreprint_postprin
A knowledge-based system for construction site level facilities layout

The choice of good construction site layout is inherently difficult, yet has a significant impact on both monetary and time saving. It is desirable to encapsulate systematically the heuristic expertise and empirical knowledge into the decision making process by applying the latest artificial intelligence technology. This paper describes a prototype knowledge-based system for the construction site layout, SITELAYOUT. It has been developed using an expert system shell VISUAL RULE STUDIO, which acts as an ActiveX Designer under the Microsoft Visual Basic programming environment, with hybrid knowledge representation approach under object-oriented design environment. By using custom-built interactive graphical user interfaces, it is able to assist designers by furnishing with much needed expertise in this planning activity. Increase in efficiency, improvement, consistency of results and automated record keeping are among the advantages of such expert system. Solution strategies and development techniques of the system are addressed and discussed.Department of Civil and Environmental EngineeringAuthor name used in this publication: K. W. ChauSeries: Lecture notes in computer science2001-2002 > Academic research: refereed > Publication in refereed journalpreprint_postprin
An intelligent knowledge processing system on hydrodynamics and water quality modeling

Series: Lecture notes in computer scienceIn order to aid novice users in the proper selection and application of myriad ever-complicated algorithmic models on coastal processes, needs arise on the incorporation of the recent artificial intelligence technology into them. This paper delineates an intelligent knowledge processing system on hydrodynamics and water quality modeling to emulate expert heuristic reasoning during the problem-solving process by integration of the pertinent descriptive, procedural, and reasoning knowledge. This prototype system is implemented using a hybrid expert system shell, Visual Rule Studio, which acts as an ActiveX Designer under the Microsoft Visual Basic programming environment. The architecture, solution strategies and development techniques of the system are also presented. The domain knowledge is represented in object-oriented programming and production rules, depending on its nature. Solution can be generated automatically through its robust inference mechanism. By custom-built interactive graphical user interfaces, it is capable to assist model users by furnishing with much needed expertise.Department of Civil and Environmental EngineeringAuthor name used in this publication: K. W. ChauAuthor name used in this publication: O. WaiAuthor name used in this publication: Y. S. Li2001-2002 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Solving travel problems by integrating web information with planning

Proceeding of: 13th International Symposium, ISMIS 2002 Lyon, France, June 27–29, 2002The evolution of the Web has encouraged the development of new information gathering techniques. In order to retrieve Web information, it is necessary to integrate different sources. Planning techniques have been used for this purpose in the field of information gathering. A plan for information gathering is the sequence of actions that specify what information sources should be accessed so that some characteristicts, like access efficiency, are optimised. MAPWeb is a multiagent framework that integrates Planning Agents and Web Information Retrieval Agents. In MAPWeb, planning is not only used to integrate and to select information sources, but also to solve actual planning problems with information gathered from the Web. For instance, in an travel assistant domain, plans represent the sequence of actions an user has to follow to perform his/her trip. But also, each step in the plan informs the WebAgents which information sources should be accessed. In this paper we describe MAPWeb and study experimentally two information retrieval characteristics: the average number of solutions retrieved depending on the WebAgents used and the allocated time limit, and the number of problems solved (those travel assistant problems for which at least one solution was retrieved)
SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm

An algorithm for allocating and scheduling tasks in multiprocessor
environments is presented. Its main characteristic is its orientation
towards machine vision applications. In this sense it deals with the peculiarities
of systems which combine generic-type processors with Image
Acquisition and Processing Boards. The main goal of the algorithm is
total processing time reduction; such are the requirements when we deal
with automated industrial inspection applications. By simultaneously
tackling the phases of allocation and scheduling, the results obtained are
better than those offered by traditional algorithms. The system is applied
to a process of citrus fruit inspection, and its performances are also
evaluated over randomly generated task graphs
A framework for defining Object-Calculi [extended abstract]

International audienceIn this paper, we give a general framework for the foundation of an operational (small step) semantics of object-based languages with an emphasis on functional and imperative issues. The framework allows classifying very naturally many object-based calculi according to their main implementation techniques of inheritance, namely delegation and embedding, and their particular strategies. This distinction comes easily from a choice in the rules. Our framework is founded on two previous works: λObj+ , a version of the Lambda Calculus of Objects of Fischer, Honsell, and Mitchell, for the object aspects, and λσ^a_w of Benaissa, Lescanne, and Rose, for the description of the operational semantics and sharing. The former is the formalization of a small delegation-based language which contains both lambda calculus and object primitives to create, update, and send messages to objects, while the latter is designed to provide a generic description of functional language implementations and is based on a calculus of explicit substitution extended with addresses to deal with memory management. The framework is presented as a set of modules, each of which captures a particular aspect of object-calculi (functional vs. imperative, delegation vs. embedding , and any combination of them). Above all, it introduces and illustrates a new promising approach to formally reason about the operational semantics of languages with (possibly) mutable states
Validation of Mixed Signal-Alpha Real-Time Systems through Affine Calculus on Clock Synchronisation Constraints

International audienceIn this paper we present the affine clock calculus as an extension of the formal verification techniques provided by the SIGNAL language. A SIGNAL program describes a system of clock synchronisation constraints the consistency of which is verified by compilation (clock calculus). Well-adapted in control-based system design, the clock calculus has to be extended in order to enable the validation of SIGNAL-ALPHA applications which usually contain important numerical calculations. The new affine clock calculus is based on the properties of affine relations induced between clocks by the refinement of SIGNAL-ALPHA specifications in a codesign context. Affine relations enable the derivation of a new set of synchronisability rules which represent conditions against which synchronisation constraints on clocks can be assessed. Properties of affine relations and synchronisability rules are derived in the semantical model of traces of SIGNAL. A prototype implementing a subset of the synchronisability rules has been integrated in the SIGNAL compiler and used for the validation of a video image coding application specified using SIGNAL and ALPHA
Refinement and property checking in high-level synthesis using attribute grammars

Recent advances in fabrication technology have pushed the digital designers' perspective towards higher levels of abstraction. Previous work has shown that attribute grammars, used in traditional compiler construction, can also be effectively adopted to describe in a formal and uniform way high-level hardware compilation heuristics, their main advantages being modularity and declarative notation. In this paper, a more abstract form of attribute grammars, relational attribute grammars, are further applied as a framework over which formal hardware verification is performed along with synthesis. The overall hardware design methodology proposed is a novel idea that supports provable correct designs
Scalable and flexible location-based services for ubiquitous information access

In mobile distributed environments applications often need to dynamically obtain information that is relevant to their current location. The current design of the Internet does not provide any conceptual models for addressing this issue. As a result, developing a system that requires this functionality becomes a challenging and costly task, leading to individual solutions that only address the requirements of specific application scenarios. In this paper we propose a more generic approach, based on a scalable and 
exible concept of location-based services, and an architectural framework to support its application in the Internet environment.
We describe a case study in which this architectural framework is used for developing a location-sensitive tourist guide. The realisation of this case study demonstrates the applicability of the framework, as well as the overall concept of location-based services, and highlights some of the issues involved.To the GUIDE team, and especially to Keith Mitchell and Matthias Franz, for their collaboration in the preparation of this case study. To Adrian Friday for his comments on a draft version of this paper. To the anonymous reviewers for their attentive reading and valuable comments. This work was carried out as part of the PRAXIS funded AROUND project (PRAXIS/P/EEI/14267/1998) and supported by grant PRAXIS XXI/BD/13853/97
Collaboration and composition : Issues for a second generation process language

Over the past decade a variety of process languages have been defined and applied to software engineering environments. The idea of using a process language to encode a software process as a "process model", and enacting this using a process-sensitive environment is now well established. Many prototype process-sensitive environments have been developed; but their use in earnest has been limited. We are designing a second generation process language which is a significant departure from current conventional thinking. Firstly a process is viewed as a set of mediated collaborations rather than a set of partially ordered activities. Secondly emphasis is given to how process models are developed, used, and enhanced over a potentially long lifetime. In particular the issue of composing both new and existing model fragments is central to our development approach. This paper outlines these features, and gives the motivations behind them. It also presents a view of process support for software engineering drawing on our decade of experience in exploiting a "first generation" process language, and our experience in designing and exploiting programming languages.Postprin
Quantum complexities of ordered searching, sorting, and element
  distinctness

We consider the quantum complexities of the following three problems:
searching an ordered list, sorting an un-ordered list, and deciding whether the
numbers in a list are all distinct. Letting N be the number of elements in the
input list, we prove a lower bound of \frac{1}{\pi}(\ln(N)-1) accesses to the
list elements for ordered searching, a lower bound of \Omega(N\log{N}) binary
comparisons for sorting, and a lower bound of \Omega(\sqrt{N}\log{N}) binary
comparisons for element distinctness. The previously best known lower bounds
are {1/12}\log_2(N) - O(1) due to Ambainis, \Omega(N), and \Omega(\sqrt{N}),
respectively. Our proofs are based on a weighted all-pairs inner product
argument.
  In addition to our lower bound results, we give a quantum algorithm for
ordered searching using roughly 0.631 \log_2(N) oracle accesses. Our algorithm
uses a quantum routine for traversing through a binary search tree faster than
classically, and it is of a nature very different from a faster algorithm due
to Farhi, Goldstone, Gutmann, and Sipser.Comment: This new version contains new results. To appear at ICALP '01. Some
  of the results have previously been presented at QIP '01. This paper subsumes
  the papers quant-ph/0009091 and quant-ph/000903
Revising Nonmonotonic Theories: The case of Defeasible Logic

The revision and transformation of knowledge is widely recognized as a key issue in knowledge representation and reasoning. Reasons for the importance of this topic are the fact that intelligent systems are gradually developed and refined, and that often the environment of an intelligent system is not static but changes over time. Traditionally belief revision has been concerned with revising first order theories.

Nonmonotonic reasoning provides rigorous techniques for reasoning with incomplete information. Until recently the dynamics of nonmonotonic reasoning approaches has attracted little attention. This paper studies the dynamics of defeasible logic, a simple and efficient form of nonmonotonic reasoning based on defeasible rules and priorities. We define revision and contraction operators and propose postulates. Our postulates try to follow the ideas of AGM belief revision as far as possible, but some AGM postulates clearly contradict the nonmonotonic nature of defeasible logic, as we explain. Finally we verify that the operators satisfy the postulates.Griffith Sciences, School of Information and Communication TechnologyFull Tex
On Bots and Bacteria: Ontology Independent Embodiment

The original publication is available at www.springerlink.com . Copyright Springer --DOI : 10.1007/3-540-48304-7_45A framework for understanding and exploiting embodiment is presented which is not dependent on any specific ontological context. This framework is founded on a new definition of embodiment, based on the relational dynamics that exist between biological organisms and their environments, and inspired by the structural dynamics of the bacterium Escherichia coli. Full recognition is given to the role played by physically instantiated bodies, but in such a way that this can be meaningfully abstracted within the constraints implied by the term ???embodiment???, and applied in a variety of operational contexts. This is illustrated by ongoing experimental work in which the relational dynamics that exist between E. coli and its environment are applied in a variety of software environments, using Cellular Automata (CA) with artificial ???sensory??? and ???effector??? surfaces, producing qualitatively similar ???chemotactic??? behaviours in a variety of operational domains
Developping patterns as a mechanism for assisting the management of knowledge in the context of conducting organisational change

International audienceIn a business environment that is constantly evolving the management of knowledge is becoming increasingly important. In particular the shareability and repeatability of experience gained in change situations can prove an invaluable tool for the evolving enterprise. We advocate the use of the pattern paradigm as a means to capture and disseminate this type of knowledge. The patterns that we propose are organisational design proposals, where particular emphasis is placed on representing two complementary aspects of change: the ways in which an enterprise can conduct change (the process of change), and the possible states to which this change leads the enterprise (the product of change). Our approach to pattern development is based (a) on the existence of a pattern template and (b) on a cooperative and discussant way of working, so as to ensure that a maximum of knowledge relevant to the domain of interest is captured. The approach is illustrated with examples from a study of change management in the electricity sector, where it is currently being applied
Using preemptive thread migration to load-balance data-parallel applications

International audienceGeneric load balancing policies for irregular parallel applications may be efficiently implemented by integrating preemptive thread migration into the runtime support. In this context, a delicate issue is to manage pointer validity in a migration-safe way. In [1] we presented an iso-address approach to this problem. This paper discusses the impact of the iso-address migration scheme on the runtime of the Adaptor [4] HPF compiler. This runtime (previously modified so as to generate multithreaded code for our PM2 runtime system [3]) now provides a generic support for dynamic load balancing, using preemptive thread migration. We report some encouraging results obtained with our system on a HPF flame simulation code, a motivating application of HPF 2.0 [7]