ppxscal/embedding_network huggingface dataset:
ServiceMosaic project: modeling, analysis and management of web services interactions
Authors: Boualem Benatallah, Hamid Reza Motahari-Nezhad
Venue: Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53 (2006)

This paper provides an overview of ServiceMosaic, which is a platform for model-driven analysis and management of service interactions. In particular, in this paper, we focus on business protocols modelling and analysis by providing operators for compatibility and replaceability checking of business protocols, and model-driven adapter development for business protocols.
Distributed algorithms in an ergodic Markovian environment
Authors: Francis Comets, François Delarue, René Schott
Venue: Random Structures Algorithms (2007)

We provide a probabilistic analysis of the d-dimensional banker algorithm when transition probabilities may depend on time and space. The transition probabilities evolve, as time goes by, along the trajectory of an ergodic Markovian environment, whereas the spatial parameter just acts on long runs. Our model complements the one considered by Guillotin-Plantard and Schott (Random Struct Algorithm 21 (2002) 34, 371396) where transitions are governed by a dynamical system, and appears as a new (small) step towards more general time and space dependent protocols. Our analysis relies on well-known techniques from stochastic homogenization theory and investigates the asymptotic behavior of the rescaled algorithm as the total amount of resources available for allocation tends to infinity. In the two-dimensional setting, we manage to exhibit three different possible regimes for the deadlock time of the limit system. To the best of our knowledge, the way we distinguish these regimes is completely new. We interpret our results in terms of stabilization of the algorithm.&copy; 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007
An Auxiliary Tool for Usability and Design Guidelines Validation of Web Sites
Authors: Ricardo Ruiz-Rodriguez
Venue: Proceedings of the 15th International Conference on Computing (2006)

The constant growth and updating of web sites is a hard and time consuming human work. The tool described in this document intends to remove the problems associated with maintenance of web sites in some aspects of usability and design guidelines, as well as in the availability of contents through the validation of no broken links verifying that there are no broken links.
Paid Search
Authors: Bernard J. Jansen
Venue: Computer (2006)

With paid search, the content provider, search engine, and user have mutually supporting goals.
A Visual Landmark Recognition System for Autonomous Robot Navigation
Authors: Quoc V. Do, Lakhmi C. Jain
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper presents a vision system for autonomously guiding a robot along a known route using a single CCD camera. The prominent feature of the system is the real-time recognition of shape-based visual landmarks in cluttered backgrounds, using a memory feedback modulation (MFM) mechanism, which provides a means for the knowledge from the memory to interact and enhance the earlier stages in the system. Its feasibility in autonomous robot navigation is demonstrated in both indoor and outdoor experiments using a vision-based navigating vehicle.
A New Approach to Electronic Services Using Game-Based Design
Authors: Jarno Salonen, Petri Ruutikainen, Aki Ahonen
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Performing personal risk management in one's life is often considered to be a job for a professional since insurance as a service is very complex. In addition, the interfaces of current electronic insurance services targeted to ordinary users are often product-oriented. As the current physical services are transferred to the electronic environment, the interaction mode changes from human-to-human into human-computer interaction, which results into the growing need of supporting elements for the customer during the service process. This paper approaches the previously described dilemma by introducing a new approach for developing understandable and manageable electronic services. As a case-example, we introduce the eInsurance service concept with game-based design as the key factor in making the service enjoyable and usable. The service concept was evaluated by random users and the results of a survey show that the game-based approach might lead to an enjoyable and appealing experience in an environment usually characterized as complex and matter-of-fact.
A General Framework and New Alignment Criterion for Dense Optical Flow
Authors: Rami Ben-Ari, Nir Sochen
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The problem of dense optical flow computation is addressed from a variational viewpoint. A new geometric framework is introduced. It unifies previous art and yields new efficient methods. Along with the framework a new alignment criterion suggests itself. It is shown that the alignment between the gradients of the optical flow components and between the latter and the intensity gradients is an important measure of the flow's quality. Adding this criterion as a requirement in the optimization process improves the resulting flow. This is demonstrated in synthetic and real sequences.
Computational Models of Ethical Reasoning: Challenges, Initial Steps, and Future Directions
Authors: Bruce M. McLaren
Venue: IEEE Intelligent Systems (2006)

