ppxscal/embedding_network huggingface dataset:
Towards Autonomic Service Control in Next Generation Networks
Authors: Andreas Klenk, Michael Kleis, Benoit Radier, Sanaa Elmoumouhi, Georg Carle, Mikael Salaun
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

Current standardization efforts aim towards a unifying platform for fixed and mobile telecommunication services. The IP multimedia subsystem is advocated as the candidate for building next generation networks (NGNs). However the direction taken in standardization is towards a rather static architecture with centralized features. The downside is an expected increase in service management complexity and the need for highly specialized infrastructures. This paper presents an approach for improving service quality, scalability and reliability while facilitating service management towards self-managing next generation networks. To approach this we utilize and combine functionality available in the network using a Peer-to-Peer based service composition mechanism. The construction of composed services is based on a service chain principle and incorporates information about available services, QoS and applicable SLAs.
Applying Pricing Engineering for Electronic Financial Markets
Authors: Peter Gomber, Marco Lutat
Venue: Electronic Markets (2007)

Due to the demutualization of exchanges, the business case of operating an electronic financial market has become even more important. Specifically, it is vital to design pricing incentives for the provision of order flow and thereby to assure market liquidity. The paper will introduce the concept of pricing engineering for electronic financial markets. Based on an analysis of environmental factors and the objectives of the market operator, a focus will be laid on the implementation of fee structures that include liquidity incentives. The concepts were implemented in the context of a new electronic market, the Dubai International Financial Exchange (DIFX). The project will be described as a case study for the practical realization of the pricing engineering approach.
Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure
Authors: Timothy C. Matisziw, Alan T. Murray
Venue: Computers and Operations Research (2009)

The maintenance of system flow is critical for effective network operation. Any type of disruption to network facilities (arcs/nodes) potentially risks loss of service, leaving users without access to important resources. It is therefore an important goal of planners to assess infrastructures for vulnerabilities, identifying those vital nodes/arcs whose debilitation would compromise the most source-sink (s-t) interaction or system flow. Due to the budgetary limitations of disaster management agencies, protection/fortification and planning for the recovery of these vital infrastructure facilities is a logical and efficient proactive approach to reducing worst-case risk of service disruption. Given damage to a network, evaluating the potential for flow between s-t pairs requires assessing the availability of an operational s-t path. Recent models proposed for identifying infrastructure vital to system flow have relied on enumeration of all s-t paths to support this task. This paper proposes an alternative model constraint structure that does not require complete enumeration of s-t paths, providing computational benefits over existing models. To illustrate the model, an application to a practical infrastructure planning problem is presented.
Interdisciplinary approaches to revitalizing undergraduate computing education
Authors: Jesse M. Heines, Kenneth J. Goldman, Jim Jeffers, Edward A. Fox, Robert Beck
Venue: Journal of Computing Sciences in Colleges (2008)

"Through the CISE Pathways to Revitalized Undergraduate Computing Education (CPATH) program, NSF's Directorate for Computer and Information Science and Engineering (CISE) is challenging its partners - colleges, universities and other stakeholders committed to advancing the field of computing and its impact - to transform undergraduate computing education on a national scale, to meet the challenges and opportunities of a world where computing is essential to U.S. leadership and economic competitiveness across all sectors of society." [4] One approach to such revitalization is the introduction of interdisciplinary courses to expand the scope of computing education. This approach has its roots in programs such as Lynn Stein's "small footprint" core [2] and Georgia Tech's "threads" [3]. The basic idea is to have students from various disciplines work together on computing projects to expand their educational horizons and make computing courses more appealing. This panel brings together educators who have developed and taught interdisciplinary courses with these goals in mind. The panelists will share their experiences and solicit new ideas from the audience. We expect a lively discussion on the pros and cons of this approach.
Functional sampling density design for particle filters
Authors: Miroslav Šimandl, Ondřej Straka
Venue: Signal Processing (2008)

Sampling density design for particle filters is treated. A new functional approach is proposed and discussed. The approach follows the idea of the auxiliary particle filter which introduces the concept of primary weights into sampling density design. In contrast to the auxiliary particle filter approach, which utilizes the primary weights given by a measurement probability density and a predictive point estimate, the functional approach is based on comparison of the measurement and predictive probability density functions through a suitable metric. Different choices of the metric and weight function are discussed and used for the comparison. The particle filter with the sampling density given by the functional approach provides estimates that are closer to exact filtering probability density function in terms of point estimates.
Cluster computing for web-scale data processing
Authors: Aaron Kimball, Sierra Michels-Slettvet, Christophe Bisciglia
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

