ppxscal/embedding_network huggingface dataset:
An automated knowledge structure construction approach: Applying information retrieval and genetic algorithm to journal of Expert Systems with Applications
Authors: Deng-Yiv Chiu, Ya-Chen Pan, Shih-Yi Yu
Venue: Expert Systems with Applications: An International Journal (2009)

In this study, information retrieval and genetic algorithm are integrated to propose a new knowledge structure construction method and this method is further applied to the papers published on the journal of Expert Systems with Applications (ESWA). The purpose of this method is to explore the major topics as well as the related techniques and methods of the papers published in various periods of time and help understand the research tendencies among these published papers. We use vector space model to present the published papers and feature and adopt chi-square test to examine the independence of topics. Then we apply genetic algorithm to facilitate automatic topic selections used to construct the knowledge structures for the journal in study. We select ESWA as the source of samples mainly because the papers published on this journal feature an extensive use of methods and techniques and have been widely applied in many domains. Moreover, it is also a SCI listed journal. In recent years, more and more outstanding scholars have published their papers on this journal, so citation of the papers on this journal by other papers is frequent. It can be viewed as an internationally prominent journal. In our experiment, knowledge structures are constructed and analyzed. The representativeness of the selected topics and whether published papers have been classified into appropriate topics are also evaluated. From the experimental results, we discover that the constructed knowledge structures could not only effectively present representative topics, related techniques and issues, but also help understand the research tendencies.
Predictive inference for singular multivariate elliptically contoured distributions
Authors: Jin Shan Liu, Wai Cheung Ip, Heung Wong
Venue: Journal of Multivariate Analysis (2009)

We have derived the predictive distributions of future responses and the regression matrix in the multivariate linear regression model, under the singular or nonsingular matrix variate elliptically contoured distribution with noninformative prior, with respect to the Hausdorff measure. The predictive distributions are also derived under the singular or nonsingular matrix variate normal distribution with normal-inverse Wishart conjugate prior as a particular case of the matrix elliptically contoured distribution. The predictive distributions are singular or nonsingular matrix-T distributions introduced by Diaz-Garcia and Gutierrez-Jaimez [J.A. Diaz-Garcia, R. Gutierrez-Jaimez, Distribution of the generalized inverse of a random matrix and its applications, J. Statist. Plann. Inference 136 (2006) 183-192], both in the noninformative and conjugate prior cases. The first result gives inference robustness with respect to departures from the underlying distribution assumption in the direction of elliptically contoured distributions, even in the singularly distributed case.
A New Replica Placement Algorithm for Improving the Performance in CDNs
Authors: Lei Zhang, Hui Tian, Stephan Steglich
Venue: International Journal of Distributed Sensor Networks (2009)

With the advent of services and applications over the Internet, speed and reliability have become critical issues for clients, and the Internet currently is not well suited for the purpose of the emerging new service delivery contemplated by today's applications. In response to these challenges, commercial Content Distribution Network (CDN) deploys a set of proxy servers called replicas and improves the content delivery performance by replicating the content to multiple replicas in the Internet. These issues motivate us to do research in how to efficiently place replicas in the network, and then propose a cost-based replica placement algorithm which selects replica locations using a greedy fashion iteratively. We evaluated that it can yield close to optimal performance at low management and computation cost among several replica placement strategies. The key contributions of this paper are threefold: A practical cost function from the game theoretic perspective is designed, and is limited by various parameters and constraints. It can minimize either its clients' latency or its total bandwidth consumption. A cost-based replica placement integrating a greedy algorithm is proposed, which can provide CDNs with the performance close to optimal. The performance of the diversified replica placement algorithms is evaluated by simulating their behavior on synthetic and real network topologies. To the best of our knowledge, there are few studies on this subject. In summary, we study the online problem of placing web replicas in CDNs to minimize the cost for clients to access data replicated from the original web servers. The novel cost-based replica placement is designed combining with the minimum k-median heuristic greedy algorithm. We evaluate the performance of the different replica placement algorithms by simulating their behavior on both synthetic and real network topologies. Based upon simulation results, we conclude that our cost-based greedy algorithm for web server replica placement can provide CDNs with performance that is close to optimal. Although the greedy algorithm depends upon estimation, we find it is a viable and practical algorithm to use in the general Internet environment. As for future work, we are interested in exploring incremental versions of the placement algorithms that also take into account the cost of changing the set of replica sites. Ideally, for placement strategies with similar performance, we prefer the one that incurs the least amount of perturbation to the system.
Implications of changes in the secondary school: mathematics curriculum for the computer science and computer engineering curricula
Authors: M. E. Sloan
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Many professors of computer science and computer engineering are relatively unaware of the changes in the secondary mathematics curriculum in the last decade. The changes in mathematics have major implications for the design of computer science and computer engineering curricula in the colleges and universities. The thesis of this paper is that changes can be made in computer science courses to accommodate the changes in mathematics prerequisites and will result in strengthening the undergraduate program and allowing more time for advanced computer science topics.
CPM and Balanced Scorecard with SAP, 1st edition
Authors: Dr. Marco Sisfontes-Monge
Venue:  (2007)

