ppxscal/embedding_network huggingface dataset:
A COTS Simulation Package Emulator (CSPE) for investigating COTS simulation package interoperability
Authors: Xiaoguang Wang, Stephen John Turner, Simon J. E. Taylor, Malcolm Yoke Hean Low, Boon Ping Gan
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Commercial Off-The-Shelf (COTS) Simulation Packages (CSPs) are widely used to facilitate the creation of simulation models using some kind of visual interactive interface. CSPs have "evolved" over the years and are well used to support modeling demands in different market niches and domains. However, in terms of distributed simulation, there is almost a complete lack of support for interoperability. The advent of the High Level Architecture (HLA) standard makes it possible to connect distributed model components together. The model components can be developed using specific CSPs best suited to the application area. In this paper, a CSP Emulator (CSPE) is proposed to investigate the interfaces between the CSPs and the HLA Runtime Infrastructure. In addition to support for standalone models as provided by current CSPs, the CSPE has some new features needed for building distributed models. An evaluation is conducted between CSPE and Simul8, one of the popular CSPs.
CopperCore Service Integration - Integrating IMS Learning Design and IMS Question and Test Interoperability
Authors: Hubert Vogten, Harrie Martens, Rob Nadolski, Colin Tattersall, Peter van Rosmalen, Rob Koper
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This article describes a framework for the integration of e-Learning services. There is a need for this type of integration in general, but the presented solution was a direct result of work done on the IMS Learning Design specification (LD). This specification relies heavily on other specifications and services. The presented architecture is described using the example of two of such services: CopperCore, a LD service, and APIS, an IMS Question and Test Interoperability service. One of the design goals of the architecture was to minimize the intrusion for both the services as well as any legacy client that already uses these services.
Representing real time semantics for distributed application integration
Authors: Polly M. S. Poon, Tharam S. Dillon, Elizabeth Chang, Ling Feng
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)

Traditional real time system design and development are driven by technological requirements. With the ever growing complexity of requirements and the advances in software design, the alignment of focus has gradually been shifted to the perspective of business and industrial needs. This paper discusses a new paradigm in developing distributed real time system with the emphasis of knowledge representation and interoperability using XML. Real Time Markup Language (RTML) aims to provide a basis for interoperability.
Challenges and opportunities in the post single-thread-processor era
Authors: Steve Scott
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

The age of the single thread juggernaut has ended, due to a variety of factors. Multi-core processors are coming on strong, and scaling in being stressed more than ever. This presents a number of architectural, hardware and software challenges. This talk will reflect on these challenges from Cray's perspective in the high performance computing industry.
An Improvement in Sugeno-Yasukawa Modeler
Authors: Amir Hossein Hadad, Saeed Shiry Ghidary, Saeed Bagheri Shouraki
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)

Structure identification is one of the most significant steps in Fuzzy modeling of a complex system. Efficient structure identification requires good approximation of the effective input data. Misclassification of effective input data can highly degrade the efficiency of the inference of the fuzzy model. In this paper we present a modification to Sugeno-Yasukawa modeler to improve structure identification by increasing the accuracy of effective input data detection. There exist some intermediate models in the Sugeno-Yasukawa modeling process which a combination of them will result in the final fuzzy model of the system. In the original modeling process parameter identification is only done for the final fuzzy model. By doing the parameter identification for the intermediate fuzzy models, we have highly improved the accuracy of theses intermediate models. The RC (Regularly Criterion) error has been reduced 53% for intermediate fuzzy models and 67% in the final model for the sample function in formula (3). This accuracy increase, result in a better detection of effective input data among input data records of a system.
OS-Aware Branch Prediction: Improving Microprocessor Control Flow Prediction for Operating Systems
Authors: Tao Li, Lizy Kurian John, Anand Sivasubramaniam, N. Vijaykrishnan, Juan Rubio
Venue: IEEE Transactions on Computers (2007)

