ppxscal/embedding_network huggingface dataset:
An Extended Service Oriented Architecture forWebServices Adoption through Economic Incentives
Authors: Tiberiu Stef-Praun
Venue: Proceedings of the First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (2005)

This paper proposes and researches mechanisms which on the one hand support and stimulate the large scale adoption of web services as a means for publishing software components, and on the other hand enable the dynamic creation and execution of internet-scale distributed software systems built on top of this web services environment. The proposed solution is to extend the Service-Oriented Architecture (SoA) design pattern by adding a transparent middleware layer that restricts and controls the access of the applications to the needed web services by means of requiring successful participation in auctions associated with those web services. This proposal has several benefits: an efficient pricing mechanism for digital services, the introduction of incentives that would drive the development and offering of web services,and a healthy, supply-demand based mechanism that enables the evolution both of the published web services and of the systems built on these services. Finally, systems built on our extended architecture will be capable of autonomously evolving in terms of choice of the needed services and will function efficiently in terms of costs associated with their execution. The current paper uncovers this new research field and focuses on the rationale for our extension, the research problems generated by it; it also describes the middleware supporting the auction mechanisms, and looks into initial practical considerations of auctions mechanisms for web services and strategies for building auction-enhanced SoA systems.
Testing telecoms software with quviq QuickCheck
Authors: Thomas Arts, John Hughes, Joakim Johansson, Ulf Wiger
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Erlang (2006)

We present a case study in which a novel testing tool, Quviq QuickCheck, is used to test an industrial implementation of the Megaco protocol. We considered positive and negative testing and we used our developed specification to test an old version in order to estimate how useful QuickCheck could potentially be when used early in development.The results of the case study indicate that, by using Quviq QuickCheck, we would have been able to detect faults early in the development.We detected faults that had not been detected by other testing techniques. We found unclarities in the specifications and potential faults when the software is used in a different setting. The results are considered promising enough to Ericsson that they are investing in an even larger case study, this time from the beginning of the development of a new product.
DNSSEC Operational Impact and Performance
Authors: Alexis Guillard
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

This paper presents the vulnerabilities of the Domain Name System (DNS) and shows the benefits of using a new Internet standard for a more secure DNS, called Domain Name System Security Extensions (DNSSEC). The succeeding section reports on several DNSSEC tests and shows the likely impact of DNSSEC implementation on a typical large ISP's DNS platform.
Multi-layer Grid Portal Architecture Based on Mobile Agent
Authors: Fang Juan
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Many Grid portal architectures have three layers: browser, portal and Grid environment. We design a multi-layer Grid portal architecture, which introduced Mobile Agent; the mobile agents can gain the different information of the Grid resources. This paper analyzes the multi-layer architecture of Grid portal, presents the security strategy and introduces the function of different mobile agent.
Extending Object-Oriented Middleware for Location-Aware Services
Authors: Dionisis X. Adamopoulos
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Mobile ad hoc networks (manets) are dynamically reconfigurable multi-hop wireless networks with no fixed infrastructure, consisting of radio-equipped mobile hosts. Each host acts as a router and moves in an arbitrary manner. Under such a network environment routing becomes a challenging task that can be significantly supported and facilitated by the exploitation of location information, as this paper argues. More specifically, after a brief introduction to routing in manets, a location discovery algorithm is proposed. Then, the paper focuses on location-aware routing and after presenting briefly the most important related protocols attempts to compare them based on a number of qualitative properties. Finally, the emergence of location aware services through the support of objectoriented middleware is discussed, a service discovery scenario based on Jini technology is proposed and important related deployment challenges are highlighted.
Simulation lays the foundation for artificial intelligence in surgery center
Authors: Christian Baldwin
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In general operating suites, there is a problem stemming from a misalignment of clinical staff and operating resources. The main objectives are to increase the throughput and associated revenues, increase patient safety, and decrease operational costs. Simulation can be used to model the current environment and experiment with different scheduling algorithms and resource assignments until an optimal method of operations is derived. If planned correctly, significant results can be achieved after the first iteration of implementation; however, additional gains in capacity are mathematically possible if you work to increase communications with artificial intelligence. Simulation is just one key component to the total AI engine. Further advances in the world of simulation and the relationship of simulation to other fields of science will provide not only the foundation for artificial intelligence but also the constructs for real-time management and proactive decision making for the healthcare industry for many years to come. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
On developing system dynamics model for business process simulation
Authors: Lianjun An, Jun-Jang Jeng
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Business operations can be formally described in business process models that capture activities, information, and flow embedded in business operation. System dynamics modeling is a set of conceptual tools that enable business process designers to build computer simulations of complex business process behaviors. System dynamics models provide accurate description of system behavior along the time dimension. It gives a convenient tool to conduct what if analysis though dynamics points of view. However, to develop system dynamics models requires keen understanding of the "physics" of the target business operations, business organizations, and financial structures and so on. This paper is aimed to provide heuristics and guidelines of developing system dynamics models based on given business process models along with associated reference contexts. An example, from supply chain management domain, of using business process models to derive system dynamics models will be given in the paper.
Real-Time Video Segmentation with VGA Resolution and Memory Bandwidth Reduction
Authors: Hongtu Jiang, Viktor Owall, Hakan Ardo
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper presents the implementation of a video segmentation unit used for embedded automated video surveillance systems. Various aspects of the underlying segmentation algorithm are explored and modifications are made with potential improvements of segmentation results and hardware efficiency. In addition, to achieve real-time performance with high resolution video streams, a dedicated hardware architecture with streamlined dataflow and memory access reduction schemes are developed. The whole system is implemented on a Xilinx FPGA platform, capable of real-time segmentation with VGA resolution at 25 frames per second. Substantial memory bandwidth reduction of more than 70% is achieved by utilizing pixel locality as well as wordlenghth reduction. The hardware platform is intended as a real-time testbench for observations of long term effects with different parameter settings, which is hard to achieve on a PC platform.
Wavelet-based synthesis of the Rosenblatt process
Authors: Patrice Abry, Vladas Pipiras
Venue: Signal Processing (2006)