This book is your guide to understanding how SAP CPM and the Balanced Scorecard work together to effectively monitor corporate performance. Get a quick and practical overview of how you can make SAP CPM and the Balanced Scorecard work for you and gain insight into how you can translate strategy into action by using them together. Learn about the Management Cockpit and understand how you can use measures to calibrate your company's performance. Whether you are a project manager or a consultant, this book will show you how to navigate through the various CPM screens. Readers learn how CPM interacts with other SAP modules. By reading this book you'll be able to build your first scorecard and create Management Cockpits quickly and efficiently. Whether you have already implemented CPM or are considering doing so, this book will prove itself to be an invaluable resource for your organization. Highlights Include: Measure Builder Management Cockpit Strategy Management Performance Measurement Value Driver Tree Sarbanes-Oxley Requirements Risk Management Key Performance Indicators CPM Variables SAP BW 3.5 SEM 6.0
Towards a Scholarly Editing System for the Next Decades
Authors: Peter Robinson
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

As almost all texts of interest to scholarly editors exist in multiple versions, efficient systems of collation are crucial. The first part of the paper explains desiderata for computer-based collation. The second part of the paper argues that the most radical impact of the digital revolution is to transform scholarly editing from the work of single scholars, working on their own on single editions, to a collaborative, dynamic and fluid enterprise spanning many scholars and many materials.
A reconfigurable stochastic architecture for highly reliable computing
Authors: Xin Li, Weikang Qian, Marc D. Riedel, Kia Bazargan, David J. Lilja
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Mounting concerns over variability, defects and noise motivate a new approach for integrated circuits: the design of stochastic logic, that is to say, digital circuitry that operates on probabilistic signals, and so can cope with errors and uncertainty. Techniques for probabilistic analysis are well established. We advocate a strategy for synthesis. In this paper, we present a reconfigurable architecture that implements the computation of arbitrary continuous functions with stochastic logic. We analyze the sources of error: approximation, quantization, and random fluctuations. We demonstrate the effectiveness of our method on a collection of benchmarks for image processing. Synthesis trials show that our stochastic architecture requires less area than conventional hardware implementations. It achieves a large speed up compared to software conventional implementations. Most importantly, it is much more tolerant of soft errors (bit flips) than these deterministic implementations.
On the impact of playout scheduling on the performance of peer-to-peer live streaming
Authors: Constantinos Vassilakis, Nikolaos Laoutaris, Ioannis Stavrakakis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

In this paper we examine the impact of the adopted playout policy on the performance of P2P live streaming systems. We argue and demonstrate experimentally that (popular) playout policies which permit the divergence of the playout points of different nodes can deteriorate drastically the performance of P2P live streaming. Consequently, we argue in favor of keeping different playout points ''near-in-time'', even if this requires sacrificing (dropping) some late frames that could otherwise be rendered (assuming no strict bidirectional interactivity requirements are in place). Such nearly synchronized playout policies create ''positive correlation'' with respect to the available frames at different playout buffers. Therefore, they increase the number of upstream relay nodes from which a node can pull frames and thus boost the playout quality of both single-parent (tree) and multiple-parent (mesh) systems. On the contrary, diverging playout points reduce the number of upstream parents that can offer a gapless relay of the stream. This is clearly undesirable and should be avoided as it contradicts the fundamental philosophy of P2P systems which is to supplement an original service point with as many additional ones presented by the very own users of the service.
A Pure Nash Equilibrium-Based Game Theoretical Method for Data Replication across Multiple Servers
Authors: Samee Ullah Khan, Ishfaq Ahmad
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

