pinecone/core-2020-05-10-deduplication huggingface dataset:
Hiring Expert Consultants in E-Healthcare: A Two Sided Matching Approach

Very often in some censorious healthcare scenario, there may be a need to
have some expert consultancies (especially by doctors) that are not available
in-house to the hospital. With the advancement in technologies (such as video
conferencing, smartphone, etc.), it has become reality that, for the critical
medical cases in the hospitals, expert consultants (ECs) from around the world
could be hired, who will serve the patients by their physical or virtual
presence. Earlier, this interesting healthcare scenario of hiring the ECs
(mainly doctors) from outside of the hospitals had been studied with the robust
concepts of mechanism design with or without money. We have tried to model the
ECs (mainly doctors) hiring problem as a two-sided matching problem. In this
paper, for the first time, to the best of our knowledge, we explore the more
realistic two-sided matching in our set-up, where the members of the two
participating communities, namely patients and doctors are revealing the strict
preference ordering over all the members of the opposite community for a
stipulated amount of time. We assume that patients and doctors are strategic in
nature. With the theoretical analysis, we demonstrate that the proposed
mechanism that results in a stable allocation of doctors to patients is
strategy-proof (or truthful) and optimal. The proposed mechanism is also
validated with exhaustive experiments.Comment: 33 pages, 9 figure
Learning condition-action rules for personalised journey recommendations

We apply a learning classifier system, XCSI, to the task of\ud
providing personalised suggestions for passenger onward journeys. Learn-\ud
ing classifier systems combine evolutionary computation with rule-based\ud
machine learning, altering a population of rules to achieve a goal through\ud
interaction with the environment. Here XCSI interacts with a simulated\ud
environment of passengers travelling around the London Underground\ud
network, subject to disruption. We show that XCSI successfully learns\ud
individual passenger preferences and can be used to suggest personalised\ud
adjustments to the onward journey in the event of disruption
A parametric study on concrete columns exposed to biaxial bending at elevated temperatures using a probabilistic analysis

Concrete columns exhibit a loss of both strength and stiffness during
fire. The current contribution focusses on the fire performance of concrete columns
subjected to biaxial bending in combination with axial loads, as such
information is rarely available in literature. First, the second-order effects are
quantified using a numerical tool. In Eurocode 2, the most important parameters
which influence second-order effects of columns during fire are the slenderness
ratio, fire duration as well as the magnitude of the axial loading. The influences of
these parameters are investigated using a parametric study. Additionally, from the
viewpoint of fire safety and structural reliability, uncertainties should be incorporated
in the second-order analysis in order to achieve reliability-based design
guidelines. Hence, the numerical tool is further developed in order to take into
account uncertainties. Furthermore, the tool is validated using the Eurocode
provisions and existing experimental data, while considering an ISO 834 standard
fire. Finally, examples are given for the fire resistance design of concrete columns
What do citizens expect from a democracy? An invariance test and comparison between East and West Germany with the ISSP 2004