Based on a wavelet-type expansion of the Rosenblatt process, we introduce and examine two different practical ways to simulate the Rosenblatt process. The synthesis procedures proposed here are obtained by either truncating the series of the approximation term or using the approximation coefficients in the wavelet-type expansion of the Rosenblatt process. Both benefit from the low computational cost usually associated with the discrete wavelet transform. We show that the number of zero moments of a related orthogonal multiresolution analysis plays an important role. We study in detail the wavelet-based simulation in terms of uniform convergence. We also discuss at length the importance of the choices of the initial and final resolutions, the specific case of the simulation on the integer grid as well as the usefulness of the wavelet-based simulation. Matlab routines implementing these synthesis procedures as well as their analysis are available upon request.
Unstructured grid optimization for improved monotonicity of discrete solutions of elliptic equations with highly anisotropic coefficients
Authors: Martin J. Mlacnik, Louis J. Durlofsky
Venue: Journal of Computational Physics (2006)

Multipoint flux approximation (MPFA) techniques are commonly applied for discretizing the porous media flow equations within the context of finite volume numerical procedures. Although these methods can be applied to heterogeneous, anisotropic systems on generally unstructured grids, the inverse of the resulting linear operator can suffer from a loss of monotonicity at high permeability anisotropy ratios, resulting in spurious oscillations of the pressure solution. The purpose of this paper is to develop a method for optimizing unstructured grids in two and three dimensions such that the monotonicity behavior of the MPFA technique is significantly improved. The method employs anisotropic triangulation and can be readily combined with permeability upscaling procedures. Results are presented for a variety of examples and the technique is shown to perform well on problems involving complex grid point distributions and heterogeneous permeability fields with strong anisotropy ratios (of O(100)). Oscillation free pressure solutions are achieved in all cases considered, even for examples in which the original grid shows large oscillations.
A Novel Data Association Algorithm for Object Tracking in Clutter with Application to Tennis Video Analysis
Authors: Fei Yan, Alexey Kostin, William Christmas, Josef Kittler
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