Many modern applications have a significant operating system (OS) component. The OS execution affects various architectural states, including the dynamic branch predictions, which are widely used in today's high-performance microprocessor designs to improve performance. This impact tends to become more significant as the designs become more deeply pipelined and more speculative. In this paper, we focus on the issues of understanding the OS effects on the branch predictions and designing architectural support to alleviate the bottlenecks that are created by misprediction. In this work, we characterize the control flow transfer of several emerging applications on a commercial OS. It was observed that the exception-driven, intermittent invocation of OS code and user/OS branch history interference increased misprediction in both user and kernel code. We propose two simple OS-aware control flow prediction techniques to alleviate the destructive impact of user/OS branch interference. The first consists of capturing separate branch correlation information for user and kernel code. The second involves using separate branch prediction tables for user and kernel code. We demonstrate in this paper that OS-aware branch predictions require minimal hardware modifications and additions. Moreover, the OS-aware branch predictions can be integrated with many existing schemes to further improve their performance. We studied the improvement contributed by OS-aware techniques to various branch prediction schemes ranging from the simple Gshare to the more advanced Agree, Multi-Hybrid, and Bi-Mode predictors. On the 32K-entry predictors, incorporating the OS-aware techniques yields up to 34 percent, 23 percent, 27 percent, and 9 percent prediction accuracy improvement on the Gshare, Multi-Hybrid, Agree, and Bi-Mode predictors, respectively.
Multi-projection based hemispherical display
Authors: Gun A. Lee, Hyun Kang, Dong-Sik Jo, Wookho Son
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In this paper, we describe our multi-projection based hemispherical display which is designed to provide wide field of view and high resolution image for immersive visualization of virtual environments.
Oscillations of natural population's number caused by external control
Authors: E. Ya. Frisman, E. V. Sycheva, E. V. Last
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

The new explanation of fluctuating mechanisms in exploitable populations is offered. Is shown that the trade could be the cause of destabilisation; the conditions of loss of stability depend on exploiting parameters but weakly depend on a population structure. In addition, these conditions for a multi-age population and for a uniform population are qualitatively identical. Still age structure uniquely determines the script of cyclic and chaotic dynamics' evolution. The model was adapted for description of four real exploitable populations number changes.
Randomised restarted search in ILP
Authors: Filip Železný, Ashwin Srinivasan, C. David Page,  Jr.
Venue: Machine Learning (2006)

Recent statistical performance studies of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. Specifically, it has been found that if the search cost distribution of the non-restarted randomised search exhibits a slower-than-exponential decay (that is, a "heavy tail"), restarts can reduce the search cost expectation. We report on an empirical study of randomised restarted search in ILP. Our experiments conducted on a high-performance distributed computing platform provide an extensive statistical performance sample of five search algorithms operating on two principally different classes of ILP problems, one represented by an artificially generated graph problem and the other by three traditional classification benchmarks (mutagenicity, carcinogenicity, finite element mesh design). The sample allows us to (1) estimate the conditional expected value of the search cost (measured by the total number of clauses explored) given the minimum clause score required and a "cutoff" value (the number of clauses examined before the search is restarted), (2) estimate the conditional expected clause score given the cutoff value and the invested search cost, and (3) compare the performance of randomised restarted search strategies to a deterministic non-restarted search. Our findings indicate striking similarities across the five search algorithms and the four domains, in terms of the basic trends of both the statistics (1) and (2). Also, we observe that the cutoff value is critical for the performance of the search algorithm, and using its optimal value in a randomised restarted search may decrease the mean search cost (by several orders of magnitude) or increase the mean achieved score significantly with respect to that obtained with a deterministic non-restarted search.
History Checking of XML Data Streams
Authors: Alessandro Campi, Paola Spoletini
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Besides being adopted as the new general data representation format for the Internet, XML is finding increasing acceptance as a native data exchange language. In order to fully exploit its potential XML data streams management systems have to be fully equipped with data verification and analysis capabilities. In this paper, we propose a solution to this need through a framework for the history checking and model checking of the data. The proposed method uses a linear temporal logic, called TRIO, to describe data constraints and properties. The constraints are automatically translated in Promela, the input language of the model checker SPIN, to verify the properties of sequences of XML data sets.
Ssh! We Are Adding a Process...
Authors: Mark Striebeck
Venue: Proceedings of the conference on AGILE 2006 (2006)

Google is very successful in maintaining its startup culture which is very open and engineering-centric. Project teams don't have a project manager, but organize themselves and communicate directly with all stakeholders. Most feature decisions are made by the engineering teams themselves. As well as this works for products like search, gmail - it creates issues for the AdWords frontend (AWFE) application. AWFE is much more product management and release date driven then other Google applications. This presentation discusses how we carefully introduced agile practices to coordinate the AWFE development teams and made the process more efficient and predictable.
Discrimination nets, production systems and semantic networks: elements of a unified framework
Authors: Fernand Gobet
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

