ppxscal/embedding_network huggingface dataset:
Measurement-based Performance Analysis of E-commerce Applications with Web Services Components
Authors: Venu Datla, Katerina Goseva-Popstojanova
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Web services are increasingly used to enable interoperability and flexible integration of e-business systems. In paper we focus on measurement-based performance analysis of an e-commerce application which uses Web services components to execute business operations. In our experiments we use a session-oriented workload generated by tool developed accordingly to the TPC-W specification. empirical results are obtained for two different user profiles, Browsing and Ordering, under different workload intensities. Unlike the previous work which was focused on the overall server response time and throughput, we present Web interaction, software architecture, and hardware resource level analysis of the system performance. In particular, we propose a method for extracting component level response times from the application server logs and study the impact Web services and other components on the server performance. The results show that the response times of Web services components increase significantly under higher workload intensities when compared to other components. From the hardware resource measurements it is obvious that higher response times of Web services components are to parsing XML messages and contention for database resources. The results of our study identify software components and hardware resources which are potential bottlenecks in the system and thus provide valuable information for capacity planning of e-commerce applications.
Face to face: a media-art using a face detection system and its exhibition
Authors: Yasuto Nakanishi
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

"Face to face" is a media-art that only takes pictures of a profile or a blurring face, etc. those might be thought as failure pictures generally. Its theme is sameness and difference between camera and mirror, and it aims to offer an experience that people come across oneself whom he/she might not know after he/she sees oneself whom oneself usually see in a mirror. We had an exhibition at NTT ICC (Inter-Communication Center) in Tokyo. In seeing stored images, people seemed to find various activities thorough interacting with this work.
Metrics for Effective Resource Management in Global Computing Environments
Authors: Michela Taufer, Patricia J. Teller, David P. Anderson, Charles L. Brooks,  III
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Global computing uses Internet-connected PCs volunteered by their owners. These PCs are diverse, volatile, and error-prone. Sophisticated scheduling methods commonly applied in Grid computing may not be sufficiently scalable and flexible for global computing environments. This paper shows that it is possible to classify global computing hosts based on simple metrics such as availability and reliability, and that it is efficient to assign tasks to such hosts accordingly. The proposed classification of workers is applied to P@H, a global computing project for protein structure prediction.
On unreliable computing systems when heavy-tails appear as a result of the recovery procedure
Authors: Pierre M. Fiorini, Robert Sheahan, Lester Lipsky
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

For some computing systems, failure is rare enough that it can be ignored. In other systems, failure is so common that how to handle it can have a significant impact on the performance of the system. There are many different recovery schemes for tasks, however, they can be classified into three broad categories: 1) Resume: when a task fails, it knows exactly where it stops and can continue at that point when allowed to resume (i.e., preemptive resume - prs); 2) Replace: when a task fails, then later when the processor continues, it begins with a brand new task (i.e., preemptive repeat different prd); and, 3) Restart: when a task fails it loses all work done to that point and must start anew upon continuing later (i.e., preemptive repeat identical - pri).In this paper, assuming a computing system is unreliable, we discuss how heavy-tail (hereafter referred to as power-tail - PT) distributions can appear in a job's task stream given the Restart recovery procedure. This is an important consideration since it is known that power-tails can lead to unstable systems [4], We then demonstrate how to obtain performance and dependablity measures for a class of computing systems comprised of P unreliable processors and a finite number of tasks N given the above recovery procedures.
Who are the Target Customers in Chinese Online Game Market?: Segmentation with a Two-Step Approach
Authors: Sang-Chul Lee, Jun-Yong Xiang, Lin-Bo Jing
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

To survive successfully in today's competitive online game markets, Chinese online game companies need to determine who the target customers are and what motivates them. However, previous research didn't focus on identification of critical variables for market segmentation in online game market. Additionally, the traditional clustering methodologies have not provided a unique clustering nor determined the precise number of clusters. The purpose of our research is to identify the critical variables and to develop a new methodology for market segmentation of online game market. Our research tested the model with 438 Chinese online game users.
Generic Modeling of Non-planar Dielectrics for 2 1/2D Parasitic Extraction
Authors: Nur Kurt-Karsilayan
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Generic modeling of non-planar dielectrics for 21/2D parasitic extraction is addressed. First, basic non-planar dielectric geometry types are defined. Then it is shown that modeling complex shapes can be simplified based on the overlapping rules for most field solvers. Finally, a novel algorithm based on the overlapping assumption is introduced and the accuracy impact of modeling non-planar dielectrics is shown based on a realistic technology. This approach is already productized and verified against various technologies along with a 2 1/2D extraction tool.
On the Effectiveness of Movement Prediction to Reduce Energy Consumption in Wireless Communication
Authors: Srijan Chakraborty Yu Dong, David K. Y. Yau, John C. S. Lui
Venue: IEEE Transactions on Mobile Computing (2006)

