ppxscal/embedding_network huggingface dataset:
A TDMA Based Scheduling Scheme in 802.11b WLANs with Access Point
Authors: Osama Abu-Sharkh, Ahmed H. Tewfik
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper introduces a new scheduling scheme that provides fair access to all stations in 802.11b WLANs. The scheme divides the transmission opportunities between wireless stations according to their operating conditions. Stations that face errors and can't communicate with the access point are given more transmission time at the moment these errors reduce to compensate for their loss of service. In 802.11b wireless stations can operate at different data rates 11, 5.5, 2 and 1 Mbps. From the literature and our simulation we found that operating at lower data rates would degrade the overall performance of the system. Still, it is impractical in developing a schedule scheme to assume that a wireless station can only operate at full data rate as similar previous work. Our scheduling scheme takes in consideration that some stations may operate at data rates lower than 11Mbps. Simulation results show that fairness between mobile stations is almost achieved.
How to prepare tomorrow's technologists for global networks of innovation
Authors: Satish Nambisan
Venue: Communications of the ACM (2005)

University curricula must prepare them to be able to recognize and embrace technologies, components, markets, and customers wherever in the world they happen to be.
Space monitoring of the environment and global safety
Authors: G. M. Chernyavsky
Venue: Mathematics and Computers in Simulation (2004)

The role and importance of the space monitoring of the environment is discussed. It is noted that the Earth remote sensing (ERS) from space, which, as well as the space activity as a whole, plays important part in the world community informatization process.
A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams
Authors: Guoli Li, Shuang Hou, Hans-Arno Jacobsen
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The challenge faced by content-based publish/subscribe systems is the ability to handle a vast amount of dynamic information with limited system resources. In current p/s systems, each subscription is processed in isolation. Neither relationships among individual subscriptions are exploited, nor historic information about subscriptions and publications is taken into account. We believe that this neglect limits overall system efficiency. In this paper, we represent subscriptions using modified binary decision diagrams (MBDs), and design an index data structure to maintain distinct predicates and manage associated Boolean variables. Our MBD-based approach can address, in a unified way, publication routing andsubscription/advertisement covering and merging. We propose a novel covering algorithm based on MBDs. The algorithm can take historic information about subscription and publication populations into account and exploits relations between subscriptions.We explore merging, especially imperfect merging, and discuss an advertisement-based optimization applicable to subscription merging.
Adaptive Policy Trigger Mechanism for OBSS
Authors: Dan Feng, Lingfang Zeng, Fang Wang, Lingjun Qin, Qun Liu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Traditional storage systems, such as NAS, SAN, are largely unaware of the users and applications actually using the storage, because block-based storage devices manage opaque data blocks. But, with OBSS (object-based storage system), the attributes and methods among the storage devices can be adopted in the storage system, the data can be distributed on some of the storage devices and organized better to anticipate users demand. In this paper, the scalability of object storage (including object attributes, object methods and OBSS) is studied. And a self-managing approach, denoted adaptive policy trigger mechanism (APTM), is presented. APTM borrows proven machine learning techniques and takes the perspective scalable object storage. The implementation reveals that APTM is the embodiment of the idea about smart storage device and facilitates to self-manage mass storage system.
Visual data mining in software archives
Authors: Michael Burch, Stephan Diehl, Peter Weißgerber
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

Software archives contain historical information about the development process of a software system. Using data mining techniques rules can be extracted from these archives. In this paper we discuss how standard visualization techniques can be applied to interactively explore these rules. To this end we extended the standard visualization techniques for association rules and sequence rules to also show the hierarchical order of items. Clusters and outliers in the resulting visualizations provide interesting insights into the relation between the temporal development of a system and its static structure. As an example we look at the large software archive of the MOZILLA open source project. Finally we discuss what kind of regularities and anomalies we found and how these can then be leveraged to support software engineers.
Integrated Feasibility Experiment for Bio-Security: IFE-Bio a TIDES demonstration
Authors: Lynette Hirschman, Kris Concepcion, Laurie Damianos, David Day, John Delmore, Lisa Ferro, John Griffith, John Henderson, Jeff Kurtz, Inderjeet Mani, Scott Mardis, Tom McEntee, Keith Miller, Beverly Nunan, Jay Ponte, Florence Reeder, Ben Wellner, George Wilson, Alex Yeh
Venue: Proceedings of the first international conference on Human language technology research (2001)