One of the prerequisites for a functioning democracy is that its citizens support by and large its democratic system. However, such support cannot be taken for granted and should be monitored. Furthermore, different people may have different perceptions, expectations, and understanding of the concept of democracy. This may be especially true for citizens socialized in different political systems like those in Eastern and Western Europe before the fall of the iron curtain, where the concept of democracy and the rights of citizens in a democracy were communicated in quite different ways. (author's abstract
Estimating Problem Metrics for SAT Clause Weighting Local Search

Considerable progress has recently been made in using clause weighting algorithms to solve SAT benchmark problems. While these algorithms have outperformed earlier stochastic techniques on many larger problems, this improvement has generally required extra, problem specific, parameters which have to be fine tuned to problem domains to obtain optimal run-time performance. In a previous paper, the use of parameters, specifically in relation to the DLM clause weighting algorithm, was examined to identify underlying features in clause weighting that could be used to eliminate or predict workable parameter settings. A simplified clause weighting algorithm (Maxage), based on DLM, was proposed that reduced the parameters to a single parameter. Also, in a previous paper, the structure of SAT problems was investigated and a measure developed which allowed the classification of SAT problems into random, loosely structured or compactly structured. This paper extends this work by investigating the behaviour of Maxage with regard to the structural characteristics of SAT problems. The underlying motivation for this study is the development of an adaptive, parameterless clause weighting algorithm.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Robot vision for autonomous object learning and tracking

Iberoamerican Congress on Pattern Recognition (CIARP), 2003, Havana (Cuba)In this paper we present a summary of some of the research that we are developing in the Institute of Robotics of the CSIC-UPC, in the field of Learning and Robot Vision for autonomous mobile robots. We describe the problems that we have found and some solutions that have been applied in two issues: tracking objects and learning and recognition of 3D objects in robotic environments. We will explain some of the results accomplished.Peer Reviewe
A colour constancy algorithm based on the histogram of feasible colour mappings

9 páginas,3 figuras, 1 tablaIberoamerican Congress on Pattern Recognition (CIARP), 2003, Havana (Cuba)Colour is an important cue in many applications in machine vision and image processing. Nevertheless, colour greatly depends upon illumination changes. Colour constancy goal is to keep colour images stable. This paperrsquos contribution to colour constancy lies in estimating both the set and the likelihood of feasible colour mappings. Then, the most likely mapping is selected and the image is rendered as it would be seen under a canonical illuminant. This approach is helpful in tasks where light can be neither controlled nor easily measured since it only makes use of image data, avoiding a common drawback in other colour constancy algorithms. Finally, we check its performance using several sets of images of objects under quite different illuminants and the results are compared to those obtained if the true illuminant colour were known.This work was supported by the project 'Active vision systems based in automatic learning for industrial applications'.Peer Reviewe
A broker architecture for integrating data using a web services environment.

The web service protocol stack provides capabilities for loosely integrating software services but does not provide the higher level support needed for rapid evolution. An experimental system is described for integrating the data from autonomous organizations within the UK health service domain. The results of this experiment have confirmed the need for an integration layer on top of the web service stack to provide the required higher level functionality. In this paper, we summarise our progress to date, and highlight several key research issues of general concern to the web services field, which have emerged from our prototype system. These are set in a general context of providing better ways to provide a service-based model to IT users
Browsing a digital library: A new approach for the New Zealand digital library

Browsing is part of the information seeking process, used when information needs are ill-defined or unspecific. Browsing and searching are often interleaved during information seeking to accommodate changing awareness of information needs. Digital Libraries often support full-text search, but are not so helpful in supporting browsing. Described here is a novel browsing system created for the Greenstone software used by the New Zealand Digital Library that supports users in a more natural approach to the information seeking process. © Springer-Verlag Berlin Heidelberg 2003
Recombination and Self-Adaptation in Multi-objective Genetic Algorithms

This paper investigates the influence of recombination and self-adaptation in real-encoded Multi-Objective Genetic Algorithms (MOGAs). NSGA-II and SPEA2 are used as example to characterize the efficiency of MOGAs in relation to various recombination operators. The blend crossover, the simulated binary crossover and the breeder genetic crossover are compared for both MOGAs on multi-objective problems of the literature. Finally, a self-adaptive recombination scheme is proposed to improve the robustness of  MOGAs
Model checking polygonal differential inclusions using invariance kernels

Polygonal hybrid systems are a subclass of planar hybrid\ud
automata which can be represented by piecewise constant differential\ud
inclusions. Here, we identify and compute an important object of such\ud
systems’ phase portrait, namely invariance kernels. An invariant set is a\ud
set of initial points of trajectories which keep rotating in a cycle forever\ud
and the invariance kernel is the largest of such sets. We show that this\ud
kernel is a non-convex polygon and we give a non-iterative algorithm for\ud
computing the coordinates of its vertices and edges. Moreover, we present\ud
a breadth-first search algorithm for solving the reachability problem for\ud
such systems. Invariance kernels play an important role in the algorithm.peer-reviewe
A plug and play spoken dialogue interface for smart environments

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-24630-5_44Proceedings of 5th International Conference, CICLing 2004 Seoul, Korea, February 15-21, 2004In this paper we present a plug and play dialogue system for smart environments. The environment description and its state are stored on a domain ontology. This ontology is formed by entities that represent real world contextual information and abstract concepts. This information is complemented with linguistic parts that allow to automatically create a spoken interface for the environment. The spoken interface is based on multiple dialogues, related to every ontology entity with linguistic information. Firstly, the dialogue system creates appropriate grammars for the dialogues. Secondly, it creates the dialogue parts, employing a tree structure. Grammars support the recognition process and the dialogue tree supports the interpretation and generation processes. The system is being tested with a prototype formed by a living room. Users may interact with and modify the physical state of this living room environment by means of the spoken dialogue interface.This paper has been sponsored by the Spanish Ministry of Science and Technology, project number TIC2000-046
Linear recurrences with polynomial coefficients and computation of the Cartier-Manin operator on hyperelliptic curves

International audienceWe improve an algorithm originally due to Chudnovsky and Chudnovsky for computing one selected term in a linear recurrent sequence with polynomial coefficients. Using baby-steps / giant-steps techniques, the nth term in such a sequence can be computed in time proportional to sqrt(n), instead of n for a naive approach. As an intermediate result, we give a fast algorithm for computing the values taken by an univariate polynomial P on an arithmetic progression, taking as input the values of P on a translate on this progression. We apply these results to the computation of the Cartier-Manin operator of a hyperelliptic curve. If the base field has characteristic p, this enables us to reduce the complexity of this computation by a factor of order sqrt(p). We treat a practical example, where the base field is an extension of degree 3 of the prime field with p = 2^32 − 5 elements
Evolutionary algorithms for optimal control in fed-batch fermentation processes

In this work, Evolutionary Algorithms (EAs) are used to achieve optimal feedforward control in a recombinant bacterial fed-batch
fermentation process, that aims at producing a bio-pharmaceutical product.
Three diferent aspects are the target of the optimization procedure: the feeding trajectory (the amount of substrate introduced in a bioreactor per time unit), the duration of the fermentation and the initial conditions
of the process. A novel EA with variable size chromosomes and using real-valued representations is proposed that is capable of simultaneously optimizing the aforementioned aspects. Outstanding productivity levels
were achieved and the results are validated by practice
Flow clustering using machine learning techniques

Packet header traces are widely used in network analysis. Header traces are the aggregate of traffic from many concurrent applications. We present a methodology, based on machine learning, that can break the trace down into clusters of traffic where each cluster has different traffic characteristics. Typical clusters include bulk transfer, single and multiple transactions and interactive traffic, amongst others. The paper includes a description of the methodology, a visualisation of the attribute statistics that aids in recognising cluster types and a discussion of the stability and effectiveness of the methodology
Construction of secure random curves of genus 2 over prime fields

International audienceFor counting points of Jacobians of genus 2 curves defined over large prime fields, the best known method is a variant of Schoof's algorithm. We present several improvements on the algorithms described by Gaudry and Harley in 2000. In particular we rebuild the symmetry that had been broken by the use of Cantor's division polynomials and design a faster division by 2 and a division by 3. Combined with the algorithm by Matsuo, Chao and Tsujii, our implementation can count the points on a Jacobian of size 164 bits within about one week on a PC
River stage forecasting with particle swarm optimization

An accurate water stage prediction allows the pertinent authority to issue a forewarning of the impending flood and to implement early evacuation measures when required. Existing methods including rainfall-runoff modeling or statistical techniques entail exogenous input together with a number of assumptions. The use of artificial neural networks has been shown to be a cost-effective technique. But their training, usually with back-propagation algorithm or other gradient algorithms, is featured with certain drawbacks, such as very slow convergence and easily getting stuck in a local minimum. In this paper, a particle swarm optimization model is adopted to train perceptrons. The approach is demonstrated to be feasible and effective by predicting real-time water levels in Shing Mun River of Hong Kong with different lead times on the basis of the upstream gauging stations or stage/time history at the specific station. It is shown from the verification simulations that faster and more accurate results can be acquired.Department of Civil and Environmental EngineeringAuthor name used in this publication: Kwokwing ChauSeries: Lecture notes in computer science2003-2004 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Knowledge representation on design of storm drainage system

Innovations in applied artificial intelligence : 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 2004, Ottawa, Canada, May 17-20, 2004During the design of storm drainage system, many decisions are involved on the basis of rules of thumb, heuristics, judgment, code of practice and previous experience of the designer. It is a suitable application field for application of the recent artificial intelligence technology. This paper presents the knowledge representation of the design of storm drainage system in a prototype knowledge-based system. Blackboard architecture with hybrid knowledge representation techniques including production rule system and object-oriented approach is adopted. Through custom-built interactive and user-friendly user interfaces, it furnishes designers with entailed expertise in this domain problem.Department of Civil and Environmental EngineeringAuthor name used in this publication: Kwokwing Chau2003-2004 > Academic research: refereed > Publication in refereed journalpreprint_postprin
Fiber cost reduction and wavelength minimization in multifiber WDM networks

Motivated by the increasing importance of multifiber WDM networks we study two routing and wavelength assignment problems in such networks: - Fiber Cost Minimization: the number of wavelengths per fiber is given and we want to minimize the cost of fiber links that need to be reserved in order to satisfy a set of communication requests; we introduce a generalized setting where network pricing is non-uniform, that is the cost of hiring a fiber may differ from link to link. - Wavelength Minimization: the number of available parallel fibers on each link is given and we want to minimize the wavelengths per fiber that are needed in order to satisfy a set of communication requests. For each problem we consider two variations: undirected, which corresponds to full-duplex communication, and directed, which corresponds to one-way communication. Moreover, for rings we also study the problem in the case of pre-determined routing. We present exact or constant-ratio approximation algorithms for all the above variations in chain, ring, star and spider networks. © IFIP International Federation for Information Processing 2004
Interoperability criteria and mechanisms for seamless inter-working between UMTS-HSDPA and HIPERLAN/2 networks enhanced with MIMO techniques

The concept 4G wireless communication systems is to provide a user with a rich range of services across different radio access technologies, while maintaining the service's minimum QoS requirement, independently on the coverage area, mobility conditions, and using a single mobile terminal. To achieve this goal the need for interoperable heterogeneous wireless networks emerges. In this article we identify the challenges that arise when enhancing interoperability functionality to two different radio access networks. Specifically we will focus on inter-working UTRA FDD HSDPA and WLANs networks, as two strong candidates for composing the 4G environment. We also propose an interoperable architecture to achieve seamless inter-working between the aforementioned networks. The article also introduces two interoperable criteria that triggers interoperability based on the use of Cost functions. Namely, these triggers are the initial user assignment to the optimal network and inter-system handover. Each of the two triggers initiates a respective interoperability algorithm. Finally, In order to characterize the interoperability mechanisms behaviour and address an accurate QoS performance analysis, a software simulation platform has been developed. The platform is enhanced with MIMO transceivers and takes into consideration: network configuration, propagation conditions, fast fading, and service requirements. Keywords: Heterogeneous HSDPA, HIPERLAN\2, interoperability, Cost function, MIMO.BS.AP © IFIP International Federation for Information Processing 2004
Efficient location-based hard handoff algorithms for cellular systems

Mobile world's rapid growth has spurred development of new protocols and new algorithms to meet changing operation requirements- such as mobile networking, and quality-of-service support. Handoff is one of the most critical procedures in cellular systems. Network operators give emphasis to optimize handover, since it is strongly related to dropped calls, network overload and subsequently users' criticism. Handoff can be seen as a blind procedure, if it is only based on the comparison of measurements, without the information of location. Since signal propagation and pathloss are complex in nature, we can expect unnecessary and wrong handoff executions. Both UNITS and those of the second generation (GSM) systems will require redefined handoff algorithms of active connections as the smooth mobility support and continuous connection are essential issues for obtaining high performance and increasing user satisfaction. In this paper we present a set of intelligent algorithms using the mobile terminal (MT) location information and area awareness to assist safe handoff decisions. The implemented algorithms are validated by means of cellular network simulators that clearly show the impact of these techniques to major system performance metrics. © IFIP International Federation for Information Processing 2004
Prioritized multiplexing of traffic accessing an FSAN-compliant GPON

The Gigabit per second PON, now under standardization by the FSAN group in ITU-T, constitutes the most promising approach for the photonisation of the local loop, an elusive target of telecom operators for more than a decade. The traffic multiplexing / concentration on which the system efficiency (and hence low cost) is based, relies upon the dynamic MAC protocol to allocate bandwidth according to momentary needs, following traffic fluctuations. To serve each traffic class according to its needs, four priority levels are employed along with a high number of logically separate queues. This paper presents and evaluates the FSAN access control algorithms and discusses the choice of suitable traffic service parameters that optimize system performance. © IFIP International Federation for Information Processing 2004
Traffic conscious distribution of service components

A service is commonly realized by a set of components distributed over different nodes. For example, Internet based applications are orchestrated across a large scale distributed computing infrastructures and underlying resource elements; Similarly, in TINA-like approaches intelligence for control and management of services and resource, in particular, is distributed among network nodes and user/terminal nodes. In fact a service can be seen as a set of interacting components with a common purpose, being it application-oriented or of a support nature . The placement of components in different machines is more or less empirically determined at the design phase, by loosely (and occasionally subconsciously) taking into account ""reasonable"" predictions of the component usage. Code mobility has added complexity to the distribution problem. The aim of this paper is to present a methodology of dealing with component distribution, to explore its limitations, and to present its effect on service and network design. © IFIP International Federation for Information Processing 2004