This paper proposes a non-cooperative game based technique to replicate data objects across a distributed system of multiple servers in order to reduce user perceived Web access delays. In the proposed technique computational agents represent servers and compete with each other to optimize the performance of their servers. The optimality of a non-cooperative game is typically described by Nash equilibrium, which is based on spontaneous and non-deterministic strategies. However, Nash equilibrium may or may not guarantee system-wide performance. Furthermore, there can be multiple Nash equilibria, making it difficult to decide which one is the best. In contrast, the proposed technique uses the notion of pure Nash equilibrium, which if achieved, guarantees stable optimal performance. In the proposed technique, agents use deterministic strategies that work in conjunction with their self-interested nature but ensure system-wide performance enhancement. In general, the existence of a pure Nash equilibrium is hard to achieve, but we prove the existence of such equilibrium in the proposed technique. The proposed technique is also experimentally compared against some well-known conventional replica allocation methods, such as branch and bound, greedy, and genetic algorithms.
An exploration of social requirements for exercise group formation
Authors: Mike Wu, Abhishek Ranjan, Khai N. Truong
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Exercising is often a social activity performed with other people, yet finding compatible exercise partners is difficult in practice. To gain a better understanding of the social requirements involved with forming exercise groups, we conducted a two-phased exploratory study involving an online web questionnaire with 96 respondents and two focus groups. Our results highlight various aspects of collaborating with exercise partners, but also indicate the limited utility of currently available systems to support such collaborations. We discuss implications for collaborative technologies supporting exercise group formation.
Local Contrast Segmentation to Binarize Images
Authors: Marco Block, Raúl Rojas
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper, a new binarization algorithm for degraded document images is proposed. The method is based on positive and negative pixel energies using the Laplacian ofan image. After a filtering step and morphological perationsour local contrast segmentation method is able to detectingconnected components. The given approach is applied to casesof sophisticated, challenging documents and other application scenarios like whiteboard and chalk images.
Vehicle Detection Based on Adaptive Background
Authors: Bao-xia Cui, Shang-min Sun, Yong Duan
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In order to improve the accuracy of vehicle detection, and to solve the gradually changing brightness of light in the background and the movement of the objects in the background, this paper presents an algorithm that fast adapts to the background generation and updating. Focus on the objects with similar gray background, and moving object missing caused easily by segmentation, the threshold segmentation and edge sharpening--the combination of methods is used here, to strengthen the edge of moving objects. The experimental result shows that: the algorithm can adapt to changes in the background, compensate the missing moving objects after segmentation, which has high robustness and excellent real-time performance.
Exploiting the power of relational databases for efficient stream processing
Authors: Erietta Liarou, Romulo Goncalves, Stratos Idreos
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a different philosophy than nowadays database engines in order to cope with the stream applications requirements. However, this means that they lack the power and sophisticated techniques of a full fledged database system that exploits techniques and algorithms accumulated over many years of database research. In this paper, we take the opposite route and design a stream engine directly on top of a database kernel. Incoming tuples are directly stored upon arrival in a new kind of system tables, called baskets. A continuous query can then be evaluated over its relevant baskets as a typical one-time query exploiting the power of the relational engine. Once a tuple has been seen by all relevant queries/operators, it is dropped from its basket. A basket can be the input to a single or multiple similar query plans. Furthermore, a query plan can be split into multiple parts each one with its own input/output baskets allowing for flexible load sharing query scheduling. Contrary to traditional stream engines, that process one tuple at a time, this model allows batch processing of tuples, e.g., query a basket only after x tuples arrive or after a time threshold has passed. Furthermore, we are not restricted to process tuples in the order they arrive. Instead, we can selectively pick tuples from a basket based on the query requirements exploiting a novel query component, the basket expressions. We investigate the opportunities and challenges that arise with such a direction and we show that it carries significant advantages. We propose a complete architecture, the DataCell, which we implemented on top of an open-source column-oriented DBMS. A detailed analysis and experimental evaluation of the core algorithms using both micro benchmarks and the standard Linear Road benchmark demonstrate the potential of this new approach.
A Novel Location Management Scheme for Wireless Mesh Networks
Authors: Weiqi Hu, Shihong Zou, Shiduan Cheng
Venue: International Journal of Distributed Sensor Networks (2009)