A number of formalisms have been used in cognitive science to account for cognition in general and learning in particular. While this variety denotes a healthy state of theoretical development, it somewhat hampers communication between researchers championing different approaches and makes comparison between theories difficult. In addition, it has the consequence that researchers tend to study cognitive phenomena best suited to their favorite formalism. It is therefore desirable to propose frameworks which span traditional formalisms.
Towards adaptive caching for parallel and discrete event simulation
Authors: Abhishek Chugh, Maria Hybinette
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We investigate factors affecting the performance of caching to speed up discrete event simulation. Walsh and Sirer have shown that a variant of function caching (staged simulation) can improve the performance of simulation in a networking application. However, the effectiveness of caching depends significantly on cache size, the cost of consulting the cache, the hit rate, and the cost of completing the computation in case of a cache miss. We hypothesize that adaptive techniques can be used to optimize caching parameters and demonstrate an adaptive scheme that decides whether to utilize caching depending on observed cache performance and event processing times. We focus on evaluating quantitative relationships, using our own caching implementation with the P-Hold synthetic workload application running on the GTW simulation kernel. Experiments show that as the cache size is increased, performance improves to a point, then degrades, and also that the adaptive technique can substantially improve speedup.
Describing and Verifying Web Service Using CCS
Authors: Li Bao, Weishi Zhang, Xiuguo Zhang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Formal method is an effective way for modeling and verifying concurrent system. An important research field is to describe and verify Web services by formal method. Guaranteeing the validity of Web services composition is necessary for enhancing the value of this composite service. CCS is a kind of process algebra which can be used to model concurrent systems. Web services and their composition are described and modeled based on CCS in this paper. Rules about applying CCS to Web services are explained. Finally, a case study is carried and the validity of composition model is verified. Some important points in verification are discussed.
Bailey's very well-poised 6ψ6-series identity
Authors: Wenchang Chu
Venue: Journal of Combinatorial Theory Series A (2006)

By means of Abel's method on summation by parts, some two term recurrence relations on very well-poised 6ψ6-series are established. Their iteration yields a 6ψ6-series transformation with an extra natural number parameter. Evaluating the limiting series via Jacobi's triple product identity, we are led surprisingly to the celebrated bilateral 6ψ6-series identity discovered by Bailey (1936). Then we shall further generalize it to a very well-poised 10ψ10-series identity, which contains Shukla's formula (1959) as special case. Finally, the Abel's method on summation by parts will be employed again to investigate the bibasic hypergeometric series summation, which may be considered as an extension of a "split-poised" transformation on terminating 10φ9-series due to Gasper (1989).
A Simulation Approach for Analyzing the Competition among e-Auction Marketplaces
Authors: Xin Chen, Juho Makio
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

In recent years, many e-auction marketplaces have been built and some of them provide similar e-auction services. The sellers and buyers who want to trade via online auctions then have the opportunities to compare and select a marketplace to trade. Therefore, the marketplaces compete with each other to attract participants. This paper proposed a simulation approach for studying suc hcompetition between marketplaces. We consider one simple scenario with two competing marketplaces and built the simulation model. This model is implemented within a simulation framework, which is designed and can be applied to many other models generally. Simulation experiments are configured and executed afterwards. The experiment results works not only as a proof of concept, but also confirms theoretical results. The simulation approach proposed in this paper enables a novel way for analyzing the competition among eauction marketplaces, and such approach can be easily applied for a wide range of competition scenarios between e-auction marketplaces.
VISOLE: A New Game-based Situated Learning Paradigm
Authors: Junjie Shang, Morris Siu Yung Jong, Fong Lok Lee, Jimmy Ho Man Lee
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

VISOLE (Virtual Interactive Student-Oriented Learning Environment) is a new Game-based Situated Learning Paradigm for Web-based teaching and learning, which aims to help students learn from near real-life experiences and social constructions of knowledge. In this paper, we discuss the theoretical foundation, education paradigm, and technological implementation of VISOLE.
A Distributed System for Automatic Collection and Distribution of Satellite Images and Weather Information over DTT
Authors: Daniele Peretto, Marco Frattallone, Simone Piazza, Claudio Ferrero, Giovanni Ballocca, Ferdinando Ricchiuti
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