Computational models of ethical reasoning are in their infancy in the field of artificial intelligence. Ethical reasoning is a particularly challenging area of human behavior for AI scientists and engineers because of its reliance on abstract principles, philosophical theories not easily rendered computational, and deep-seated, even religious, beliefs. A further issue is this endeavor's ethical dimension: Is it even appropriate for scientists to try to imbue computers with ethical-reasoning powers? A look at attempts to build computational models of ethical reasoning illustrates this task's challenges. In particular, the Truth-Teller and SIROCCO programs incorporate AI computational models of ethical reasoning, both of which model the ethical approach known as casuistry. Truth-Teller compares pairs of truth-telling cases; SIROCCO retrieves relevant past cases and principles when presented with a new ethical dilemma. The computational model underlying Truth-Teller could serve as the basis for an intelligent tutor for ethics.This article is part of a special issue on Machine Ethics.
GeoPix: image retrieval on the geo web, from camera click to mouse click
Authors: Davide Carboni, Stefano Sanna, Pietro Zanarini
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

In this paper we describe a multichannel, mobile, and location-based application called GeoPix developed as a proof-of-concept for several use cases related to eTourism. In GeoPix, mobile users produce geo-referenced pictures and share them with Web users that can access the online database with a smart navigation experience based on maps. Web users can browse, pan, zoom areas immediately seeing the pictures posted by the on-the-road users. Thumbnails are directly overlaid on the maps exactly where the full-size photos are taken. They can also make searches, apply filters, and save geographic bookmarks of the photos displayed on the maps. In this way a large database of images can be easily browsed in a way that we call geo-browsing.
Applying statistical control techniques to air traffic simulations
Authors: Kirk C. Benson, David Goldsman, Amy R. Pritchett
Venue: Proceedings of the 36th conference on Winter simulation (2004)

While the literature contains several adaptive sampling techniques for statistical comparison of competing simulated system configurations and for embedded statistical computations during simulation run-time, these techniques are often difficult to apply to air traffic simulations because of the complexity of air traffic scenarios and because of the variety of model and data types needed to fully describe air traffic. Adaptive sampling techniques can be beneficial to the study of air traffic; for example, adaptive techniques can use ranking and selection methods to compare the relative worth of the competing configurations and calculate the number of observations required for rigorous statistical comparison, often dramatically reducing the run-time duration of simulations. In this paper, we will describe the implementation of such procedures in the Reconfigurable Flight Simulator for air traffic simulations. We also discuss implications for the coordination of simulation, analysis, and design activities.
Maximally informative k-itemsets and their efficient discovery
Authors: Arno J. Knobbe, Eric K. Y. Ho
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting from the total set of items an itemset of specified size, such that the database is partitioned with as uniform a distribution over the parts as possible. To achieve this goal, we propose the use of joint entropy as a quality measure for itemsets, and refer to optimal itemsets of cardinality k as maximally informative k-itemsets. We claim that this approach maximises distinctive power, as well as minimises redundancy within the feature set. A number of algorithms is presented for computing optimal itemsets efficiently.
Research of Web-based Negotiation Support System in Collaborative Commerce
Authors: Wenyu Zhang, Xiaolin Zheng
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Support for negotiations is an important issue in today's collaborative commerce (c-commerce) research. Based on the analysis of state of the art of negotiation support system, and aiming at the environment of c-commerce, we present a web based negotiation support model in this paper. Firstly, we provide a framework for c-commerce. Then, we develope the web based negotiation support model for c-commerce. A protocol for web based negotiation has been provided. The protocol is composed of negotiation entity, commerce rules, and agreement, and is formatted in XML Schema. Based on the negotiation protocol, the negotiation entities can be used to formulate their commerce rules, resulting in an agreement through the automatic matching of their commerce rules.
Adams Conditionals and Non-Monotonic Probabilities
Authors: Richard Bradley
Venue: Journal of Logic, Language and Information (2006)

Adams' famous thesis that the probabilities of conditionals are conditional probabilities is incompatible with standard probability theory. Indeed it is incompatible with any system of monotonic conditional probability satisfying the usual multiplication rule for conditional probabilities. This paper explores the possibility of accommodating Adams' thesis in systems of non-monotonic probability of varying strength. It shows that such systems impose many familiar lattice theoretic properties on their models as well as yielding interesting logics of conditionals, but that a standard complementation operation cannot be defined within them, on pain of collapsing probability into bivalence.
Soft decision unequal error protection scheme for MPEG advanced audio coding
Authors: T. H. Yeo, W. C. Wong, D. Y. Huang
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, a system using soft decision decoding of convolutional codes is investigated for MPEG-4 advanced audio coding. Under severe channel random bit error rates of 4.00x10/sup -2/ and above, the proposed scheme is able to achieve above 90% improvement in residual bit error rate performance over the current scheme. The average percentage overhead incurred using the proposed scheme is about 21%, which is the same as that of the original UEP scheme. An analysis with the theoretical bounds shows that within experimental error, the proposed scheme can perform to near optimum as compared to the current scheme.
Secure E-Commerce Transactions for Multicast Services
Authors: Anil Kumar Venkataiahgari, J. William Atwood, Mourad Debbabi
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