It is well recognised that data association is critically important for object tracking. However, in the presence of successive misdetections, a large number of false candidates and an unknown number of abrupt model switchings that happen unpredictably, the data association problem can be very difficult. We tackle these difficulties by using a layered data association scheme. At the object level, trajectories are "grown" from sets of object candidates that have high probabilities of containing only true positives; by this means the otherwise combinatorial complexity is significantly reduced. Dijkstra's shortest path algorithm is then used to perform data association at the trajectory level. The algorithm is applied to low-quality tennis video sequences to track a tennis ball. Experiments show that the algorithm is robust to abrupt model switchings, and performs well in heavily cluttered environments.
Reward-period Activity in Primate Dorsolateral Prefrontal and Orbitofrontal Neurons Is Affected by Reward Schedules
Authors: Satoe Ichihara-Takeda, Shintaro Funahashi
Venue: Journal of Cognitive Neuroscience (2006)

Reward-period activity observed in the dorsolateral prefrontal cortex (DLPFC) and the orbitofrontal cortex (OFC) is thought to represent the detection of reward delivery. To investigate whether this activity plays the same role in these areas, we examined this activity under different reward schedules and whether the reward schedule has similar effects on this activity in each of these areas. A monkey performed an oculomotor delayed-response (ODR) task under two reward schedules. In the ODR-1 schedule, the monkey received a large amount of reward only after four successful trials, whereas in the ODR-2 schedule, it received a small amount of reward after every successful trial. Although reward-period activity was observed in both areas, more neurons exhibited this activity in the OFC. Reward-period activity was modulated by the proximity to reward delivery in both areas and this feature was observed more frequently in the OFC. The onset time of this activity also gradually advanced depending on the proximity to reward delivery. Moreover, many OFC neurons with this activity responded to free reward delivery. These results indicate that reward-period activity in the OFC represents the detection of reward delivery and that the gradual change in the magnitude and the onset time of this activity represents the expectation of reward delivery. Similar features of reward-period activity were observed in DLPFC neurons, although a significant number of DLPFC neurons did not respond to free reward delivery and no advance was observed in the onset time of this activity. These results suggest that reward-period activity in the DLPFC participates in whether or not correct performance was achieved. Thus, although similar reward-period activity was observed in both areas, the activity in the OFC represents the detection of reward delivery and is affected by the monkey's motivational state, whereas that in the DLPFC seems to participate in monitoring whether or not the necessary performance is achieved.
Infrastructural Issues for Agent-Based Distributed Learning
Authors: V. Gorodetskiy, O. Karsaev, V. Samoilov
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

The experience proved that integration of multi-agent and data mining technologies provides mutual enrichment of them both and leads to emergence of new design technologies and systems with better properties. However, this integration put forward novel problems of different kinds. The paper considers agent-based distributed design technology of distributed classification systems and presents basic components of the software infrastructure intended for support of the aforementioned design technology. The paper also analyzes associated problems and outlines some basic solutions proposed.
Operational semantics for multi-language programs
Authors: Jacob Matthews, Robert Bruce Findler
Venue: ACM SIGPLAN Notices (2007)

Inter-language interoperability is big business, as the success of Microsoft's .NET and COM and Sun's JVM show. Programming language designers are designing programming languages that reflect that fact --- SML#, Mondrian, and Scala, to name just a few examples, all treat interoperability with other languages as a central design feature. Still, current multi-language research tends not to focus on the semantics of interoperation features, but only on how to implement them efficiently. In this paper, we take first steps toward higher-level models of interoperating systems. Our technique abstracts away the low-level details of interoperability like garbage collection and representation coherence, and lets us focus on semantic properties like type-safety and observable equivalence.Beyond giving simple expressive models that are natural compositions of single-language models, our studies have uncovered several interesting facts about interoperability. For example, higher-order contracts naturally emerge as the glue to ensure that interoperating languages respect each other's type systems. While we present our results in an abstract setting, they shed light on real multi-language systems and tools such as the JNI, SWIG, and Haskell's stable pointers.
Target II: the first discrete event simulation of diabetes and its complications
Authors: J Jaime Caro, Alexandra Ward, Jörgen Möller
Venue: Proceedings of the 37th conference on Winter simulation (2005)