Node movement can be exploited to reduce the energy consumption of wireless network communication. The strategy consists in delaying communication until a mobile node moves close to its target peer node within an application-imposed deadline. We evaluate the performance of various heuristics that, based on the movement history of the mobile node, estimate an optimal time (in the sense of least energy use) of communication subject to the delay constraint. We evaluate the impact of the node movement model, length of movement history maintained, allowable delay, single hop versus multiple hop communication, and size of data transfer on the energy consumption. We also present measurement results on an iPAQ pocket PC that quantify energy consumption in executing the prediction algorithms. Our results show that, with relatively simple and, hence, efficient prediction heuristics, energy savings in communication can significantly outweigh the energy expenses in executing the prediction algorithms. Moreover, it is possible to achieve robust system performance across diverse node movement models.
A generalization of class field theory using motivic complexes
Authors: Stephen Lichtenbaum
Venue:  (2005)

In algebraic number theory, class field theory gives a description of the absolute Galois group of local and global fields; the cohomological aspect of the theory was clarified in the 1950's by Artin and Tate [2], through the notion of a class formation. In the 1980's, Lichtenbaum [21] postulated the existence of certain complexes, now called motivic complexes, which should give a framework in which to generalize the results of class field theory to a much broader class of fields. In this dissertation, we summarize what is known in this context of generalized class field theory, and prove some new results. More precisely, we examine the cases in which one can show that there is a complex that plays the role of a class formation. The first example was given by Koya [14], for a complete discrete valuation field, with residue field a local field. In [16], Koya also proved some partial results for the fraction field of a complete regular local ring with finite residue field. Using these results, we show that there is a complex that plays the role of a class formation for a complete discrete valuation field with residue field a global field of the same characteristic, at the level of the maximal unramified extension. It is expected that the complex we construct is in fact a hyper-class formation. For local and global fields; the cohomological theory can be encapsulated in an important object, called the Weil group, using the theory of group extensions. The Weil group of a local or global field has many important arithmetic applications outside of class field theory. We prove in the final chapter of this dissertation that a complex that plays the role of a class formation gives rise to a Weil group, in the classical sense. This somewhat surprising result is the main motivation for the search for such complexes.
A Sensory-Oriented Model for Monitoring Ubiquitous Environments
Authors: Soraya Kouadri Mostefaoui
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

In this paper we introduce our early work on a model dedicated for the monitoring of ubiquitous environments. The model can be used to attach an arbitrary number of sensors onto a wireless/wired network of modules, the modules are distributed over a network and can interact with each other. Each module represents a specialist and communicates with an arbitrary number of other specialists. The model facilitates the monitoring, querying and adjustment of such sensors, through a simple interface.
Reconstructing requirements coverage views from design and test using traceability recovery via LSI
Authors: Marco Lormans, Arie van Deursen
Venue: Proceedings of the 3rd international workshop on Traceability in emerging forms of software engineering (2005)

Requirements coverage views can help validate that all requirements are implemented in the system. This is not a trivial process. In this paper we present a method for generating requirements coverage views. To do this, information needs to be gathered from multiple sources in the development process. A traceability model defines the development work products and links that are required to generate the coverage views. Retrieving this information is done by using Latent Semantic Indexing (LSI). The method is applied in a lab study, Pacman, of which the preliminary results are also presented in this paper.
Improved watermark detection for spread-spectrum based watermarking using independent component analysis
Authors: Hafiz Malik, Ashfaq Khokhar, Rashid Ansari
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

This paper presents an efficient blind watermark detection/decoding scheme for spread spectrum (SS) based watermarking, exploiting the fact that in SS-based embedding schemes the embedded watermark and the host signal are mutually independent and obey non-Gaussian distribution. The proposed scheme employs the theory of independent component analysis (ICA) and posed the watermark detection as a blind source separation problem. The proposed ICA-based blind detection/decoding scheme has been simulated using real-world audio clips. The simulation results show that the ICA-based detector can detect and decode watermark with extremely low decoding bit error probability (less than 0.01) against common watermarking attacks and benchmark degradations.
Laterally resolved electrical characterisation of high-K oxides with non-contact atomic force microscopy
Authors: J. M. Sturm, A. I. Zinine, H. Wormeester, R. G. Bankras, J. Holleman, J. Schmitz, Bene Poelsema
Venue: Microelectronic Engineering (2005)