In this paper we present the design of a modern course in cluster computing and large-scale data processing. The defining differences between this and previously published designs are its focus on processing very large data sets and its use of Hadoop, an open source Java-based implementation of MapReduce and the Google File System as the platform for programming exercises. Hadoop proved to be a key element for successfully implementing structured lab activities and independent design projects. Through this course, offered at the University of Washington in 2007, we imparted new skills on our students, improving their ability to design systems capable of solving web-scale problems.
Predictable Design of Network-Based Covert Communication Systems
Authors: Ronald William Smith, George Scott Knight
Venue: Proceedings of the 2008 IEEE Symposium on Security and Privacy (2008)

This paper presents a predictable and quantifiable approach to designing a covert communication system capable of effectively exploiting covert channels found in the various layers of network protocols. Two metrics are developed that characterize the overall system. A measure of probability of detection is derived using statistical inference techniques. A measure of reliability is developed as the bit error rate of the combined noisy channel and an appropriate error-correcting code. To support reliable communication, a family of error-correcting codes are developed that handle the high symbol insertion rates found in these covert channels. The system metrics are each shown to be a function of the covert channel signal-to-noise ratio, and as such the two can be used to perform system level design trade-offs. Validation of the system design methodology is provided by means of an experiment using real network traffic data.
Generating 3D multiview exact polyhedron representation by scanning faces surroundings
Authors: Wojciech S. Mokrzycki, Andrzej Salamonczyk
Venue: Machine Graphics Vision International Journal (2006)

This article presents 3D multiview exact models that are complete representations of a polyhedron obtained by the means of the faces surroundings scanning algorithm. The algorithm uses the viewing sphere and the perspective projection concepts (known as the K-M view space model). Such models will be used for visual identification based on them and a scene depth map. We develop the concept and give an algorithm for face-dependent generation of 3D exact views polyhedron representation.
Internet Observation with ISDAS: How Long Does a Worm Perform Scanning?
Authors: Tomohiro Kobori, Hiroaki Kikuchi, Masato Terada
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

We study an estimation of average duration of malicious port-scanning attempts, which would help for an analysis the statistical survey of malicious behaviors and an application to estimate activity of worms spread. This paper reports an average duration of worm activity estimated from random sampling of statistical data actually observed by the Internet Scan Data System, ISDAS.
Computing Phylogenetic Diversity for Split Systems
Authors: Andreas Spillner, Binh T. Nguyen, Vincent Moulton
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

In conservation biology it is a central problem to measure, predict, and preserve biodiversity as species face extinction. In 1992 Faith proposed measuring the diversity of a collection of species in terms of their relationships on a phylogenetic tree, and to use this information to identify collections of species with high diversity. Here we are interested in some variants of the resulting optimization problem that arise when considering species whose evolution is better represented by a network rather than a tree. More specifically, we consider the problem of computing phylogenetic diversity relative to a split system on a collection of species of size $n$. We show that for general split systems this problem is NP-hard. In addition we provide some efficient algorithms for some special classes of split systems, in particular presenting an optimal $O(n)$ time algorithm for phylogenetic trees and an $O(n\log n + n k)$ time algorithm for choosing an optimal subset of size $k$ relative to a circular split system.
Online Dispute Resolution: Some Implications for the Emergence of Law in Cyberspace
Authors: Ethan Katsh
Venue: International Review of Law, Computers and Technology (2007)

While courts and legislatures have been struggling to design legal rules that have authority in cyberspace, there have been a range of successful efforts in Online Dispute Resolution (ODR). Online dispute resolution uses the communication of information and the processing of information to negotiate, mediate and arbitrate online. These systems are important not only for resolving conflicts but for fostering environments in which agreed upon rules and standards can emerge. The article discusses the impact of ODR on how law will evolve in cyberspace and in how ODR technology can be employed in offline disputes.
A classical and Bayesian estimation of a k-components load-sharing parallel system
Authors: Bhupendra Singh, K. K. Sharma, Anuj Kumar
Venue: Computational Statistics Data Analysis (2008)