Conventional location management schemes are not designed for Wireless mesh networks and result in considerable signaling cost if used directly in the circumstance. In this paper, a Cluster-based location management scheme is introduced, which takes adequately into account the characteristic of the mesh structure. Numerical result reveals that the proposed scheme enables to significantly lessen the signaling cost.
A middleware for context-aware agents in ubiquitous computing environments
Authors: Anand Ranganathan, Roy H. Campbell
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

Ubiquitous Computing advocates the construction of massively distributed systems that help transform physical spaces into computationally active and intelligent environments. The design of systems and applications in these environments needs to take account of heterogeneous devices, mobile users and rapidly changing contexts. Most importantly, agents in ubiquitous and mobile environments need to be context-aware so that they can adapt themselves to different situations. In this paper, we argue that ubiquitous computing environments must provide middleware support for context-awareness. We also propose a middleware that facilitates the development of context-aware agents. The middleware allows agents to acquire contextual information easily, reason about it using different logics and then adapt themselves to changing contexts. Another key issue in these environments is allowing autonomous, heterogeneous agents to have a common semantic understanding of contextual information. Our middleware tackles this problem by using ontologies to define different types of contextual information. This middleware is part of Gaia, our infrastructure for enabling Smart Spaces.
Simulations-based and solver-based optimization approaches for batch processes in semiconductor manufacturing
Authors: Andreas Klemmt, Sven Horn, Gerald Weigert, Thomas Hielscher
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Scheduling is one of the key factors for semiconductor fabrication productivity. Objectives like lot cycle time and throughput must be optimized to push the technological development and secure the existence on the rapid growing global market. But especially in the frontend the manufacturing process is dominated by cluster-tools and reentrance flows which makes a production planning and optimization very hard. The workflow here is mostly controlled only by dispatch rules. To get a further improvement in manufacturing planning strategies, there is an increasing request of exact or simulation-based solution methods for specified work centers or bottleneck machine groups. One example of this is the semiconductor oven process. Here, complex batch processes with a lot of restrictions have to be scheduled. A reduction of cycle time in this section by optimized manufacturing strategies has a great influence on all global optimization objectives. Two approaches are investigated in this paper.
Comparison of website content measurement of selected Mongolian institutions
Authors: Ganbat Tsend
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The development and implementation of e-Mongolia National Program requires government organizations to deliver information and services to individuals and businesses through several channels. Some of these channels include the use of Internet technologies. Among them, website is one of the most important. The aim of this study is to assess the content of Mongolian websites and make a comparison across different sectors, including government, banks, universities, etc. The assessment considers the type, amount and scope of content published in websites.
Extension problems with degree bounds
Authors: Tomas Feder Pavol Hell, Jing Huang
Venue: Discrete Applied Mathematics (2009)

We have proved in an earlier paper that the complexity of the list homomorphism problem, to a fixed graph H, does not change when the input graphs are restricted to have bounded degrees (except in the trivial case when the bound is two). By way of contrast, we show in this paper that the extension problem, again to a fixed graph H, can, in some cases, become easier for graphs with bounded degrees.
Texture displays: a passive approach to tactile presentation
Authors: Chris Harrison, Scott E. Hudson
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper, we consider a passive approach to tactile presentation based on changing the surface textures of objects that might naturally be handled by a user. This may allow devices and other objects to convey small amounts of information in very unobtrusive ways and with little attention demand. This paper considers several possible uses for this style of display and explores implementation issues. We conclude with results from our user study, which indicate that users can detect upwards of four textural states accurately with even simple materials.
Classification of slice-based VBR video traffic and estimation of link loss by exceedance
Authors: Natalia M. Markovich, Astrid Undheim, Peder J. Emstad
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Classification of a video stream is an essential preliminary step to estimate the bit loss when the video stream is transmitted over a communication network. In this paper, we classify the video frames by the average frame size and estimate the bit loss for each class when the bitrate exceeds the capacity of the bottleneck link. The video stream under study is encoded using the explicit slice-based H.264/AVC encoding scheme. This scheme reduces the burstiness of regular H.264/AVC encoded video by removing the traditional GOP structure. Instead, a repetitive combination of intracoded and predicted slices is employed, thereby introducing a specific dependence structure in the video data. We consider a bufferless model of the communication system and evaluate the channel capacity required to give a maximum allowed loss rate for each class. Due to the high variability, non-stationarity and non-homogeneity of the underlying video data, the obtained classes are checked regarding the dependence and distribution structure of the data. The high quantiles of the losses are estimated for each class.