ppxscal/embedding_network huggingface dataset:
A linear programming model for optimal computer network protocol design
Authors: John F. Heafner, Frances H. Nielsen
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

After providing background information on protocol modeling, we then describe a linear programming model useful in protocol design. This is followed by a description of its use and some comments on its implementation.
Distributed versioning: consistent replication for scaling back-end databases of dynamic content web sites
Authors: Cristiana Amza, Alan L. Cox, Willy Zwaenepoel
Venue: Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware (2003)

Dynamic content Web sites consist of a front-end Web server, an application server and a back-end database. In this paper we introduce distributed versioning, a new method for scaling the back-end database through replication. Distributed versioning provides both the consistency guarantees of eager replication and the scaling properties of lazy replication. It does so by combining a novel concurrency control method based on explicit versions with conflict-aware query scheduling that reduces the number of lock conflicts. We evaluate distributed versioning using three dynamic content applications: the TPC-W e-commerce benchmark with its three workload mixes, an auction site benchmark, and a bulletin board benchmark. We demonstrate that distributed versioning scales better than previous methods that provide consistency. Furthermore, we demonstrate that the benefits of relaxing consistency are limited, except for the conflict-heavy TPC-W ordering mix.
Model Driven QoS Analyses of Composed Web Services
Authors: Danilo Ardagna, Carlo Ghezzi, Raffaela Mirandola
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

The problem of composing services to deliver integrated business solutions has been widely studied in the last years. Besides addressing functional requirements, services compositions should also provide agreed service levels. Our goal is to support model-based analysis of service compositions, with a focus on the assessment of non-functional quality attributes, namely performance and reliability. We propose a model-driven approach, which automatically selects the set of available services, transforms a design model of service composition into an analysis model, which then feeds a probabilistic model checker for quality prediction. To bring this approach to fruition, we developed a prototype tool and we show the results which can be achieved with a simple example.
Scheduling with uncertain durations: Modeling β-robust scheduling with constraints
Authors: Christine Wei Wu, Kenneth N. Brown, J. Christopher Beck
Venue: Computers and Operations Research (2009)

Many real-world scheduling problems are subject to change, and scheduling solutions should be robust to those changes. We consider a single-machine scheduling problem where the processing time of each activity is characterized by a normally distributed random variable, with flowtime as the main solution criterion. The objective is to find the @b-robust schedule-the schedule that minimizes the risk of the flowtime exceeding a threshold. We show how to represent this problem as a constraint model, explicitly representing the uncertainty and robustness as input parameters and objectives, and enabling the uncertainty to propagate using constraint propagation. Specifically, we develop three models (primal, dual and hybrid), and we show the effect of dominance rules on the search space.
Disclosing spoken culture: user interfaces for access to spoken word archives
Authors: Willemijn Heeren, Franciska de Jong
Venue: Proceedings of the 22nd British HCI Group Annual Conference on HCI 2008: People and Computers XXII: Culture, Creativity, Interaction - Volume 1 (2008)

Over the past century alone, millions of hours of audiovisual data have been collected with great potential for e.g., new creative productions, research and educational purposes. The actual (re-)use of these collections, however, is severely hindered by their generally limited access. In this paper a framework for improved access to spoken content from the cultural heritage domain is proposed, with a focus on online user interface designs that support access to speech archives. The evaluation of the user interface for an instantiation of the framework is presented, and future work for the adaptation of this first prototype to other collections and archives is proposed.
Statistical analysis of multipath fading channels using generalizations of shot noise
Authors: Charalambos D. Charalambous, Seddik M. Djouadi, Christos Kourtellaris
Venue: EURASIP Journal on Wireless Communications and Networking (2008)

This paper provides a connection between the shot-noise analysis of Rice and the statistical analysis of multipath fading wireless channels when the received signals are a low-pass signal and a bandpass signal. Under certain conditions, explicit expressions are obtained for autocorrelation functions, power spectral densities, and moment-generating functions. In addition, a central limit theorem is derived identifying the mean and covariance of the received signals, which is a generalization of Campbell's theorem. The results are easily applicable to transmitted signals which are random and to CDMA signals.
Evaluating Streaming Rate Controllers: A Support Tool
Authors: Cristian Koliver, Jean-Marie Farines, Barbara Busse, Hermann Meer
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