The present study proposes the classical and Bayesian treatment to the estimation problem of parameters of a k-components load-sharing parallel system in which some of the components follow a constant failure-rate and the remaining follow a linearly increasing failure-rate. In the classical setup, the maximum likelihood estimates of the load-share parameters with their variances are obtained. (1-@c)100% individual, simultaneous, Bonferroni simultaneous and two bootstrap confidence intervals for the parameters have been constructed. Further, on recognizing the fact that life testing experiments are very time consuming, the parameters involved in the failure time distributions of the system are expected to follow some random variations. Therefore, Bayes estimates along with their posterior variances of the parameters are obtained by assuming gamma and Jeffrey's invariant priors. Markov Chain Monte Carlo techniques such as a Gibbs sampler have also been used to obtain the Bayes estimates and highest posterior density credible intervals when all the parameters follow gamma priors.
Macroeconomics based Grid resource allocation
Authors: Peijie Huang, Hong Peng, Piyuan Lin, Xuezhen Li
Venue: Future Generation Computer Systems (2008)

Resource allocation is the key technology in Grid computing. While most of the existing literature of economics-based Grid resource allocation relies on the basic microeconomic principle, which concerns the behavior of individual agents in the Grid, this paper provides a novel approach based on macroeconomics, which concerns large aggregate behavior instead of individual actions. First, we propose a macroeconomics-based market framework that is well suited for a service-oriented Grid. Then, some macroeconomics-based resource allocation strategies, which can effectively improve the performance of the whole Grid market, are given. Simulation results prove good performance of the proposed method.
Robot Odor Localization: A Taxonomy and Survey
Authors: Gideon Kowadlo, R. Andrew Russell
Venue: International Journal of Robotics Research (2008)

Robotic odor localization has become a prominent research area in recent years. It promises many valuable practical applications, and contributes to the knowledge of biological odor localization, which has in many cases been the source of inspiration. There have been a diversity of approaches, implemented in both simulated and practical experiments, with a wide variety of platforms, and in a number of environments. This article presents a survey of the existing methods, which have been organized into taxonomic classifications. This provides a framework in which to evaluate the methods, view how they relate to each other, and make qualitative comparisons. The methods are grouped at the highest level by environmental conditions, and then by the localization method which in most cases is closely associated with the type of sensors used.
Mobile User Profile Acquisition through Network Observables and Explicit User Queries
Authors: Nilton Bila, Jin Cao, Robert Dinoff, Tin Kam Ho, Richard Hull, Bharat Kumar, Paulo Santos
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