A model showing the pharmaco-economic effects of different diabetes-treatments in 1000 patients by cloning the patients once their characteristics are assigned. The Arena model works jointly with an Excel-shell and looks at the effects on the individual patient and on the aggregated economic implications over typically 20 years.
Multi-Attribute Decision Making E-Course
Authors: Cornel Resteanu, Marius Somodi, Bogdan Alexe
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The "Education and Training 2010 European Work Program [1] has a strong support in Romania. The leaders of the National Excellency Research Program encourage the elearning domain and so a complex project named "Excellency Level Tools for Multi-Attribute Decision Making Field's Promotion" has been granted. Pertaining to this project, an electronic course on this subject for enhanced learning in making optimal decisions opens a new era in the instrumentation of the lifelong learning process. The electronic course will contain the entire know-how achieved along the years by the team members involved in the Decision Sciences' research and applications projects. It will constitute the expression of the also fundamental but mostly applicative research in this area. It is not designed for the international scientific community, but for individuals having a moderate or strong economical, technical and mathematical background, including well prepared students who want to rapidly assimilate this knowledge area.
Architecture Oriented towards the management of Learning Objects Repositories (LOR@)
Authors: Leonel Iriarte Navarro, Manuel Marco Such, Daniel Moron Martin, Pedro Pernias Peco
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This paper describes an architecture oriented towards the usage of Learning Objects Repositories (LOR@). LOR@ are logically organized through different layers constituted by classes, services, components and diagrams which are specified through a Unified Modeling Language (UML). The design is highly flexible, based on a data distributed model and oriented towards the management of different standards. It can be reused freely and enriched by institutions or research groups which develop applications for organizing and managing learning objects repositories.
The 'MECIMPLAN' Approach to Agent-Based Strategic Planning
Authors: Jose Miguel Castillo, Sascha Ossowski, Luis Pastor
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Despite the wide range of problems in which planning is used, it is possible to utilize a common methodology that allows us to reach specific planning objectives for a real problem. From a software engineering point of view, the methodology assures us the quality of the process and the product. In this paper we introduce a methodology that permits us to construct models in order to solve planning problems at any project environment through the use of agents. We have built a prototype for Strategic Planning that presents us with an alternative solution to the well-known 'Prospective' technique. It is particularly relevant for planning problems that are concerned with decisions that have a long-term impact. The results obtained through the construction of prototypes illustrate the adequacy of our approach. This paper is organized as follows: we first give a general overview of the methodology. In Section 2, we illustrate the approach by a case study in the domain of strategic planning. Section 3 presents an agent-based prototype that implements the case study. We conclude the paper by stating the lessons learnt from this enterprise.
On the analysis of fuzzy string patterns with the help of extended and stochastic GDPLL(k) grammars
Authors: Mariusz Flasiński, Janusz Jurek
Venue: Fundamenta Informaticae (2006)

Two methods of the analysis of distorted (fuzzy) string patterns are presented. The methods are based on the use of GDPLL(k) grammars generating a large subclass of context sensitive languages. The first one utilizes error-correcting approach: a minimum distance measure is used for error-correcting parsing. The second one utilizes stochastic approach: the decision about the production to be applied in a derivation step is given according to the probability measure.
A Test Data Generation Tool for Unit Testing of C Programs
Authors: Zhongxing Xu, Jian Zhang
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

This paper describes a prototype tool, called SimC, which automatically generates test data for unit testing of C programs. The tool symbolically simulates the execution of the given program. It simulates pointer operations precisely. This makes it capable of generating test data for programs involving pointer and structure operations. Experiments on real-world programs including the GNU coreutils are presented.
Registering UMM Business Collaboration Models in an ebXML Registry
Authors: Birgit Hofreiter, Christian Huemer, Marco Zapletal
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)

UN/CEFACT's modeling methodology (UMM) is used to develop global choreographies of inter-organizational business processes. UMM models should be publically available in order to foster re-use and to reference them in trading partner agreements. In this paper we define a mapping of UMM models or parts thereof to the ebXML registry information model (RIM).
c-Step Diagnosis
Authors: Guey-Yun Chang, Gen-Huey Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

An new diagnosis strategy called c-step diagnosis is proposed. A system is c-step t-diagnosable if all faulty units within the system can be identified and repaired in at most c iterations provided the number of faulty units present does not exceed t. The upper bound and the lower bound on the c-step diagnosabilities were derived. Moreover, a upper bound on c was suggested.