The Internet has been experiencing a large growth of themultimedia traffic of applications performing over an RTP stackimplemented on top of UDP/IP. Since UDP does not offer a congestioncontrol mechanism (unlikely TCP), studies on the rate controlschemes have been increasingly done. Usually, new proposes areevaluated, by simulation, in terms of criteria such as fairnesstowards competing TCP connections and packet losses. However,results related to other performance aspects &minus; qualityachieved, overhead introduced by the control, and actual throughputafter stream adaptation &minus; are difficult to obtain bysimulation. In order to provide actual results about thesecriteria, we developed a comprehensive rate controlled videodelivery tool for testing RTP-based controllers. The tool allows toeasily incorporate new control schemes. In this paper, we describethe tool and the results achieved by using a LDA+ basedcontroller.
A Novel Digital Lock-in Amplifier with Dual Channels
Authors: Dongyue Wu, Chao Wang, Hongjun Sun, Huaxiang Wang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In order to sample two channels mixing frequency signals in high speed and process them synchronously in the system, a dual-channel, high-speed digital lock-in amplifier (LIA) that uses orthogonal digital demodulation is proposed. The instrument, based on a digital signal processor (DSP) and its associated hardware, is implemented. The system adopts a method of high speed bi-directional parallel communication between DSP and parallel interface of PC by EPP (Enhanced Parallel Port) protocol. The EPP achieves an easy installation for industrial applications. The experimental tests showed that the system is feasible.
Computer programming fundamentals for non-computer scientists
Authors: Daniel P. Freedman, Thomas Plum
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Computing for Social Scientists is one of a series of introductory computer programming courses designed for specialists, this one for graduate level social science students. A wide spectrum of disciplines was represented including anthropology, sociology, psychology, history, economics, linguistics, and urban planning. The students also had a highly varied background in mathematics---from one college math course through advanced calculus; from strong statistics to no statistical background whatsoever.
Asymptotic subword complexity of fixed points of group substitutions
Authors: Ilya Goldstein
Venue: Theoretical Computer Science (2009)

The subword complexity of fixed points of some types of substitutions was studied by various authors. Here we introduce a family of substitutions, arising from multiplication tables of finite groups and other similar structures, and analyze their subword complexity.
A simple corner orientation detector
Authors: Eugen Diaconescu, Cristian Dragomirescu
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

This paper describes a new simple and fast method, elaborated and tested by authors, for corner orientation detection. The conventional L-, T-, Y- and X- corner or junctions are important dominant features belonging to object patterns in digital images. A small set of locally defined parameters: position, orientation, scale, phase and curvature can characterize these elementary structures. "Orientation" in 2D plan of corners is a strong feature. It was successfully utilized for pattern recognition in 2D images. They provide significant information regarding objects under translation, rotation and scale change. However, when compared to the number of corner detection methods for junction location, a a limited number of solution allow for determining spatial orientation. Our proposed method, described in this paper, is simple, practical and efficient. The accuracy of the corner detector algorithm was tested with synthetic and natural images. Similar to other known methods, the elaborated algorithm may be useful to image pre-processing, object recognition applications and vision systems, particularly for scenes that contain polygonal objects.
The Minimax Distribution Free Procedure for an Inventory Model in Mixed Fuzzy and Stochastic Environment
Authors: Xiaobin Wang, Lin Xu, Quqnsheng Wu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper investigates the mixture inventory control system in which the lead time demand is a random variable with general distribution, and the defective rate of the arrived order lot is also a random variables. Furthermore, the backorder rate, setup cost, shortage penalty cost and marginal profit per unit in different cycles are iid fuzzy variables, respectively. In addition, a mathematic formulation about the expected annual total cost is presented. And then some useful properties are analyzed for establishing an efficient solution procedure. In order to search the optimal solution of the model, an iterative algorithm are designed. Finally, a numerical example is given to illustrate the procedure of searching the optimal solution.
The Language of Interjections
Authors: Isabella Poggi
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

The paper presents a theoretical view of interjections. It defines them as holophrastic codified signals, whose meaning corresponds to complete speech acts including a specific performative and propositional content. Interjections are then distinguished from exclamations and onomatopoeias, and some devices are analyzed that characterize them. An overview of the syntactic, lexical and semantic features of interjections is provided, and a typology of Italian interjections is presented.
LCSH is to thesaurus as doorbell is to mammal: visualizing structural problems in the Library of Congress subject headings
Authors: Simon Spero
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

The Library of Congress Subject Headings (LCSH) has been developed over the course of more than a century, predating the semantic web by some time. Until the 1986, the only concept-to-concept relationship available was an undifferentiated "See Also" reference, which was used for both associative (RT) and hierarchical (BT/NT) connections. In that year, in preparation for the first release of the headings in machine readable MARC Authorities form, an attempt was made to automatically convert these "See Also" links into the standardized thesaural relations.
Voice over Data over GPRS/ EDGE Networks
Authors: Mohammed A. Qadeer, Ahmad Ali Habeeb, Shamshir Ahmad
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