This paper describes a novel approach for gathering profile information about mobile phone users. The focus is on information that can be used to enhance targeting of advertisements. (The ads might be delivered into the mobile phones, or to other devices such as the user's IPTV.) Unlike previous approaches, we use a two-tiered approach for learning end-user habits and preferences. In this approach the first tier involves statistical learning from network observable data (in the current paper, primarily logs of cell towers visited), and the second tier involve sexplicit queries to the user (in the current paper, to ask, e.g., what kinds of activities the user does in a given region that he frequents). The user might be willing to answer occasional queries of this sort through offers of service discounts, or to be able to receive more relevant ads. The paper focuses on two key aspects of our approach, which correspond to how the two tiers are instantiated in the current version of the prototype system that we have developed at Bell Labs. The first concerns the statistical techniques used to determine information about regions visited, along with the frequency of visits, typical durations, and typical visit times. These techniques were developed based on a training set consisting of logs of 6 users with mobile devices over aperiod of several months. The techniques address issues that arise when a given small region is serviced by multiple cell towers (in which case oscillations between cell towers can be confused with movement between regions). The second key aspect concerns optimizing the order in which queries are presented tousers, in a context where different query answers have different valuefor the advertising process. (The values of answers might be influenced by the mix of advertising campaigns from which ads are to be matched against users.) Optimization is NP-complete in a relatively general context. We develop a polynomial time algorithm which yields optimal sequences for the case where the family of queries to be asked satisfies a tree-based property. This is extended to create a heuristic polynomial time algorithm for the general case.
Design and implementation trade-offs for wide-area resource discovery
Authors: Jeannie Albrecht, David Oppenheimer, Amin Vahdat, David A. Patterson
Venue: ACM Transactions on Internet Technology (TOIT) (2008)

We describe the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems. In contrast to previous systems, SWORD allows users to describe desired resources as a topology of interconnected groups with required intragroup, intergroup, and per-node characteristics, along with the utility that the application derives from specified ranges of metric values. This design gives users the flexibility to find geographically distributed resources for applications that are sensitive to both node and network characteristics, and allows the system to rank acceptable configurations based on their quality for that application. Rather than evaluating a single implementation of SWORD, we explore a variety of architectural designs that deliver the required functionality in a scalable and highly available manner. We discuss the trade-offs of using a centralized architecture as compared to a fully decentralized design to perform wide-area resource discovery. To summarize our results, we found that a centralized architecture based on 4-node server cluster sites at network-peering facilities outperforms a decentralized DHT-based resource discovery infrastructure with respect to query latency for all but the smallest number of sites. However, although a centralized architecture shows significant promise in stable environments, we find that our decentralized implementation has acceptable performance and also benefits from the DHT's self-healing properties in more volatile environments. We evaluate the advantages and disadvantages of centralized and distributed resource discovery architectures on 1000 hosts in emulation and on approximately 200 PlanetLab nodes spread across the Internet.
3-D stacked CMOS inverters using Pt/HfO2 on Si substrate for vertical integrated CMOS applications
Authors: Soon-Young Oh, Chang-Geun Ahn, Jong-Heon Yang, Won-Ju Cho, Moon-Gyu Jang
Venue: Microelectronic Engineering (2008)

Three-dimensionally stacked CMOS inverters were fabricated by using the poly-Si thin film transistor (TFT) with hafnium-oxide (HfO"2) gate dielectric and Pt gate electrode. For fabrication of 3-D stacked CMOS inverters consist of poly-Si NMOS/interlayer dielectric film (ILD)/poly-Si PMOS, a reduced process temperature is necessary to avoid the degradation of NMOS at lower poly-Si layer fabricated prior to PMOS at upper poly-Si layer. The high quality of laser crystallized poly-Si film was obtained with smooth surface and excellent crystallinity. The 3-D stacked CMOS inverters fabricated by stacking the poly-Si NMOS TFT and PMOS TFT showed good output characteristics, DC voltage transfer characteristics, transient characteristics and voltage gain for applications of the vertical integrated CMOS circuits.
The effects of information technology on knowledge management systems
Authors: Shu-Mei Tseng
Venue: Expert Systems with Applications: An International Journal (2008)

Due to the rapid development of knowledge and information technology (IT), business environments have become much more complicated. In order to cope with ensuing complications, enterprises ought to incessantly innovate; otherwise, it will be very difficult for them to survive in the marketplace. Hence, many enterprises have applied IT in order to cut production costs, introduce innovations in products and services, promote growth, develop alliances, lock in customers and suppliers, and create switching costs and raise barriers to entry. In other words, IT can help a firm aiming to gain a competitive advantage. In addition, many studies have argued that business value comes mainly from intangible assets, such as knowledge. Thus, knowledge workers will be able to replace clerical workers as the new mainstream of manpower resources, a field in which the development of IT is the major force for change in knowledge management system (KMS). Therefore, based on the definition of the five gaps in KMS, this study explores the role and effect of IT in the implementation of KMS on firms; moreover, relationships between KMS and IT are analyzed and demonstrated by means of the literature reviews, expert interviews and questionnaire analyses. Furthermore, this study discusses how to enhance the effectiveness and efficiency of implementing KMS through appropriate IT.
Performance Evaluation and Fusion of Methods for Early Detection of Alzheimer Disease
Authors: Brahim Hamadicharef, Cuntai Guan, Emmanuel Ifeachor, Nigel Hudson, Sunil Wimalaratna
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The number of people that develop Alzheimer’s Disease (AD) is rapidly rising, while the initial diagnosis and care of AD patients typically falls on non-specialist and still taking up to 3-5 years before being referred to specialists. An urgent need thus exists to develop methods to extract accurate and robust biomarkers from low-cost and non intrusive modalities such as electroencephalograms (EEGs). Contributions of this paper are three-fold. First we review 8 promising methods for early diagnosis of AD and undertake a performance evaluation using ROC analysis. We find that fractal dimension (AUC = 0.989), zero crossing interval (AUC = 0.980) and spectrum analysis of power alpha/theta ratio (PwrAlpha,Theta)(AUC = 0.975) perform best. With all three having sensitivity and specificity higher than 94%. We plot ROC curve with 95% confidence contours because of the small size of our data set (17 AD and 24 NOLD). Second, we investigate a fusion approach to combine these methods,using a logistic regression model, into one single more accurate biomarker (AUC = 1.0). Thirdly, to help support the distribution and use of these methods for early detection and care of AD, we developed them as web-services, integrated into online tools available from the BIOPATTERN project portal (www.biopattern.org).
Some orthogonal polynomials
Authors: Maitree Podisuk, Sirikul Bunditsaovapak
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

This paper presents to sequences of orthogonal polynomials then uses them to find the numerical definite integral and the numerical solution of the initial value problem of ordinary differential equation. These orthogonal polynomials are on the interval [0, 1] with respect to the weight functions w(x) = 1 + x2 and w(x)=1/1+x2. Some examples will be given.