ppxscal/embedding_network huggingface dataset:
Constructing Web Service Flows with Reusable Aspects
Authors: Yang Xu, Shengqun Tang, Zukai Tang, Youwei Xu, Ruliang Xiao
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Although there can be some value in accessing a single web service, the greater value is derived from assembling web services into more powerful composite web services. Web service flows are composite web services based on process. The web service flows specified by current specifications are static that can not dynamically adapt themselves to often changing business environment and have the problem of code scattering and tangling relating to crosscutting concerns that cut across the process boundaries. In this paper, we apply AOP concept to support the dynamic adaptation of web service flows. We give our approach for describing aspect as extension to BPEL, considering how to reuse the definition of an advice that maybe has different type at different pointcuts. And we present an approach for verifying the correctness of the web service flows weaved with aspects before they are deployed.
Static analysis meets distributed fault-tolerance: enabling state-machine replication with nondeterminism
Authors: Joseph G. Slember, Priya Narasimhan
Venue: Proceedings of the 2nd conference on Hot Topics in System Dependability - Volume 2 (2006)

Midas is an inter-disciplinary approach to supporting state-machine replication for nondeterministic distributed applications. The approach exploits compile-time static analysis to identify both firsthand and second-hand sources of nondeterminism. Subsequent runtime compensation occurs through either the transfer of nondeterministic checkpoints or the reexecution of inserted code, and restores consistency among replicas before each new client request. The approach avoids the need for lock-step synchronization and leverages application-level insight to address only the nondeterminism that matters. Our preliminary evaluation demonstrates Midas' feasibility and current performance overheads.
Hyperscaling of plasma turbulence simulations in DEISA
Authors: Hermann Lederer, Roman Hatzky, Reinhard Tisma, Alberto Bottino, Frank Jenko
Venue: Proceedings of the 5th IEEE workshop on Challenges of large applications in distributed environments (2007)

For support of the world-wide ITER (International Thermonuclear Experimental Reactor) project [1], large scale numerical simulations will be a necessity. Plasma turbulence simulations play a key role for the design, construction and optimization of the necessary fusion devices. The simulations will be so compute and memory intensive that applications must be able to efficiently use tens of thousands of processors. Highly scalable applications are mandatory. In Europe, within the DEISA supercomputing grid project, the DEISA Extreme Computing Initiative supports application enabling work and usage of Europe's most powerful supercomputers for challenging projects. With all support of the DEISA Extreme Computing Initiative and the DEISA Joint Research Activity in Plasma Physics, leading plasma turbulence simulations have been enabled for hyperscaling and for efficient and portable usage in the heterogeneous DEISA grid. Here we report about the large scale applications GENE and ORB5 with high relevance for ITER. GENE, a so-called Vlasov-code, was parallelized to such a high degree that efficient usage on 32,768 processors could be demonstrated. The PIC code ORB5 was enabled for hyperscaling especially through application of the domain cloning concept. Efficient usage of ORB5 code could be demonstrated on 8192 processors.
Context Aware Network Enabled Distributed Modeling and Simulation Framework
Authors: Asad Waqar Malik, Shoab A. Khan, Sulieman Khan
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper presents a novel Distributed modeling and simulation framework, which is designed and implemented to cater for a wide Varity of scenarios and applications including situations spread over large complex distributed networks. The major contribution is in developing an infrastructure that can provide numerous services like time management, data distribution management, entity management, context aware management, ownership management etc to distributed simulation. This is accomplished by constituting a middleware over an HLA compliant RTI. This context-aware middleware is incorporated inside the runtime infrastructure to enhance the service defined in IEEE standard for distributed modeling and simulation. In many real world simulations context providers (sensors) can play a vital role. Using the framework different kinds of context providers can be added in a simulation.
Anomaly detection in multidimensional data using negative selection algorithm
Authors: D. Dasgupta, N. S. Majumdar
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