All e-commerce environments require support for security properties such as authentication, authorization, data confidentiality, and nonrepudiation. E-commerce protocols such as SSL, TLS, and SET offer security for e-transactions, but they are specific to the unicast (point-to-point) environment. They cannot be directly extended to provide security for multicast (point-to-multipoint) sessions. Multicast data transmission provides significant network resource savings for applications such as audio/video streaming, news broadcast services and software distribution. However, security is required to prevent theft, and to ensure revenue generation from authorized recipients. We have designed the Secure ECommerce Transactions for Multicast Services (SETMS) architectural framework, to secure ecommerce sessions for multicast environments. The SETMS framework provides authentication of host through the HIP protocol, authorization of subscriber and his/her e-payments through a variant of the 2KP protocol, a procedure to account for the subscriber's resource consumption, and support for nonrepudiation of principal parties through PKI. The SETMS framework has been formally validated using the AVISPA tool.
Plot-polling: Collaborative Knowledge Visualization for Online Discussions
Authors: Alex Ivanov, Thomas Erickson, Dianne Cyr
Venue: Proceedings of the conference on Information Visualization (2006)

Online communities are extremely popular; yet most of them still rely primarily on text for knowledge creation and communication. This paper describes a graphical webpoll prototype-a mix of information, knowledge, and social visualization-that has been designed and deployed in an online discussion board on herbal antidepressants. The prototype, hereby named the "plot-poll", allows users to collaboratively construct a sequence of mini histograms that indicate experienced mood change during a ten week period. The pilot study shows that plot-polling is quite effective in engaging low-frequency contributors to participate. More work is required to support these findings, and reveal whether the graphic format is able to provide affective qualities to the user experience.
More on Old Topics
Authors: Richard Mateosian
Venue: IEEE Micro (2006)

Reviews of "In Defense of Globalization" by Jagdish Bhagwati; "Globalization and Its Enemies" by Daniel Cohen; "The Art of SQL" by Stéphane Faroult with Peter Robson; "About Face 2.0: The Essentials of Interaction Design" by Alan Cooper and Robert Reimann; "Deep Time of the Media: Toward an Archaeology of Hearing and Seeing by Technical Means" by Siegfried Zielinski
Design and Performance of a Fault-Tolerant Real-Time CORBA Event Service
Authors: Huang-Ming Huang, Christopher Gill
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

Developing distributed real-time and embedded (DRE) systems in which multiple quality-of-service (QoS) dimensions must be managed is an important and challenging problem. This paper makes three contributions to research on multi-dimensional QoS for DRE systems. First, it describes the design and implementation of a fault-tolerant real-time CORBA event service for The ACE ORB (TAO). Second, it describes our enhancements and extensions to features in TAO, to integrate real-time and fault tolerance properties. Third, it presents an empirical evaluation of our approach. Our results show that with some refinements, real-time and fault-tolerance features can be integrated effectively and efficiently in a CORBA event service.
Reliable VoIP Services Using a Peer-to-Peer Intranet
Authors: Jens Fiedler, Tomas Kupka, Thomas Magedanz, Michael Kleis
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

From state of the art technologies for load balancing and reliability increase in VoIP infrastructures one learns that no homogenous solution exists. Thus compromises have been made as in the number of machines versus achieved reliability, or with regard to separation of load balancing and failure resilience. In this paper we present a distributed architecture for VoIP services based on peer-to-peer principles. In contrast to other peer-to-peer based approaches, relying upon an external DHT service, our architecture utilizes peer-to-peer technologies to integrate load balancing and failover requirements with a centralized VoIP server concept. This results in an integrated solution with focus on todays service provider requirements. Within the scope of this work, a proof-of-concept software solution has been designed and implemented. We show that the proposed architecture can be easily scaled up and provides efficient, redundant storage for user and session data.
Testing Memory for Unseen Visual Stimuli in Patients with Extinction and Spatial Neglect
Authors: Patrik Vuilleumier, Sophie Schwartz, Karen Clarke, Masud Husain, Jon Driver
Venue: Journal of Cognitive Neuroscience (2002)