Fixed oxide charges in atomic layer deposited (ALD) Al2O3 on hydrogen-terminated Si were observed by ultra-high vacuum (UHV) non-contact AFM with a conductive tip. Comparison of bias-dependent images with a spherical tip model showed the importance of the tip image in the substrate for a quantitative understanding of the image contrast. The Contact Potential Difference and differential capacitance were probed by means of bias modulation and lock-in detection at the 1st and 2nd harmonic, respectively. A difference in topography-capacitance cross-correlation was found between Al2O3 deposited on hydrogen-terminated Si and thermal SiO2, which can be attributed to substrate-inhibited versus non-inhibited deposition.
Modeling and PerformanceAnalysis of the VEGA Grid System
Authors: Haijun Yang, Zhiwei Xu, Yuzhong Sun, Qinghua Zheng
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

In this paper, we propose four general queueing models based on input and server distributions, to analyze a special Grid system, VEGA grid system version 1.1 (VEGA1.1). The mean queue lengths and mean waiting times of these models are deduced. The two classic applications, the computing-oriented application (Blast computing) and online transaction processing application (air booking service) are employed to analyze and evaluate the grid system and the models. Meanwhile, we validate VEGA's four prominent characteristics, Versatile Services, Enabling Intelligence, Global Uniformity and Autonomous Control. Finally, we analyze the experiment results, predict the behavior of VEGA1.1 in equilibrium and point out the bottlenecks of the system.
Shallow Knowledge as an Aid to Deep Understanding in Early Phase Requirements Engineering
Authors: Pete Sawyer, Paul Rayson, Ken Cosh
Venue: IEEE Transactions on Software Engineering (2005)

Requirements engineering's continuing dependence on natural language description has made it the focus of several efforts to apply language engineering techniques. The raw textual material that forms an input to early phase requirements engineering and which informs the subsequent formulation of the requirements is inevitably uncontrolled and this makes its processing very hard. Nevertheless, sufficiently robust techniques do exist that can be used to aid the requirements engineer provided that the scope of what can be achieved is understood. In this paper, we show how combinations of lexical and shallow semantic analysis techniques developed from corpus linguistics can help human analysts acquire the deep understanding needed as the first step towards the synthesis of requirements.
Automatic Classification of Singing Voice Quality
Authors: Bozena Kostek, Pawel Zwan
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

In the paper problems related to the classification of singing voice quality are presented. For this purpose a database consisting of singers' sample recordings is constructed and parameters are extracted from recorded voice of trained and untrained singers. The parameterization process is based on both voice source and formant analysis of a singing voice. These parameters are explained as to their physical interpretation and analyzed statistically in order to diminish their number. The statistical analysis is based on the Fisher Statistic. In such a way a feature vector of a singing voice is formed. Decision systems based on neutral networks and rough sets are utilized in the context of the voice type and voice quality classification. Results obtained in the automatic classification performed by both decision systems are compared. A possibility to classify automatically type/quality of voice is judged. The methodology proposed provides means for discerning trained and untrained singers.
Guest Editors' Introduction: Aspect-Oriented Programming
Authors: Gail Murphy, Christa Schwanninger
Venue: IEEE Software (2006)

You can measure a software system's value by its modularity. The more modular the system, the easier it is to produce and extend. Aspect-oriented programming technologies aim to improve system modularity by modularizing crosscutting concerns. Global properties and programming and design issues can lead to crosscutting concerns--for example, error handling or transaction code, interacting features, and reliability and security. The guest editors introduce aspect-oriented programming and describe this special issue's articles, which explain the use of aspect-oriented programming to simplify enterprise and system software, the need to expand an interface's meaning in the presence of aspects, and the application of aspects to design and requirements activities.
Topological Properties of Necklace Networks
Authors: Pooya Shareghi, Hamid Sarbazi-Azad
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