While dealing with sensitive personnel data, the data have to be maintained to preserve integrity and usefulness. The mechanisms of the natural immune system are very promising in this area, it being an efficient anomaly or change detection system. This paper reports anomaly detection results with single and multidimensional data sets using the negative selection algorithm developed by Forrest et al. (1994).
Technological allusivity: appreciating and teaching the role of aesthetics in engineering design
Authors: C. C. Adams
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Is there an aesthetic dimension to engineering design? Is aesthetic sensitivity a characteristic that ought to be cultivated by prospective engineers? Does aesthetic sensitivity enhance or impede the engineering design effort? The answer to these questions will largely determine the answer to the broader question, "what is the role of the humanities in undergraduate engineering education?" Toward that end, the paper offers some answers to those more specific questions regarding aesthetics. After surveying a portion of the relevant literature, the issue of how we recognize and distinguish the aesthetic dimension is investigated. This is followed by a discussion of the nature of engineering design and how it differs from what is often called "applied science". With that distinction clarified, the question of terminology is addressed. A definitional context for questions such as "what is aesthetics?" and "what is good engineering design aesthetics?" is developed by rehearsing the meaning of well-defined terms and by suggesting meanings for those terms that often litter the linguistic landscape with their ambiguity. Equipped with these definitions, the role of aesthetics in engineering design is fleshed out, aesthetic allusion is distinguished from symbolic signifying, and examples of aesthetics in technical products as well as in the process of design are discussed. The paper concludes with some thoughts and recommendations about teaching aesthetics to undergraduate engineering students. 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
Random fuzzy EOQ model with imperfect quality items
Authors: Xiaobin Wang, Wansheng Tang, Ruiquing Zhao
Venue: Fuzzy Optimization and Decision Making (2007)

This paper investigates an economic order quantity (EOQ) problem with imperfect quality items, where the percentage of imperfect quality items in each lot is characterized as a random fuzzy variable while the setup cost per lot, the holding cost of each unit item per day, and the inspection cost of each unit item are characterized as fuzzy variables, respectively. In order to maximize the expected long-run average profit, a random fuzzy EOQ model is constructed. Since it is almost impossible to find an analytic method to solve the proposed model, a particle swarm optimization (PSO) algorithm based on the random fuzzy simulation is designed. Finally, the effectiveness of the designed algorithm is illustrated by a numerical example.
Apollonius diagrams and the Representation of Sounds and Music
Authors: Alex McLean, Frederic Fol Leymarie, Geraint Wiggins
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

We introduce the use of weighted medial graph struc- tures to represent sounds and musical events. Such structures permit the building of hierarchical neighbor- hood relationships (symmetries) while mapping time to a weight (of a note, or event). This is useful to re- late perceptual organisations (groupings in the sense of Gestalt theory) both visually and aurally. We treat time in a cinematographic way, effectively using a space- time representation. The use of colour, modulation (of waveforms), orientation, speed, etc., allows us to integrate multiple musical features in our dynamic dia- grams. We provide illustrations, including animations, of our ideas.
Effective Summarization of Multi-Dimensional Data Streams for Historical Stream Mining
Authors: Samer Nassar, Joerg Sander
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

We consider the following problem: given a very large data stream, a limited space to encode the stream, and a compression technique to compress the stream, retain the most important information from the distant past of the stream while at the same time retain high quality of the compressed information that is in the recent part of the stream to perform temporal analysis of the summarized information. Simple schemes for accumulating micro-clustering summaries of stream windows that have been previously proposed are very ineffective for solving this challenging task. We overcome the limitations of these schemes by first identifying spatial summaries that compress "similar' regions in the data space, and reduce their space consumption using novel approximate spatio-temporal summaries. Second, we present policies for effectively utilizing the space budget and managing these novel approximate spatio-temporal summaries.
Synthesis of vibrato singing
Authors: Y. Meron
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Vibrato is an important factor in the production of good quality singing of western classical songs. Vibrato is characterized by a temporal modulation of the singing pitch, as well as of the spectral structure. We are trying to synthesize singing using the large database, selection synthesis scheme. Simple waveform concatenation-modification synthesis can produce unnatural sounding vibrato sounds. A method to synthesize more natural vibrato sounds is described. This method works by ensuring that the phase of the vibrato in the original (source database) unit, used for synthesis, is consistent with the vibrato phase of the synthesized (target) vibrato sound. By doing so, the required modification of the original unit's prosody can be minimized, and the production of the characteristic vibrato spectral modulations can be improved.
Power optimization and management for complex embedded systems
Authors: Pai H. Chou
Venue:  (2006)