Visual extinction after right parietal damage involves a loss of awareness for stimuli in the contralesional field when presented concurrently with ipsilesional stimuli, although contralesional stimuli are still perceived if presented alone. However, extinguished stimuli can still receive some residual on-line processing, without awareness. Here we examined whether such residual processing of extinguished stimuli can produce implicit and/or explicit memory traces lasting many minutes. We tested four patients with right parietal damage and left extinction on two sessions, each including distinct study and subsequent test phases. At study, pictures of objects were shown briefly in the right, left, or both fields. Patients were asked to name them without memory instructions (Session 1) or to make an indoor/outdoor categorization and memorize them (Session 2). They extinguished most left stimuli on bilateral presentation. During the test (up to 48 min later), fragmented pictures of the previously exposed objects (or novel objects) were presented alone in either field. Patients had to identify each object and then judge whether it had previously been exposed. Identification of fragmented pictures was better for previously exposed objects that had been consciously seen and critically also for objects that had been extinguished (as compared with novel objects), with no influence of the depth of processing during study. By contrast, explicit recollection occurred only for stimuli that were consciously seen at study and increased with depth of processing. These results suggest implicit but not explicit memory for extinguished visual stimuli in parietal patients.
Establishing an XML metadata klnowledge base to assist integration of structured and semi-structured databases
Authors: Fahad M. Al-Wasil, W. A. Gray, N. J. Fiddian
Venue: Proceedings of the 17th Australasian Database Conference - Volume 49 (2006)

This paper describes the establishment of an XML Metadata Knowledge Base (XMKB) to assist integration of distributed heterogeneous structured data residing in relational databases and semi-structured data held in well-formed XML documents (XML documents that conform to the XML syntax rules but have no referenced DTD or XML schema) produced by internet applications. We propose an approach to combine and query the data sources through a mediation layer. Such a layer is intended to establish and evolve an XMKB incrementally to assist the Query Processor to mediate between user queries posed over the master view and the distributed heterogeneous data sources. The XMKB is built in bottom-up fashion by extracting and merging incrementally the metadata of the data sources. The XMKB is introduced to maintain the data source information (names, types and locations), meta-information about relationships of paths among data sources, and function names for handling semantic and structural discrepancies. A System to Integrate Structured and Semi-structured Databases (SISSD) has been built that generates a tool for a meta-user (who does the metadata integration) to describe mappings between the master view and local data sources by assigning index numbers and specifying conversion function names. This system is flexible: users can get any master view from the same set of data sources depending on their interest. It also preserves local autonomy of the local data sources. The SISSD uses the local-as-view approach to map between the master view and the local schema structures. This approach is well-suited to supporting a dynamic environment, where data sources can be added to or removed from the system without the need to restructure the master view and to regenerate the XMKB from scratch.
Controlling garbage collection and heap growth to reduce the execution time of Java applications
Authors: Tim Brecht, Eshrat Arjomandi, Chang Li, Hang Pham
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2006)

In systems that support garbage collection, a tension exists between collecting garbage too frequently and not collecting it frequently enough. Garbage collection that occurs too frequently may introduce unnecessary overheads at the risk of not collecting much garbage during each cycle. On the other hand, collecting garbage too infrequently can result in applications that execute with a large amount of virtual memory (i.e., with a large footprint) and suffer from increased execution times due to paging.In this article, we use a large set of Java applications and the highly tuned and widely used Boehm-Demers-Weiser (BDW) conservative mark-and-sweep garbage collector to experimentally examine the extent to which the frequency of garbage collection impacts an application's execution time, footprint, and pause times. We use these results to devise some guidelines for controlling garbage collection and heap growth in a conservative garbage collector in order to minimize application execution times. Then we describe new strategies for controlling garbage collection and heap growth that impact not only the frequency with which garbage collection occurs but also the points at which it occurs. Experimental results demonstrate that when compared with the existing approach used in the standard BDW collector, our new strategy can significantly reduce application execution times.Our goal is to obtain a better understanding of how to control garbage collection and heap growth for an individual application executing in isolation. These results can be applied in a number of high-performance computing and server environments, in addition to some single-user environments. This work should also provide insights into how to make better decisions that impact garbage collection in multiprogrammed environments.