ppxscal/embedding_network huggingface dataset:
Design Considerations for Broadband Community Area Networks
Authors: Csaba A. Szabo, Imrich Chlamtac, Erik Bedo
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

During the last few years, a number of community area networks (CAN) have been launched in North America and Europe. Contrary to other telecommunication infrastructures, these networks are sponsored and financed by local governments and operate according to business considerations and are based on business models that are different from a classical telecom operator, requiring therefore a tailored business and technological solution. Main CAN customer groups include (i) telcos and ISPs, (ii) business customers, (iii) public sector institutions and (iv) residential users. The two main product groups are fiber and wavelengthproducts offered to wholesale customers and data, voice and video services offered to public sector institutions. Although the individual technologies to be deployed within these networks are no different from those used in the advanced telecommunications systems operated bypublic carriers, community networks can be more creative in using leading edge broadband core and access technologies and in providing advanced services. The main objective of the paper is to demonstrate that CANs, if properly designed, implemented and managed, represent a viable business model as well as the right technology basis for providing e-government services, in particular, and for contributing to the development of an e-society, in general. A preliminary design of a Province network in Northern Italy has been carried out by the authors and serves as a case study for this article.
Some optimization problems in multivariate statistics
Authors: T. Rapcsák
Venue: Journal of Global Optimization (2004)

Interesting and important multivariate statistical problems containing principal component analysis, statistical visualization and singular value decomposition, furthermore, one of the basic theorems of linear algebra, the matrix spectral theorem, the characterization of the structural stability of dynamical systems and many others lead to a new class of global optimization problems where the question is to find optimal orthogonal matrices. A special class is where the problem consists in finding, for any 2&le;k&le;n, the dominant k-dimensional eigenspace of an n&times;n symmetric matrix A in Rn where the eigenspaces are spanned by the k largest eigenvectors. This leads to the maximization of a special quadratic function on the Stiefel manifold Mn,k. Based on the global Lagrange multiplier rule developed in Rapcs&aacute;k (1997) and the paper dealing with Stiefel manifolds in optimization theory (Rapcs&aacute;k, 2002), the global optimality conditions of this smooth optimization problem are obtained, then they are applied in concrete cases.
Untethered gesture acquisition and recognition for a multimodal conversational system
Authors: T. Ko, D. Demirdjian, T. Darrell
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

Humans use a combination of gesture and speech to convey meaning, and usually do so without holding a device or pointer. We present a system that incorporates body tracking and gesture recognition for an untethered human-computer interface. This research focuses on a module that provides parameterized gesture recognition, using various machine learning techniques. We train the support vector classifier to model the boundary of the space of possible gestures, and train Hidden Markov Models on specific gestures. Given a sequence, we can find the start and end of various gestures using a support vector classifier, and find gesture likelihoods and parameters with a HMM. Finally multimodal recognition is performed using rank-order fusion to merge speech and vision hypotheses.
Making the transition from print to electronic serial collections: a new model for academic chemistry libraries?
Authors: Tina E. Chrzastowski
Venue: Journal of the American Society for Information Science and Technology (2003)

A "new model" academic chemistry library is proposed at the University of Illinois at Urbana-Champaign (UIUC) in which primary access to journals is electronic, replacing traditional print access, binding, and shelving. Print journals will continue to be purchased and archived unbound in a remote storage facility following unbound display and access for twelve months. The new model, initially proposed by administrative chemistry faculty, was assessed in a feasibility study which looked at the stability, quantity, and quality of electronic journals; it also included a survey of chemistry faculty, a review of internal management data, and an analysis of use of chemistry journals, both print and electronic. The feasibility study found support for the model in every area, but with a few caution flags and speed bumps predicted along the way.
Results and Conjectures on High Rate Quantization
Authors: Robert M. Gray, Tamás Linder
Venue: Proceedings of the Conference on Data Compression (2004)