As part of MITRE's work under the DARPA TIDES (Translingual Information Detection, Extraction and Summarization) program, we are preparing a series of demonstrations to showcase the TIDES Integrated Feasibility Experiment on Bio-Security (IFE-Bio). The current demonstration illustrates some of the resources that can be made available to analysts tasked with monitoring infectious disease outbreaks and other biological threats.
Learning to Rank
Authors: Andrew Trotman
Venue: Information Retrieval (2005)

New general purpose ranking functions are discovered using genetic programming. The TREC WSJ collection was chosen as a training set. A baseline comparison function was chosen as the best of inner product, probability, cosine, and Okapi BM25. An elitist genetic algorithm with a population size 100 was run 13 times for 100 generations and the best performing algorithms chosen from these. The best learned functions, when evaluated against the best baseline function (BM25), demonstrate some significant performance differences, with improvements in mean average precision as high as 32% observed on one TREC collection not used in training. In no test is BM25 shown to significantly outperform the best learned function.
Some local search algorithms for no-wait flow-shop problem with makespan criterion
Authors: Józef Grabowski, Jarosław Pempera
Venue: Computers and Operations Research (2005)

This paper develops and compares different local search algorithms for the no-wait flow-shop problem with makespan criterion (Cmax). We present several variants of descending search and tabu search algorithms. In the algorithms the multimoves are used that consist in performing several moves simultaneously in a single iteration of algorithm and allow us to accelerate the convergence to good solutions. Besides, in the tabu search algorithms a dynamic tabu list is proposed that assists additionally to avoid trapped at a local optimum. The proposed algorithms are empirically evaluated and found to be relatively more effective in finding better quality solutions than existing algorithms. The presented ideas can be applied in any local search procedures.
Generating BDDs for symbolic model checking in CCS
Authors: Reinhard Enders, Thomas Filkorn, Dirk Taubner
Venue: Distributed Computing (1993)

Finite transition systems can easily be represented by binary decision diagrams (BDDs) through the characteristic function of the transition relation. Burch et al. have shown how model checking of a powerful version of the µ-calculus can be performed on such BDDs. In this paper we show how a BDD can be generated from elementary finite transition systems given as BDDs by applying the CCS operations of parallel composition, restriction, and relabelling. The resulting BDDs only grow linearly in the number of parallel components. This way bisimilarity checking can be performed for processes out of the reach of conventional process algebra tools.
DAC Insider's Guide
Authors: Pat Hefferan
Venue: ACM SIGDA Newsletter (1991)

The 28th Design Automation Conference (DAC) will be held in San Francisco, California from June 17 through June 21st. The exhibits will not open on Sunday afternoon (as in the past) in observance of Father's Day. I suspect however, that all the applications engineers and exhibit managers will be working on Sunday. San Francisco is an excellent venue for the conference being in the homeland of the CAD vendors. Also, we can expect strong Pacific Rim attendance.
Accurate direction-of-arrival estimation of multiple sources using a genetic approach: Research Articles
Authors: Ming-Hui Li, Yi-Long Lu
Venue: Wireless Communications Mobile Computing (2005)

