ppxscal/embedding_network huggingface dataset:
A logical foundation for an information engineering curriculum
Authors: F. Golshani
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

We propose a new model for IT education based on engineering principles and in line with the latest advancement in information science. We justify the needs for such a discipline and outline the science requirements that would distinguish it from IT training programs. The first step therefore is to determine the appropriate science foundation for an information-centered curriculum and, based on this foundation, create a comprehensive curriculum.
On Stubborn Graph Sandwich Problems
Authors: Simone Dantas, Luerbio Faria
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

The stubborn partition is a partition of the vertex set of a graph G into at most four parts A, B, C, D, with the following constraints: the internal constraints are part A and part B are required to be independent sets, and part D is required to be a clique; the only external constraint is that each vertex of part A is nonadjacent to every vertex of part C. This problem is generalized to the list sandwich version: given two graphs G^1 = (V,E^1), G^2 = (V,E^2) such that if E^1 \subseteqE^2, and for each vertex a list of parts in which the vertex is allowed to be placed, we look for a stubborn sandwich graph G = (V,E) such that E^1 \subseteqE \subseteqE^2. In this paper, we prove that the LIST STUBBORN GRAPH SANDWICH PROBLEM is NP-complete.
Wireless Sensor Network Based Coal Mine Wireless and Integrated Security Monitoring Information System
Authors: Wei Yang, Ying Huang
Venue: Proceedings of the Sixth International Conference on Networking (2007)

According to the actual landform of underground coal mine and the demand of security monitoring, in this paper a coal mine wireless and integrated security monitoring system which combine wireless sensor network and wire monitoring network is proposed. This paper emphasizes a wireless sensor network for coal mine monitoring. In the light of the actual circumstances of coal mine, we propose two-leveled network architecture for the wireless sensor network, put forward a corresponding topology generation algorithm, and discuss monitoring mechanism about the network in details.
Policy-Based Parametric Firewall Configuration: A Real-Case Application
Authors: Massimo Marchi, Romeo Penzo, Alessandro Provetti
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

We describe a simple policy language for setting up and running firewalls (FW). The language allows to describe sophisticated policies for controlling network connections. Composition is done at set-up time, when a parser, starting from a given policy, generates the relative configuration file for one or more firewalls operating the industry-standard Linux Iptables kernel extension. The policy captures the essence of the desired requirements and constrains upon connections between zones. The language has been designed and it is currently on testing in the context of a large intra/extranet with more than 10,000 assigned IP addresses.
Distant voices
Authors: Laurie Rowell
Venue: netWorker (2007)

Why does functional computer voice recognition always seem just out of reach?
A Third Service Evolution Dimension inWeb 2.0 and Real-world Integration Inspired Services in the 3G Mobile Data Communications
Authors: Toshihiko Yamakami
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

It is reported that 67 % of global mobile content is SMSbased, compared to 0 The Japanese market shows the two new directions: emergence of mobile Web 2.0 and distinguished transition from the current business models to the vertical integration ones by mobile operators. Some of Japanese carriers press their own content like music download, auction, micro-payment and so on. It is interesting to investigate how this mobile-specific vertical integration will work in the future as the handset and network converges to the PCs. In addition, the emerging increase of search use and social network use in the mobile contexts initiates the mobile-specific Web 2.0 penetration, another trend of convergence. The high penetration of 3G networks inevitably leads to the flat rate charging, which drives the wireless carriers to seek for other revenue sources. The past lessons told that the mobile service business model evolution was not monotonic due to the complexity of interactions of users, content providers and wireless carriers. It is critical to identify the key factors of business model development, either in Web 2.0-related aspects (e.g. user-generated content) or in vertical integration (e.g. carrier-owned content business or real-world integration services). The two paths toward Mobile Web 2.0 are depicted in Fig. 1, with a specific strategy for each path.
Householder-transform constrained LMS algorithms with reduced-rank updating
Authors: M. L. R. De Campos
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper proposes a new approach to linearly-constrained adaptive filtering, where successive Householder transformations are incorporated in the algorithm update equation in order to reduce computational complexity and coefficient-error norm. We show the derivation of two new algorithms, namely the unnormalized and the normalized Householder-transform constrained LMS algorithms (HCLMS and NHCLMS, respectively). Although the derivation is carried out based on the constrained LMS (CLMS) algorithm, the technique can be applied to other constrained algorithms as well. Simulation results of a linearly-constrained minimum-variance problem show that in finite-precision implementation the coefficient-error norms obtained with the new algorithms are smaller than those obtained with the CLMS and the normalized CLMS algorithms.
Mutually orthogonal transceivers for blind uplink CDMA irrespective of multipath channel nulls
Authors: G. B. Giannakis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Suppression of multiuser interference (MUI) and mitigation of multipath effects constitute major challenges in the design of third-generation wireless mobile systems. Most wideband and multicarrier uplink CDMA schemes suppress MUI statistically in the presence of unknown multipath. For fading resistance, they all rely on transmit- or receive-diversity and multichannel equalization based on bandwidth-consuming training or blind techniques. Either way, they impose restrictive and difficult to check conditions on the FIR channel nulls. Relying on symbol blocking, we design a mutually-orthogonal usercode-receiver (AMOUR) system for quasi-synchronous blind CDMA that eliminates MUI deterministically and mitigates fading irrespective of the unknown multipath and the adopted signal constellation. Analytic evaluation and preliminary simulations reveal the generality, flexibility, and superior performance of AMOUR over competing alternatives.
Structure Paves the Way to the Semantic Web
Authors: Michael K. Bergman
Venue: IEEE Intelligent Systems (2007)