Recent results and conjectures are presented regarding the behavior ofasymptotically optimal vector quantizers. The principal new results are fourlemmas and a corollary relating the distortion and entropy of quantizers andasymptotically optimal quantizers. Several related conjectures (some of whichare based on simulations) are made regarding the behavior of asymptoticallyoptimal quantizers.
A novel speed-sensitive bidirectional overflow and hand-down resource allocation strategy for hierarchical cellular networks
Authors: Vahid Tabataba Vakili, Arash Aziminejad, Mohammad Reza Dehbozorgi
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Next generation cellular systems are expected to use multilayered, multi-sized cells to cover non-homogeneous populated areas. In this paper, a new method for managing users with different mobility characteristics (slow and fast) in a two-layer cellular structure, through utilizing a combination of overflow and take-back (hand-down) schemes is presented. A novel speed-responsive overflow and hand-down mechanism implemented in a single unified hierarchical channel assignment scheme called O&H-HCA, jointly handles the overflow traffic from lower layer to higher layer and directs the handoff calls to the specific layer dependent on the speed class of the mobile units. Numerical results obtained from comprehensive and detailed teletraffic performance assessment reveal superiority of O&H-HCA over traditional hierarchical schemes.
Postprocessing Decision Trees to Extract Actionable Knowledge
Authors: Qiang Yang, Jie Yin, Charles X. Ling, Tielin Chen
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Most data mining algorithms and tools stop at discoveredcustomer models, producing distribution informationon customer profiles. Such techniques, when applied to industrialproblems such as customer relationship management(CRM), are useful in pointing out customers who arelikely attritors and customers who are loyal, but they requirehuman experts to postprocess the mined information manually.Most of the postprocessing techniques have been limitedto producing visualization results and interestingnessranking, but they do not directly suggest actions that wouldlead to an increase the objective function such as profit. Inthis paper, we present a novel algorithm that suggest actionsto change customers from an undesired status (suchas attritors) to a desired one (such as loyal) while maximizingobjective function: the expected net profit. We developthese algorithms under resource constraints that areabound in reality. The contribution of the work is in takingthe output from an existing mature technique (decisiontrees, for example), and producing novel, actionable knowledgethrough automatic postprocessing.
Working group reports from ITiCSE on Innovation and technology in computer science education
Authors: Vassilios Dagdilelis, Maya Satratzemi
Venue: Annual Joint Conference Integrating Technology into Computer Science Education (2003)

We are pleased to present the proceedings of the annual ITiCSE Conference, the eighth in a series of international conferences that began in 1996 in Barcelona. During these years, ITiCSE conferences have created a long tradition in advancing research in the field of Computer Science Education and strengthening collaboration among researchers from all over the world. The quantitative and qualitative characteristics of ITiCSE 2003 give us a strong indication that this conference will continue that fine tradition.This year ITiCSE is hosted in Thessaloniki, a city of great and long history. In addition to the high quality technical program, the conference will also provide you with social events that will exhibit the life and the history of Thessaloniki and the region of Macedonia. With the planned Sunday and Monday receptions, the Tuesday banquet, the farewell party, and the excursions we hope that you will have the opportunity to make "new friends" and get a taste of Greek cuisine and hospitality.The conference program contains three invited speakers, three tutorials, exhibits, posters, demonstrations, forty-four papers in two parallel tracks, three panels, and a session of Tips & Techniques.We are extremely honored to have as invited speakers three prominent computer scientists whose contribution to education has been enormous. Maria Klawe, the President of ACM, is giving the opening keynote address. Christos H. Papadimitriou, recipient of the Knuth Prize in 2002, is giving the second day keynote address. Donald E. Knuth, winner of the ACM Alan Turing Award in 1974 and the IEEE Jon von Neumann award in 1995, is giving the closing keynote address.ITiCSE conferences are characterized as multinational, and this year's participants are coming from 16 different countries. However, many countries with an exceptional research activity won't be present. We hope that future ITiCSE conferences will attract even more papers from various countries, because we believe that the coexistence of colleagues from different countries with different scientific and cultural backgrounds can produce new collaborations and research projects.This year, 129 full papers were submitted and 44 of them were finally selected for the conference. The decision process was very hard since we had to leave out some exceptional papers. The number of posters this year increased, and 55 will be presented in this conference. Faithful to the ITiCSE tradition, we offer Working Groups as well as other forms of communication such as Demos, Tutorials and Tips and Techniques, which play an important role to the dissemination of ideas and thoughts and also help bring researchers and scientists together in a more informal manner.We hope that the ITiCSE 2003 will become part of the ITiCSE tradition.Dear colleagues and collaborators, welcome to ITiCSE 2003!
The cutting EDGE of IP router configuration
Authors: Don Caldwell, Anna Gilbert, Joel Gottlieb, Albert Greenberg, Gisli Hjalmtysson, Jennifer Rexford
Venue: ACM SIGCOMM Computer Communication Review (2004)

Human error in configuring routers undermines attempts to provide reliable, predictable end-to-end performance on IP networks. Manual configuration, while expensive and error-prone, is the dominant mode of operation, especially for large enterprise networks. These networks often lack the basic building blocks---an accurate equipment inventory, a debugged initial configuration, and a specification of local configuration policies---to support the holy grail of automation. We argue the migrating an existing network to automated configuration is a rich and challenging research problem rooted in data analysis and in the modeling of network protocols and operational practices. We propose a novel, bottom-up approach that proceeds in three phases: (i)analysis of configuration data to summarize the existing network state and uncover configuration problems; (ii) data mining to identify the network's local configuration policies and violations of these policies; and ultimately (iii)boot-strapping of a database to drive future configuration changes. The first stage reduces the number of errors, the second normalizes the local policies, and the third prevents new errors and reduces the manpower needed to configure the network. We describe the architecture of our EDGE tool for steps (i) and (ii), and present some examples from our experiences applying the tool to several large enterprise networks.
Study of the TCP dynamics over wireless networks with micromobility support using the ns simulator
Authors: Llorenç Cerdà, Fabio Vena, Olga Casals
Venue: Wireless Networks (2004)