In this paper, we present an accurate direction-of-arrival (DOA) estimation method, which is based on the maximum likelihood (ML) principle and implemented using a modified and refined genetic algorithm (GA). With the newly introduced features&mdash;intelligent initialization and the emperor-selective (EMS) mating scheme, carefully selected crossover and mutation operators and fine-tuned parameters such as the population size, the probability of crossover and mutation etc., the GA-ML estimator achieves fast global convergence. A GA operator and parameter standard is suggested for this application, which is independent of the source and array configurations except the number of sources. Simulation results demonstrate that in general scenarios, the proposed estimator is the most efficient in computation and its statistical performance is the best among all popular ML-based DOA estimation methods. Copyright &copy; 2004 John Wiley & Sons, Ltd.
AVATAR: an approach based on semantic reasoning to recommend personalized TV programs
Authors: Yolanda Blanco, José J. Pazos, Alberto Gil, Manuel Ramos, Ana Fernández, Rebeca P. Díaz, Martín López, Belén Barragáns
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper a TV recommender system called AVATAR (AdVAnce Telematic search of Audiovisual contents by semantic Reasoning) is presented. This tool uses the experience gained in the field of the Semantic Web to personalize the TV programs shown to the end users. The main contribution of our system is a process of semantic reasoning carried out on the descriptions of the TV contents ---provided by means of metainformation--- and on the viewer preferences --- contained in personal profiles. Such process allows to diversify the offered suggestions maintaining the personalization, given that the aim is to find contents appealing for the users, which are related semantically to their programs of interest.Here the framework proposed for this reasoning is introduced, by including (i) the OWL ontology chosen to represent the knowledge of our application domain, (ii) the organization of the user profiles, (iii) the query language LIKO, which is intended to browse the ontology and (iv) the semantic relations inferred from the system knowledge base.
An Empirical Study On the Vectorization of Multimedia Applications for Multimedia Extensions
Authors: Gang Ren, Peng Wu, David Padua
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Multimedia extensions (MME) are architectural extensions to general-purpose processors to boost the performance of multimedia workloads. Today, in-line assembly code, intrinsic functions and library routines are the most common means to program these extensions. A promising alternative is to exploit vectorization technology to automatically generate MME instructions from programs written in standard high-level languages. However, despite the early success of automatic vectorization for traditional vector supercomputers, state-of-the-art vectorizing compilers for multimedia extensions have yet to demonstrate their effectiveness, especially on multimedia workloads. In this paper, we conducted an empirical study on the vectorization of media processing programs for multimedia extensions. Our study identified several new issues that are not handled by traditional vectorizers. These issues arise partly as the result of the unique features of MME architectures, partly due to the characteristics of media processing applications. We proposed several techniques to address some of these issues. We further assessed the effectiveness of our techniques by manually applying them to a set of multimedia programs. In addition, we found that further optimizations after vectorization are essential to benefit from multimedia extensions. In our experiments, 23 of 34 core procedures from the Berkeley Media Benchmark (BMW) were manually vectorized and 14 procedures achieved speedups of 1.10 to 3.39 on a Pentium 4 processor.
Floor interaction HCI reaching new ground
Authors: Marianne Graves Petersen, Peter Gall Krogh, Martin Ludvigsen, Andreas Lykke-Olesen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Within architecture, there is a long tradition of careful design of floors. The design has been concerned with both decorating floors and designing floors to carry information. Ubiquitous computing technology offers new opportunities for designing interactive floors. This paper presents three different interactive floor concepts. Through an urban perspective it draws upon the experiences of floors in architecture, and provides a set of design issues for designing interactive floors.
Ensemble of Linear Perceptrons with Confidence Level Output
Authors: Pitoyo Hartono, Shuji Hashimoto
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In this study we introduce an ensemble of neural networks, in which each member is a linear perceptron. Our main objective is to build an ensemble of neural networks that can automatically and effectively divide the problem space and assign a subspace to each member. By assigning only a portion of the problem space, we expect that the learning difficulty for each member can be reduced, thus leading to better classification ability. To investigate the effectiveness of the proposed method in dividing the problem space, in this paper we deal with ensemble consists only of linear perceptrons, each with an additional output neuron that indicates the confidence level of the output.
Automatic text processing to enhance product search for on-line shopping
Authors: Gilles Vandelle
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

The growing eCommerce business requires an advanced way of searching for products. Buyers today are not only using the web to accomplish transactions but also to search for and select products that fit their needs. The products are now global but the users want a site that uses their language when shopping. This talk will describe how Kelkoo built a solution used across. The multiple European languages have been addressed with a simple linguistic approach combined with machine learning technologies. In this talk we will put the emphasis on the use of machine learning to address local diversity.
Scaled and permuted string matching
Authors: Ayelet Butman, Revital Eres, Gad M. Landau
Venue: Information Processing Letters (2004)

The goal of scaled permuted string matching is to find all occurrences of a pattern in a text, in all possible scales and permutations. Given a text of length n and a pattern of length m we present an O(n) algorithm.
Managing IT projects: communication pitfalls and bridges
Authors: Sharlett Gillard
Venue: Journal of Information Science (2005)