As embedded systems evolve to integrate more complex functions in shrinking dimensions, power is becoming a limiting factor. The increasing complexity creates new interactions and dependencies among subsystems, making power optimization and management more difficult. Traditionally, design complexity is addressed by raising abstraction levels and defining new application programming interfaces (API's) to separate design details and solve subproblems in their own domains. Resource-level power optimizations often yield locally optimized solutions and are unable to utilize the application-level knowledge for more power savings. System-level approaches that neglect certain architectural details may also produce power-inefficient solutions. This dissertation takes a system-level approach and proposes a design framework to enable systematic power optimization and management for power-aware complex systems. By bridging the knowledge gap between the application and the architecture, and modeling important architectural level dependencies, the design framework allows designers to effectively perform cross-domain power optimization and achieve higher power-awareness and higher power efficiency. Our integrated techniques also enable power source-aware solutions that take advantage of increased power ranges brought by combined mode selection for best utilization of the available energy. The results of the research work have been implemented as part of the IMPACCT (and later IMPACCTpro) tool set. We apply our power-aware design methodology and IMPACCT design tools to applications on a number of complex system platforms including a Mars rover, a JTRS radio, and an iPaq wireless handheld system. Experimental results show the effectiveness of our design framework and significant energy savings that would be difficult to achieve in a traditional approach.
Extreme programming for software engineering education?
Authors: L. Williams
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The eXtreme Programming (XP) software development methodology, has received considerable attention in recent years. The adherents of XP anecdotally extol its benefits, particularly as a method that is highly responsive to changing customer's desires. While XP has acquired numerous vocal advocates, the interactions and dependencies between XP practices have not been adequately studied. Good software engineering practice requires expertise in a complex set of activities that involve the intellectual skills of planning, designing, evaluating, and revising. The authors explore the practices of XP in the context of software engineering education. To do so, one must examine the practices of XP as they influence the acquisition of software engineering skills. The practices of XP, in combination or isolation, may provide critical features to aid or hinder the development of increasingly capable practitioners. This paper evaluates the practices of XP in the context of acquiring these necessary software engineering skills.
Exact convergence analysis of affine projection algorithm: the finite alphabet inputs case
Authors: H. Besbes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The affine projection algorithm (APA) is a very promising algorithm that has good convergence properties when the input signal is correlated. In particular, it's used to perform communications systems: echo cancellation, equalization. However, due to its complexity, there is no available transient and steady state analysis. We present an exact analysis approach tailored for digital transmission context. In such context, the input signal remains in a finite alphabet set. With a discrete Markov chain model of the inputs, we can describe accurately the APA's behavior without any unrealistic assumption. In particular we calculate the exact value of critical and optimum step size. Moreover, we provide the exact mean square deviation for all step size and input correlation. The influence of high order statistics can be enhanced.
Stochastic optimization for allocation problems with shortfall risk constraints: Research Articles
Authors: Roberto Casarin, Monica Billio
Venue: Applied Stochastic Models in Business and Industry (2007)

One of the crucial aspects in asset allocation problems is the assumption concerning the probability distribution of asset returns. Financial managers generally suppose normal distribution, even if extreme realizations usually have an higher frequency than in the Gaussian case. The aim of this paper is to propose a general Monte Carlo simulation approach able to solve an asset allocation problem with shortfall constraint, and to evaluate the exact portfolio risk-level when managers assume a misspecified return behaviour. We assume that returns are generated by a multivariate skewed Student-t distribution where each marginal can have different degrees of freedom. The stochastic optimization allows us to value the effective risk for managers. In the empirical application we consider a symmetric and heterogeneous case, and interestingly note that a multivariate Student-t with heterogeneous marginal distributions produces in the optimization problem a shortfall probability and a shortfall return level that can be adequately approximated by assuming a multivariate Student-t with common degrees of freedom. Thus, the proposed simulation-based approach could be an important instrument for investors who require a qualitative assessment of the reliability and sensitivity of their investment strategies in the case their models could be potentially misspecified. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Scalability in the XFS file system
Authors: Adam Sweeney, Doug Doucette, Wei Hu, Curtis Anderson, Mike Nishimoto, Geoff Peck
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

In this paper we describe the architecture and design of a new file system, XFS, for Silicon Graphics' IRIX operating system. It is a general purpose file system for use on both workstations and servers. The focus of the paper is on the mechanisms used by XFS to scale capacity and performance in supporting very large file systems. The large file system support includes mechanisms for managing large files, large numbers of files, large directories, and very high performance I/O. In discussing the mechanisms used for scalability we include both descriptions of the XFS on-disk data structures and analyses of why they were chosen. We discuss in detail our use of B+ trees in place of many of the more traditional linear file system structures. XFS has been shipping to customers since December of 1994 in a version of IRIX 5.3, and we are continuing to improve its performance and add features in upcoming releases. We include performance results from running on the latest version of XFS to demonstrate the viability of our design.
Finding what's not there: a new approach to revealing neglected conditions in software
Authors: Ray-Yaung Chang, Andy Podgurski, Jiong Yang
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach to revealing neglected conditions that integrates static program analysis and advanced data mining techniques to discover implicit conditional rules in a code base and to discover rule violations that indicate neglected conditions. The approach requires the user to indicate minimal constraints on the context of the rules to be sought, rather than specific rule templates. To permit this generality, rules are modeled as graph minors of program dependence graphs, and both frequent itemset mining and frequent subgraph mining algorithms are employed to identify candidate rules. We report the results of an empirical evaluation of the approach in which it was used to discover conditional rules and neglected conditions in ~25,000 lines of source code.
Automatic program generation for scientific computing
Authors: Martin Erwig
Venue:  (2006)

The code reuse problem is a common software engineering problem in scientific computing. As a prevailing programming language in many scientific fields, Fortran does not provide support to address this problem. One particular reason is that Fortran lacks the support for generic programming. By applying program-generation techniques, we developed two approaches to address the code reuse problem. The first approach is to design a program generator for the equation-based specification of subroutines that can be generic in the dimensions of arrays, parameter lists, and called subroutines. We apply that approach to a real-world problem in scientific computing, which requires the generic description of inverse ocean modeling tools. In addition to a compiler that can transform generic specifications into efficient Fortran code for models, we have also developed a type system that can identify possible errors already in the specifications. The second approach is to extend Fortran with the support for generic programming. The result is the language Parametric Fortran, which supports defining Fortran program templates by allowing the parameterization of arbitrary Fortran constructs. A Fortran program template can be translated into a regular Fortran program guided by values for the parameters. Parametric Fortran is particularly useful in scientific computing. The applications include defining generic functions, removing duplicated code, and automatic differentiation. The described Fortran extension has also been successfully employed implementing the generic inverse ocean modeling system.
MOB: zero-configuration high-throughput multicasting for grid applications
Authors: Mathijs den Burger, Thilo Kielmann
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized tree structures, based on external network monitoring data. This dependence on monitoring data, however, severely impacts both ease of deployment and adaptivity to dynamically changing network conditions. In this paper, we present Multicast Optimizing Bandwidth (MOB), a high-throughput multicast approach, inspired by the BitTorrent protocol. With MOB, data transfers are initiated by the receivers that try to steal data from peer clusters. Instead of using potentially outdated monitoring data, MOB automatically adapts to the currently achievable bandwidth ratios. Our experimental evaluation compares MOB to both the BitTorrent protocol and to our previous approach, Balanced Multicasting, the latter optimizing multicast trees based on external monitoring data. We show that MOB outperforms the BitTorrent protocol. MOB is competitive with Balanced Multicasting as long as the network bandwidth remains stable. With dynamically changing bandwith, MOB outperforms Balanced Multicasting by wide margins.
Reconstruction and prediction of nonlinear dynamical systems: a hierarchical Bayes approach with neural nets
Authors: T. Matsumoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

When nonlinearity is involved, time series prediction becomes a rather difficult task where the conventional linear methods have limited successes for various reasons. One of the greatest challenges stems from the fact that typical observation data is a scalar time series so that dimension of the nonlinear dynamical system (embedding dimension) is unknown. This paper proposes a hierarchical Bayesian approach to nonlinear time series prediction problems. This class of schemes considers a family of prior distributions parameterized by hyperparameters instead of a single prior so that it enables algorithms less dependent on a particular prior. One can estimate posterior of weight parameters, hyperparameters and embedding dimension by marginalization with respect to the weight parameters and hyperparameters. The proposed scheme is tested against two examples: (i) chaotic time series, and (ii) building air-conditioning load prediction.