We study a class of interconnection networks for multiprocessors, called the Necklace-G network that is based on the base graph G by attaching an array of processors to each two adjacent nodes of G. One of the interesting features of the proposed topology is its scalability while preserving most of the desirable properties of the underlying base network G. We conduct a general study on the topological properties of necklace networks. We first obtain their basic topological parameters, and then present optimal routing and broadcasting algorithms. We also present a unified approach to obtain the topological properties and the VLSI-layout of an arbitrary necklace network based on the properties of the corresponding base network G.
A New Approach for the Construction of ALM Trees using Layered Coding
Authors: Yohei Okada, Masato Oguro, Jiro Katto, Sakae Okubo
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This paper presents a novel approach for efficient tree construction in ALM (Application Layer Multicast) using layered video coding. This system is suitable for the users in heterogeneous environment such as xDSL and CATV, where upload and download speeds are different. We point out some problems in these environment of the ALM and show their solutions at two stages. First, we redefine the "degree parameter" which originally specifies the number of single rate streams the host can transmit, to reflect asymmetric link properties and to accommodate layered streams. Second, we develop an efficient tree construction algorithm using the renewed degree parameter, which maximizes total throughput of all hosts. Simulations using NS-2 prove improvement in throughput, delay and overhead by our proposal. Software implementation is also carried out, and subjective quality improvement is verified.
Structured simulation programming
Authors: Jacob Palme
Venue: ACM SIGSIM Simulation Digest (1977)

If you wish to make a successful simulation program, you must tackle the problem of helping the customer to understand the model so that he can give constructive criticism and rely on the results as a basis for decision making. Another problem arises when the customer wants to extend the program to many times its original size.
A Semantics-Based Routing Scheme for Grid Resource Discovery
Authors: Juan Li, Son Vuong
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Grid technologies enable the sharing of a wide variety of distributed resources. To fully utilize these resources, effective resource discovery mechanisms are necessities. However, the complicated and dynamic characteristics of grid resources make sharing and discovering them a challenging issue. In this paper, we propose a peer-to-peer (P2P) based overlay network to assist the efficient resource discovery and query. The framework is based on the RDF metadata infrastructure, allowing a rich and extensible description of resources. To avoid flooding the network with a query, we propose a comprehensive semantics-based query forwarding strategy, which only forwards queries to semantically related nodes. After the related nodes have been located, the original RDF query is used to do the final query and retrieval. Results from simulation experiments demonstrate that this architecture is scalable and efficient.
An analysis of island models in evolutionary computation
Authors: Zbigniew Skolicki
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

A need for solving more and more complex problems drives the Evolutionary Computation community towards advanced models of Evolutionary Algorithms. One such model is the island model which, although the subject of a variety of studies, still needs additional fundamental research. In my Ph.D. thesis I am aiming at studying the behavior of island models with regard to the amount of cooperation between islands, the level of heterogeneity and the difficulty of the problem being solved. This paper presents the main ideas and gathers preliminary results.
Analysis of computing skills and differences between demographic groups: a basis for curriculum development in computer technology courses at unc wilmington
Authors: Jeremy Dickerson
Venue:  (2005)

This study examined the entry-level computing skills of undergraduate education majors at the University of North Carolina at Wilmington during the Spring 2005 semester. This study also compared groups based on demographic categories to investigate if certain demographics were predictors of specific skills competency. This study utilized a representative convenience sample of 186 participants. The participants were pre-tested for their ability to complete 60 computer skills in the Microsoft Office Suite using an online performance test called Skills Assessment Manager by Thomson Course Technology. The data was analyzed as a whole group performance using descriptive statistics and analyzed for analysis between demographic groups using a non-parametric statistic test (the Mann Whitney U Test). The results yielded data that informed the researcher of the skills of the participants prior to taking a mandatory computer skills course. As a result, it was found that a large portion of students were able to do many of the skills before taking the mandatory skills course. It was also found that demographics were not a reliable predictor of computer skills. This study provided data that helped to inform the faculty at UNC-W that the curriculum for the computer skills course needed to be changed based on entry skills of students to reflect the abilities of students in 2005.
Review of "Comprehensive Management of Phosphorus Water Pollution, by Donald B. Porcella and A. Bruce Bishop", Ann Arbor Science Publishers, 1975
Venue: ACM SIGSIM Simulation Digest (1976)

This volume presents a well-done studied approach to comprehensive environmental managment of phosphorus water pollution and its correspondent eutrophication. The volume is a multidisciplinary approach to the subject and this is reflected in the high level of the presentation of the material in the various chapters. 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