This paper illustrates and end-to-end system for the publication of weather related data on the digital television platform. A system is illustrated for collecting data from heterogeneous sources, processing and transforming them in suitable formats and then publishing after aggregation with an interactive application. The sources of data include direct collection of live data from satellite monitoring systems and text syndication from the Internet.
MICE: An Efficient Grid Scheme for Mathematical Computing
Authors: Yi Yang, Li Liu, Lian Li, Zhenfang Li, Rui Zhou
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

We designed a Grid Computing model in math based on current network computing technologies. MICE is an emerging technology to provide uniform programming, task submission, and management specifications across the large scale distributed computing nodes which deployed some famous mathematical software. MICE utilizes a three-level architecture that shields users from low-level computing resource discovery and provides globe uniform view for users. We extended MathML to solve the mathematical semantic objects' expression. CSP (Computing Service Platform) servers are adopted in MICE to provide uniform task access, transfer and management of heterogeneous distributed resources across multiple administrative domains. This architecture enables the mathematical software resources to be deployed as services on the internet. MICE can achieve good scalability, reliability and can be flexibly deployed and configured.
A Method Combining LPC-Based Cepstrum and Harmonic Product Spectrum for Pitch Detection
Authors: Hui Ding, Bo Qian, Yanping Li, Zhenmin Tang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A novel method of pitch detection, combining LPCbased Cepstrum and Harmonic Product Spectrum (HPS), has been proposed. The interaction between the vocal tract and the glottal excitation disturb the detection from glottal excitation, so we use Linear Prediction Residual to eliminate the vocal tract information and the high frequency noise which can improve the accurate to some extent. In real world, when the speech signal has been transmitted through the telephone system, low frequency including pitch information have been cut off which can significantly attenuate the detection of fundamental pitch frequency. In this paper, we use the novel method combining LPC-based Cepstrum and HPS to deal with this problem and pitch errors. Experiment studied indicates that this novel method is effective and valuable for application in pitch detection, since it robustly handles different frequency domain noise and pitch errors.
Multi-domain lambda grid data portal for collaborative grid applications
Authors: Oliver Yu, Anfei Li, Yuan Cao, Leping Yin, Ming Liao, Huan Xu
Venue: Future Generation Computer Systems (2006)

This paper presents the iGrid2005 demonstration of the multi-domain Lambda Grid data portal to enable collaborative Grid applications to retrieve gigabyte-size scientific datasets on demand over a wide-area Lambda Grid test-bed spanning across the United States and Europe. The data portal allows collaborative users to register and discover distributed datasets across a multi-domain Lambda Grid through a web-service based dataset registry and search engine, and to deliver the discovered datasets through dynamic established lightpaths to specified computing cluster locations for dataset manipulation. The data portal employs the novel Secure Photonic Inter-domain Negotiator (SPIN) as a secure multidomain control plane to set up dynamic lightpaths between the source and destination clusters for respective storage and manipulation of the discovered datasets over a multi-domain Lambda Grid. The data portal employs lamhda-aware middleware and transport protocol to optimize transfer of the discovered datasets over the dynamic established lightpaths. Implementation details and observed performance results from the demonstrations of the SPIN-based Lambda Grid data portal are reported.
Computational studies of morphogen gradients
Authors: Qing Nie
Venue:  (2006)

One of the central problems in developmental biology is how uniform fields of cells are transformed into tissues with highly specialized cell types at distinct anatomical positions. In this process, diffusible morphogens produced by certain cells pattern the surrounding tissue through interactions with receptor proteins on the cell membrane. wingless (Wg), a member of the Wnt gene family and decapentaplegic (Dpp), a member of the BMP gene family, are key morphogens required for the wing patterning in the embryo of Drosophila. The homology in genome lead to expectations that the genetic tools developed in Drosophila would help understanding the mammalian gene signaling pathways. Starting from describing a recent biological phenomena, we construct a new mathematical model to illustrate how cooperative interactions of Dlp and Notum(a type of enzyme) and Wg shape the morphogen gradients. In the process of simulation, we find that a typical biological system is severely stiff, which constrain the time-step. To overcome the difficulties, we have developed a new class of semi-implicit schemes which removes both time-step constraints on diffusion and reaction terms. Moreover, we apply multi-grid approach to solve the steady reaction-diffusion equations, which accelerate the convergence dramatically. Furthermore, we investigate morphogen gradient formation in disordered systems. The question is how the gradients function reliably in the face of genetic variation. We find that the existence of feedback regulation is an important component responsible for proper BMP signaling. Finally, I propose my future research plans.