Several IP micro-mobility protocols have been proposed to enhance the performance of Mobile IP in an environment with frequent handoffs. In this paper we make a detailed study of how some of these protocols namely Cellular IP, HAWAII and Hierarchical Mobile IP affect the behavior of TCP and their interaction with the MAC layer. The aim of the paper is to investigate the impact of handoffs on TCP by means of simulation traces that show the evolution of segments and acknowledgments during handoffs.
UNICOM: a universal communication and control system for the non-verbal motor impaired
Authors: D. Rowell, G. F. Dalrymple, J. Olsen
Venue: Issue 24 (October 1978) (1978)

The UNICOM is a communicator for the non-vocal severely motor impaired which is based upon a microprocessor-controlled video display and printer. Its fundamental concept is that it is a single device which can be adapted by simple plugin man/machine interfaces to operate in any of several control strategies: scanning, encoding, or direct selection. Input interface devices, ranging from a single switch to a full keyboard, are selected according to the residual motor capabilities of the user. The input device determines the control strategy.
Cluster assignment of global values for clustered VLIW processors
Authors: Andrei Terechko, Erwan Le Thénaff, Henk Corporaal
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

In this paper high-level language (HLL) variables that are alive in a whole HLL function, across multiple scheduling units, are termed as global values. Due to their long live ranges and, hence, large impact on the schedule, the global values require different compiler optimizations than local values, which span across only one scheduling unit. The instruction scheduler for a clustered ILP processor, which is responsible for cluster assignment of operations and variables, faces a difficult problem of assigning global values to clusters. Our study shows that trivial assignments (e.g. mapping all global values into one cluster) may result in a severe cycle count overhead relative to the unicluster of up to 26.3% for a four cluster VLIW machine. This paper presents three advanced algorithms for assigning global values to clusters based on multi-pass scheduling and affinity of variables. Furthermore, we measure performance of these algorithms on optimized multimedia C applications and assess quality of our algorithms by comparing them to a practical higher performance bound derived from a vast random search. Our algorithms reduce the execution time overhead of the best simple algorithm round-robin from 10.5% to 5.9% for the two cluster VLIW machine and from 17.3% to 14.12% for the four cluster VLIW machine.
Discovering regularities in biosequences: challenges and applications
Authors: K. Perdikuri, C. Makris, A. Tsakalidis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Computational methods on molecular sequence data (strings) are at the heart of computational molecular biology. A DNA molecule can be thought of as a string over an alphabet of four characters {a,c,g,t} (nucleotides), while a protein can be thought of as a string over an alphabet of twenty characters (amino acids). A gene, which is physically embedded in a DNA molecule, typically encodes the amino acid sequence for a particular protein. Existing and emerging algorithms for string computation provide a significant intersection between computer science and molecular biology.
Improving efficiency of procedures for compositional synthesis by using bidirectional search
Authors: Amaresh Chakrabarti
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

This article is an attempt to improve the efficiency of procedures for compositional synthesis of design solutions using building blocks. These procedures have found use in a wide range of applications, and are one of the most substantial outcomes of research into automated synthesis of design solutions. Due to their combinatorial nature, these procedures are highly inefficient in solving problems, especially when the database of building blocks for synthesis or the problem size is large. Previous literature often focuses on improving only the algorithm part of a procedure, although it is both its algorithm and database which together determine the overall efficiency of the procedure. This article reports the construction and analysis of an improved algorithm, based on bidirectional search, for efficient compositional synthesis of design solutions using a set of building blocks.
Integrated control of distributed volume visaulization through the World-Wide-Web
Authors: Cheong S. Ang, David C. Martin, Michael D. Doyle
Venue: Proceedings of the conference on Visualization '94 (1994)

The World-Wide-Web (WWW) has created a new paradigm for online information retrieval by providing immediate and ubiquitous access to digital information of any type from data repositories located throughout the world. The web's development enables not only effective access for the generic user, but also more efficient and timely information exchange among scientists and researchers. We have extended the capabilities of the web to include access to three-dimensional volume data sets with integrated control of a distributed client-server volume visualization system. This paper provides a brief background on the World-Wide-Web, an overview of the extensions necessary to support these new data types and a description of an implementation of this approach in a WWW-compliant distributed visualization system
Learning to Share Meaning in a Multi-Agent System
Authors: Andrew B. Williams
Venue: Autonomous Agents and Multi-Agent Systems (2004)