GPRS or the General Packet Radio Service is a non-voice value added technology that allows data communication over Mobile Phones in an Internet Protocol (IP)-based network [11]. This paper focuses on the transmission of voice over the existing data channel in GSM/GPRS networks using a web server. Since the data channel in any network is economically viable for transmission, a mechanism to transfer voice over the existing network can prove to be a boon. Because of the fact that General Packet Radio Service has a data rate from 56 to 114 kbps (In case of EDGE it goes upto 177.6 kbps) and has a continuous connection to internet via the GGSN & SGSN and is based on the packet switched network, so if the voice at one end be broken into data packets and transmitted through a web server, can be reassembled at the other end. This whole process can be termed as Voice over data over Mobile (VODOM). Obviously GPRS based voice packet service should cost extremely less than the traditional circuit switched voice service.
Channel Quality Dependent Rate-Limited Scheduling Algorithm for IEEE 802.16 Wireless Networks
Authors: Cuicui Zhao, Jinlong Hu, Jihua Zhou, Jinglin Shi, Eryk Dutkiewicz
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

The WiMAX technology based on IEEE 802.16 is expected to support multimedia services with guaranteed quality of service (QoS). In this paper, a scheduler structure with priority classes is designed for IEEE 802.16 wireless networks, and a channel quality dependent rate-limited (CD-RL) algorithm is proposed. CD-RL provides promised data rates while taking throughput into account. With a carefully designed "order changing" method, CD-RL can be implemented with low complexity, which makes it feasible in practical systems. Simulation results reveal that CD-RL has good performances in fairness, minimum reserved traffic rate and average packet delay.
A new fast forecasting technique using high speed neural networks
Authors: Hazem M. El-Bakry, Nikos Mastorakis
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Forecasting is an important issue for many different applications. In this paper, a new efficient forecasting technique is presented. Such technique is designed by using fast neural networks (FNNs). The new idea relies on performing cross correlation in the frequency domain between the input data and the input weights of neural networks. It is proved mathematically and practically that the number of computation steps required for the proposed fast forecasting technique is less than that needed by conventional neural-based forecasting. Simulation results using MATLAB confirm the theoretical computations. The proposed fast forecasting technique increases the prediction speed and at the same time does not affect the predication accuracy. It is applied professionally for erythemal ultraviolet irradiance prediction.
The impact of context and incentives on mobile service adoption
Authors: Zhengchuan Xu, Yufei Yuan
Venue: International Journal of Mobile Communications (2009)

Users may use a mobile service in various contexts. At the same time, incentives such as financial rewards or mandatory usage policies may also affect users' behaviour. It is critical to study how users' perception and intention are affected by the context and incentives. We propose a user adoption model of mobile commerce with a consideration of context and incentives. We apply this model to the case of a Global Positioning System (GPS) based Taxi-Dispatching System. Preliminary data analysis illustrates that context and incentives have significant impact on users' behaviour.
Combinatorics: The Rota Way, 1st edition
Authors: Joseph P. S. Kung, Gian-Carlo Rota, Catherine H. Yan
Venue: Cambridge Mathematical Library (2009)

Written by two of Gian-Carlo Rota's former students, this book is based on notes from his courses and on personal discussions with him. Topics include sets and valuations, partially ordered sets, distributive lattices, partitions and entropy, matching theory, free matrices, doubly stochastic matrices, Moebius functions, chains and antichains, Sperner theory, commuting equivalence relations and linear lattices, modular and geometric lattices, valuation rings, generating functions, umbral calculus, symmetric functions, Baxter algebras, unimodality of sequences, and location of zeros of polynomials. Many exercises and research problems are included, and unexplored areas of possible research are discussed. This book should be on the shelf of all students and researchers in combinatorics and related areas.
Fast construction of constant bound functions for sparse polynomials
Authors: Andrew Paul Smith
Venue: Journal of Global Optimization (2009)