If we compare the semantic Web to the US interstate highway system, we're still in the early stages of a journey that will remake our economy and culture. Many potholes on the road to the semantic Web exist. One ready task is to transform existing structure to RDF. Another priority is to refine tools to extract structure and meaningful information from uncharacterized content according to understandable schemas.
Tutorial T7A: Advanced IC Packaging
Authors: Eric qBeyne
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This course will address advanced packaging and assembly technologies. Demands for increased miniaturization and performance of electronic systems have driven traditional IC packaging technologies to higher levels of sophistication and miniaturization. The different styles of IC packages and their evolution will be discussed, from through-hole to surface mount, from leaded to leadless packages and from 2D to 3D packaging. Novel technology trends will be discussed, in particular wafer level packaging and 3D packaging technologies. The ultimate miniaturised package has a size equal to the die size. Such packages may be fabricated at the wafer level, before die singulation. This not only results in the smallest possible packages, but also enables cost reduction. All die on a wafer are simultaneously packaged, in contrast to the sequential traditional package flows. Further miniaturization and performance enhancement of electronic systems will more and more require the use of 3D interconnection schemes. Key technologies for realizing true 3D interconnect schemes are the realization of vertical connections, either through the Si-die or through the multilayer interconnect with embedded die. Different applications require different complexities of 3D-interconnectivity. Therefore, different technologies may be used. These can be categorized as a more traditional packaging approach, a wafer-level-packaging, WLP ("above' passivation), approach and a foundry level ("below' passivation) approach. The trends for these different 3D-flavours will be discussed in more detail.
Impact of the Creation of the Mozilla Foundation in the Activity of Developers
Authors: Jesus M. Gonzalez-Barahona, Gregorio Robles, Israel Herraiz
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

During 2003, the Mozilla project transitioned from company-promoted (sponsored by AOL) to community-promoted (sponsored by the Mozilla Foundation). What happened to the group of developers during this transition? There was any significant impact on its activity or composition? To answer these questions, we have performed an analysis of the CVS repository of Mozilla, using the CVSAnalY tool, finding little on activity, but dramatic changes in the the composition of the development team.
A multi-stage multi-candidate algorithm for motion estimation
Authors: Liao Ta-Chang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Motion compensation using the optimal full search algorithm is often too computationally heavy for real-time implementation. Many suboptimal fast search algorithms have been proposed. In particular, Liu and Zaccarin (1993) proposed the alternating subsampling search algorithm (ASSA). The ASSA reduces the computation by subsampling the pixels instead of limiting the search locations. It was shown that ASSA has nearly the same MSE performance as the full search but its complexity is only 1/4 of the full search. We generalize the idea to the multi-stage case. Simulation results show that the proposed algorithm has a comparable performance to the ASSA but it has a much lower computational cost.
Reliability of e-mail delivery in the era of spam
Authors: Tomasz R. Surmacz
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

E-mail system has been designed once to be one of the most reliable internet services. All possible steps were taken in the protocol to assure either a positive delivery of e-mail or the return of an error message. This is now circumvented in many ways by various antispam techniques and the SMTP protocol cannot be considered reliable anymore. The paper discusses some of the current SMTP protocol modifications that are considered harmful and proposes a way for maintaining the reliability of the protocol while increasing the immunity to spam.
Integrated Management of Company Processes and Standard Processes: A Platform to Prepare and Perform Quality Management Appraisals
Authors: Stefan Jablonski, Matthias Faerber
Venue: Proceedings of the 5th International Workshop on Software Quality (2007)

Business processes have been introduced in many companies during the last years. But it was not clear how to measure the quality of these processes. ISO/IEC 15504 and CMMI have filled this gap and provide measurement frameworks to assess the maturity of processes. However, introducing and adapting processes to comply with these standards is difficult and error-prone. Especially the integration of the requirements of the standards into the company processes is hard to accomplish. In this paper we propose an integrated process modeling approach that is able to bridge the gap between business processes and requirements of the standards. Building on this integrated model we are able to produce reports that systematically uncover and display weaknesses in the process.
HP scalable computing architecture
Authors: Randy Wright, Arun Kumar
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

The HP V-Class server family provides up to 32 processors and 32 GB of memory in a single cabinet. Scalable Computing Architecture technology allows multiple V-Class cabinets to be interconnected, forming a single cache coherent non-uniform memory architecture (ccNUMA) system providing up to 128 CPUs and 128 GB of memory. This paper discusses some interesting aspects of the Scalable Computing Architecture and the changes made to the HP-UX kernel to operate in this environment.
Prediction of a stationary signal with missing observations
Authors: P. Bondon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The problem of predicting a discrete-time stationary signal whose past is altered by some missing observations with arbitrary pattern is investigated. The autoregressive (AR) representation of the optimal linear mean-square predictor is obtained under the classical sufficient conditions of existence of such a representation for the predictor based on the complete past. These conditions hold for instance for an ARMA signal. The calculation of the AR representation requires to invert a matrix whose dimension depends on the number of missing values but is independent of their pattern, and whose elements depend only on the AR parameters of the signal. Some properties of the AR representation of the predictor for a finite order AR signal are derived.
Where are we with Haptic Visualization?
Authors: Jonathan C. Roberts, Sabrina Paneels
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

There is a growing interest into non-visual forms of data communication, not only driven by the need for accessible representations but also because researchers are realizing the potential of understanding information better or differently through other modalities. Thus, haptic visualization is an immature but exciting area; it represents the abstract realization of information through the use of tactile or force-feedback devices. Through such a realization the user can gain quantitative, qualitative or nominal understanding of some underlying data. This paper presents the growth and development of haptic visualization, shows current trends, and acts as a snapshot of history. In fact, we remember the past based on temporal landmarks: we remember what we were doing when we heard the news of 9/11. Thus it is interesting and useful to look at the subject in the context of key events and seminal work. Moreover, it helps us to not re-invent the wheel: something that is far too common with interdisciplinary work. Thus, we take a holistic approach to the literature and place the research in context of important historic events and seminal work, which shows the reader where we have been, and points towards the future.
A Distributed Hardware Mechanism for Process Synchronization on Shared-Bus Multiprocessors
Authors: Donald Johnson, David Lilja, John Riedl
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Several techniques have been used to reduce the performance impact of process synchronization in fine-grained multiprocessor systems. These existing techniques tend to have long synchronization times or high shared-bus use, or they require complex and expensive hardware. A new technique is presented that uses distributed hardware locking queues to reduce both contention and latency to the minimum values that can be obtained using a shared-bus. This technique is shown to require at most two shared-bus transactions, with one transaction being typical. The latency for process continuation after obtaining a lock is reduced to near zero. Barrier synchronization using this distributed mechanism requires only one shared-bus transaction per processor involved in the barrier. This new technique is scalable and applicable to both new architectures and to existing systems, and is less complex than other hardware solutions.
The Use of Maple Platform for the Study of Geodesic Motion on Curved Spacetimes
Authors: Dumitru N. Vulcanov, Valentina D. Vulcanov
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The article illustrates the graphical study of geodesic motion on curved space-times (mainly exact solutions of Einstein equations) using the symbolic, numerical and graphical computation facilities of Maple platform. The example of null geodesics on Schwarzschild solution is completely processed. The geodesic curves are plotted directly using DEtools package in Schwarzschild coordinates.
Information measure based stochastic system identification of ATM network traffic
Authors: Baibing Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

For ATM network traffic, a new approach based on the Kullback-Leibler (1959) information measure is proposed for stochastic system identification of packet traffic. This approach, equivalent to the maximum marginal likelihood estimate, can overcome the over-modeling problem discussed by De Cock and De Moor. (see Proceedings of ELISIPCO-98, 1998) such that much more parsimonious model order N can be obtained, and then can lead to a significant reduction in the latter queueing analysis involving in O(N/sup 3/) computational complexity. A practical case study is provided for a set of Internet traffic data.
Automatic Failure Detection with Separation of Concerns
Authors: P. Hazy, R. E. Seviora
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The paper considers automatic, specification-based detection of failures (differences between observed and specified behavior) in external behavior of software systems. The external behavior is recorded in traces, which are analyzed for the presence of failures. The paper describes a novel failure detection technique. The technique is applicable to multi-user systems which are reactive, session-oriented and specified in formalisms based on communicating extended finite state machines. It separates the failure detection concerns into two parts, the detection of failures directly noticeable by individual users, and the determination whether the individually correct local behaviors are globally consistent with the specification. An experimental evaluation of the technique on the control program for a small telephone exchange is also presented.
Visualising Australian Indigenous Knowledge Practices Using The Game Engine
Authors: Theodor G. Wyeld
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Traditional perceptions about how to represent cultural knowledge differ from region to region: India has its isometric representation for which a convention exists within a regional practice for its interpretation; China adopts a similar technique in the form of a scroll, which is as much about describing a story with visual clues as it is about depicting a real scene; Japan extends the Chinese scroll by adapting it to an unfolding screen. In so doing, it gains both literal and metaphorical depth; the Mesoamerican (Aztec, Mayan, and Incan) communicates space of cosmic scale in the form of elaborate two-dimensional chartings or mappings completely filling the surface they are applied to; the ritualistic art of indigenous Africans and Oceania communicates their cultural narratives through carvings, weavings, assemblages, ceremonies, song, dance, and so on; and, in a similar manner, Australian Aborigines hold memories in a virtual space described through abstract sand paintings, dance and song. With few material possessions and no written language, Australia's Aborigines impart their subconscious ethereal landscapes by projecting them onto the physical world. Despite being far from an exhaustive overview, and an over generalisation of culturally alternate knowledge representation, what could we (in the West) learn from these diverse methods? Few are offered by the literature on knowledge representation. Most discussion is primarily from a narrow ontological point of view which tends to facilitate the perpetuation of popular understandings of the universality of visual media in the West. Today, the sheer ubiquity of mainstream (technologically processed) imagery threatens to homogenise global visual communication. A brief survey of contemporary versions of traditional indigenous tangible knowledge representational forms suggests there has been a subtle shift from three-dimensional, tactile, haptic, representations - carving, impressions in sand, elaborate weavings, assemblages, castings, masks - to twodimensional or flattened, printed, photographed, dyedon- cloth versions more easily sold to collectors, tourists, museums, researchers and so on. This reflects the West's inherent reliance on two-dimensional recording media TV, print, film and so on.
Low-Depth Witnesses are Easy to Find
Authors: Luis Antunes, Lance Fortnow, Alexandre Pinto, Andre Souto
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomial-time- bounded Kolmogorov complexity and traditional Kolmogorov complexity. We show unconditionally how to probabilistically find satisfying assignments for formulas that have at least one assignment of logarithmic depth. The converse holds under a standard hardness assumption though fails if BPP = FewP = EXP. We also show that assuming good pseudorandom generators one cannot increase the depth of a string efficiently.
Sampling in Open Source Software Development: The Case for Using the Debian GNU/Linux Distribution
Authors: Sebastian Spaeth, Matthias Stuermer, Stefan Haefliger, Georg von Krogh
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Research on open source software (OSS) projects often focuses on the SourceForge collaboration platform. We argue that a GNU/Linwr distribution, such as Debian, is better suited for the sampling ofprojects because it avoids biases and contains unique information only available in an integrated environment. Especially research on the reuse of components can build on dependency information inherent in the Debian GNU/Linux packaging system. This paper therefore contributes to the practice of sampling methods in OSS research and provides empirical data on reuse dependencies in Debian.