The development of the semantic Web will require agents to use common domain ontologies to facilitate communication of conceptual knowledge. However, the proliferation of domain ontologies may also result in conflicts between the meanings assigned to the various terms. That is, agents with diverse ontologies may use different terms to refer to the same meaning or the same term to refer to different meanings. Agents will need a method for learning and translating similar semantic concepts between diverse ontologies. Only until recently have researchers diverged from the last decade's &ldquo;common ontology&rdquo; paradigm to a paradigm involving agents that can share knowledge using diverse ontologies. This paper describes how we address this agent knowledge sharing problem of how agents deal with diverse ontologies by introducing a methodology and algorithms for multi-agent knowledge sharing and learning in a peer-to-peer setting. We demonstrate how this approach will enable multi-agent systems to assist groups of people in locating, translating, and sharing knowledge using our Distributed Ontology Gathering Group Integration Environment (DOGGIE) and describe our proof-of-concept experiments. DOGGIE synthesizes agent communication, machine learning, and reasoning for information sharing in the Web domain.
Evolutionary algorithm in problem of avoidance collision at sea
Authors: Roman Śmierzchalski
Venue: Artificial intelligence and security in computing systems (2003)

In the paper a version of the Evolutionary Planner/Navigator algorithm has been used as a major component of such a decision support system for computing the near optimum trajectory of a ship in given environment. By taking into account certain boundaries of the manoeuvring region, along with navigation obstacles and other moving ships, the problem of avoiding collisions at sea was reduced to a dynamic optimisation task with static and dynamic constrains. The introduction of a time parameter and moving constrains representing the passing ships is the main distinction of the new system. Results of algorithm parameters, having the form obtained using the program for navigation situations are given.
Task Allocation via Multi-Agent Coalition Formation: Taxonomy, Algorithms and Complexity
Authors: Hoong Chuin Lau, Lei Zhang
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Coalition formation has become a key topic in multiagent research. In this paper, we propose a preliminary classification for the coalition formation problem based on three driving factors (demands, resources and profit objectives). We divide our analysis into 5 cases. For each case, we will present algorithms and complexity results. We anticipate that with future research, this classification can be extended in similar fashion to the comprehensive classification for the Job Scheduling Problem.
Asymptotic expansions for Laguerre-like orthogonal polynomials
Authors: M. Kzaz, F. Maach, J. Van Iseghem
Venue: Journal of Computational and Applied Mathematics (2003)

Asymptotic expansion for the Laguerre polynomials and for their associated functions is extended to the case of a weight function which is the product of the Laguerre weight function by a polynomial, nonnegative on the interval [0, ∞].
Reliable Fault Diagnosis with Few Tests
Authors: Andrzej Pelc, Eli Upfal
Venue: Combinatorics, Probability and Computing (1998)

We consider the problem of fault diagnosis in multiprocessor systems. Processors perform tests on one another: fault-free testers correctly identify the fault status of tested processors, while faulty testers can give arbitrary test results. Processors fail independently with constant probability p<1&#x002F;2 and the goal is to identify correctly the status of all processors, based on the set of test results. For 0<q<1, q-diagnosis is a fault diagnosis algorithm whose probability of error does not exceed q. We show that the minimum number of tests to perform q-diagnosis for n processors is &Theta;(n log 1&#x002F;q) in the nonadaptive case and n+&Theta;( log 1&#x002F;q) in the adaptive case. We also investigate q-diagnosis algorithms that minimize the maximum number of tests performed by, and performed on, processors in the system, constructing testing schemes in which each processor is involved in very few tests. Our results demonstrate that the flexibility yielded by adaptive testing permits a significant saving in the number of tests for the same reliability of diagnosis.
The computing skills workshop at Carnegie-Mellon University
Authors: John Stuckey
Venue: ACM SIGCUE Outlook (1986)

Carnegie-Mellon University is now in the early stage of deploying an intensive and diverse computing environment for which it has been actively preparing since 1982. In that year it began a joint venture with IBM to develop a style of academic computing appropriate to recent advances in, and anticipating future directions of, hardware, networking, user interfaces, and electronic pedagogy. Two other activities were clearly necessary if the new environment was to be a pervasive and integral part of the educational process: preparation of the faculty and orientation of the students. Faculty preparation began over a year ago, with the distribution of prototype advanced-function workstations to faculty members with innovative proposals for educational software. This article describes the effort to provide the student body with a sufficient set of skills to be ready to make use of the new environment for both course-related and independent work.