A new method for the representation and computation of Bernstein coefficients of multivariate polynomials is presented. It is known that the coefficients of the Bernstein expansion of a given polynomial over a specified box of interest tightly bound the range of the polynomial over the box. The traditional approach requires that all Bernstein coefficients are computed, and their number is often very large for polynomials with moderately-many variables. The new technique detailed represents the coefficients implicitly and uses lazy evaluation so as to render the approach practical for many types of non-trivial sparse polynomials typically encountered in global optimization problems; the computational complexity becomes nearly linear with respect to the number of terms in the polynomial, instead of exponential with respect to the number of variables. These range-enclosing coefficients can be employed in a branch-and-bound framework for solving constrained global optimization problems involving polynomial functions, either as constant bounds used for box selection, or to construct affine underestimating bound functions. If such functions are used to construct relaxations for a global optimization problem, then sub-problems over boxes can be reduced to linear programming problems, which are easier to solve. Some numerical examples are presented and the software used is briefly introduced.
Developing authentic problem solving skills in introductory computing classes
Authors: Katrina Falkner, Edward Palmer
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

The ability to solve problems is the key to developing software, and it is an ability that can be difficult to learn. Introductory Computer Science students are often taught syntax and semantics, along with simple problems designed to develop logical, structured thinking, but authentic problem-solving skills are rarely developed at these early stages. In this paper we describe an approach to introductory computer science education that addresses student engagement through integrating cooperative learning techniques and authentic problem solving processes throughout each aspect of the curriculum. Over a period of 4 years, the introductory computer science course at the University of Adelaide has been modified to support a cooperative learning style. A three-stage methodology has been implemented in place of traditional lectures to achieve this. The process focuses on observing the application of programming techniques, observing problem solving techniques and then applying cooperative problem solving exercises in the classroom. The results from this change in teaching methodology have been an increase in attendance rates at lectures and practical sessions as well as improved learning outcomes as measured by exam results. Student experience surveys show students have greater motivation for learning and believe they have a better understanding of concepts since the changes have occurred.
Feasibility and Profitability of Optimization by Data-Type Specification in Ruby
Authors: Prakhar Goyal
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The paper aims at proposing methods to achieve performance optimization using data-type specification in an object-oriented programming language, Ruby. In particular, the addition operator has been considered in detail in the paper to prove the advantages of the proposed approach. To support the idea, experiments were conducted to establish the feasibility and profitability of the optimization in Ruby using data-type specification and finally it is shown that the proposed methodology results in significant speedups in dynamically typed languages, like Ruby.
Enhancing Simulation Accuracy through Advanced Hazard Detection in Asynchronous Circuits
Authors: Feng Shi, Yiorgos Makris
Venue: IEEE Transactions on Computers (2009)

A fast and accurate simulator with elaborate hazard detection capabilities is vital for asynchronous circuits, not only for the purpose of design validation through logic simulation, but even more importantly for the purpose of test validation through fault simulation. Towards this end, we developed SPIN-SIM, a logic and fault simulator built around Eichelberger&#x2019;s classical hazard detection method, yet extended in various ways in order to overcome its limitations. More specifically, in order to improve simulation accuracy and hazard detection, SPIN-SIM i) employs a 13-valued algebra for which it adapts Eichelberger&#x2019;s method, ii) maintains partial orders of causal signal transitions through relative time-stamps, and iii) unfolds time-frames judiciously to distinguish between hazards and actual transitions. Experimental results demonstrate that, at the cost of a negligible increase in computational time over Eichelberger&#x2019;s method, if any at all, SPIN-SIM achieves significantly more accurate logic simulation and, by extension, drastically more efficient fault simulation. Furthermore, while the proposed method was developed and is presented for the class of Speed-Independent circuits, it is easily extendible to various other classes of asynchronous circuits.
CLASP: collaborating, autonomous stream processing systems
Authors: Michael Branson, Fred Douglis, Brad Fawcett, Zhen Liu, Anton Riabov, Fan Ye
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

There are currently a number of streaming data analysis systems in research or commercial operation. These systems are generally large-scale distributed systems, but each system operates in isolation, under the control of one administrative authority. We are developing middleware that permits autonomous or semi-autonomous streaming analysis systems (called "sites") to interoperate, providing them opportunities for data access, performance improvements, and reliability far exceeding that available in a single system. Unique characteristics of our system include an architecture for the management of multiple cooperation paradigms depending on the degree of trust and dependencies among the participating sites; a multisite planner that converts user-specified declarative queries into specifications of distributed jobs; and a mechanism for automatic recovery of site failures by redispatching failed pieces of a distributed job. We evaluate our architecture via experiments on a running prototype, and the results demonstrate the advantages of multisite cooperation: collaborative jobs that share resources, even across only a few sites, can produce results 50% faster than independent execution, and jobs on failed sites can be recovered within a few seconds.