The complex nature of the matrix organizational structure presents a communication paradigm unparalled by any other management position, creating an organizational environment that is uniquely sensitive to interpersonal communications. This paper discusses the organizational environment typically found in major information systems initiatives as well as some of the interpersonal communications challenges encountered by the IT project manager. Suggestions are provided as bridges to avoid the pitfalls these challenges present.
Real-time specification patterns
Authors: Sascha Konrad, Betty H. C. Cheng
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Embedded systems are pervasive and frequently used for critical systems with time-dependent functionality. Dwyer et al have developed qualitative specification patterns to facilitate the specification of critical properties, such as those that must be satisfied by embedded systems. Thus far, no analogous repository has been compiled for real-time specification patterns. This paper makes two main contributions: First, based on an analysis of timing-based requirements of several industrial embedded system applications, we created real-time specification patterns in terms of three commonly used real-time temporal logics. Second, as a means to further facilitate the understanding of the meaning of a specification, we offer a structured English grammar that includes support for real-time properties. We illustrate the use of the real-time specification patterns in the context of property specifications of a real-world automotive embedded system.
MOM vs. RPC: Communication Models for Distributed Applications
Authors: Daniel A. Menasce
Venue: IEEE Internet Computing (2005)

An important aspect of designing a distributed application is the communication model that connects its various components. Some middleware solutions offer two of the most important communication paradigms: asynchronous messaging and remote procedure call. Message-oriented middleware lets a service's consumers physically and temporally decouple from the service providers. In contrast, RPC is a synchronous method of requesting remote service execution requiring consumers to suspend service execution until they receive a reply from the service provider.
CSFS: a Java enabled network file storage system: Research Articles
Authors: Han Hua, Dai Yafei, Li Xiaoming
Venue: Concurrency and Computation: Practice Experience (2005)

The CSFS (cryptographic storage file system) is a network file storage system that is suitable for a small-to-medium sized networks such as a campus network. In a CSFS, a lot of distributed file servers are organized in a star-liked architecture. File names are stored in a name server and file data are stored in distributed file servers. A CSFS has good scalability and is able to accommodate hundreds of file servers. We implemented a CSFS in pure Java and tested the system with a benchmark. The test results show that CSFS delivers acceptable performance for general file operations. Its performance of file upload and download is as efficient as FTP. It can support more than 450 concurrent online users. Copyright &copy; 2005 John Wiley & Sons, Ltd.
CRMA: A Novel Multiple Access Protocol for Power Efficient Wireless LAN
Authors: He Hong, Jian-Dong Li, Min Sheng
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

To improve the Binary Exponential Backoff algorithm (BEB)ýs channel throughput of IEEE 802.11 protocol, we propose a novel Collision Reduced Multiple Access (CRMA) protocol based on slow contention window decrease mechanism and runtime optimization method. CRMA protocol can record the current backoff stage of the latest successful transmission under the overload network precisely. As a result, it decreases the collision times and improves the channel utilization.
An Adaptive Soft Morphological Gradient Filter for Edge Detection
Authors: Xiaoxin Guo, Zhiwen Xu, Yunjie Pang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, a novel adaptive soft morphological gradient (ASMG) filter is proposed, based on a combination of the idea of the soft morphological filtering and the adaptive technique. ASMG filtering is an efficient nonlinear sharpening method, which can be applied for edge detection. By employing four directional structuring elements, ASMG filtering has the capability of selecting the directional structuring element with the maximum response, whose direction varies depending on the change of directional edges. In addition, by comparing the variance of the moving structuring window with the base variance, the ASMG filter provides an adaptive algorithm for morphological operations. The experimental results show that the ASMG filter is better than the traditional operators in edge detection and noise suppression.
PER model: semantic data models developing
Authors: Hristo Tujarov, Ivelin Mihailov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper treats the developing of the semantic data models. On this basis the place and the function of PER model (processes, entity, relations) are traced.
Dynamic Mapping in Energy Constrained Heterogeneous Computing Systems
Authors: Jong-Kook Kim, H. J. Siegel, Anthony A. Maciejewski, Rudolf Eigenmann
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

An ad hoc grid is a wireless heterogeneous computing environment without a fixed infrastructure. The wireless devices have different capabilities, have limited battery capacity, support dynamic voltage scaling, and are expected to be used for eight hours at a time and then recharged. To maximize the performance of the system, it is essential to assign resources to tasks (match) and order the execution of tasks on each resource (schedule) in a manner that exploits the heterogeneity of the resources and tasks while considering the energy constraints of the devices. In the single-hop ad hoc grid heterogeneous environment considered in this study, tasks arrive unpredictably, are independent (i.e., no precedent constraints for tasks), and have priorities and deadlines. The problem is to map (match and schedule) tasks onto devices such that the number of highest priority tasks completed by their deadlines during eight hours is maximized while efficiently utilizing the overall system energy. A model for dynamically mapping tasks onto wireless devices is introduced. Seven dynamic mapping heuristics for this environment are designed and compared to each other and to a mathematical bound.