ppxscal/embedding_network huggingface dataset:
Medium Access and Flow Management in IEEE 802.11 and 802.11e WLANS
Authors: Ammar Abbas, Ibrahim M. Hussain, Tauseef Mubeen
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

With the increasing demand of multimedia services over internet and local area networks, techniques to provide better data rate, low latency and low packet loss have also emerged. For this reason, IEEE has introduced a standard for local area networks known as IEEE 802.11e. In this paper, we provide a comparative analysis of basic and new standard in terms of medium access technique and management of multiple flows. NS2 is used as a simulation tool and different traffic types like CBR, VBR and FTP are used to completely analyze the performance differences between two standards. The enhanced standard is found better in protecting and providing less delay in medium access to high priority flows.
The average-case complexity of counting distinct elements
Authors: David P. Woodruff
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1 &plusmn; &epsilon;) factor. It is known that if the stream may consist of arbitrary data arriving in an arbitrary order, then any 1-pass algorithm requires &Omega;(1/&epsilon;2) bits of space to perform this task. To try to bypass this lower bound, the problem was recently studied in a model in which the stream may consist of arbitrary data, but it arrives to the algorithm in a random order. However, even in this model an &Omega;(1/&epsilon;2) lower bound was established. This is because the adversary can still choose the data arbitrarily. This leaves open the possibility that the problem is only hard under a pathological choice of data, which would be of little practical relevance. We study the average-case complexity of this problem under certain distributions. Namely, we study the case when each successive stream item is drawn independently and uniformly at random from an unknown subset of d items for an unknown value of d. This captures the notion of random uncorrelated data. For a wide range of values of d and n, we design a 1-pass algorithm that bypasses the &Omega;(1/&epsilon;2) lower bound that holds in the adversarial and random-order models, thereby showing that this model admits more space-efficient algorithms. Moreover, the update time of our algorithm is optimal. Despite these positive results, for a certain range of values of d and n we show that estimating the number of distinct elements requires &Omega;(1/&epsilon;2) bits of space even in this model. Our lower bound subsumes previous bounds, showing that even for natural choices of data the problem is hard.
Semi-supervised Learning from General Unlabeled Data
Authors: Kaizhu Huang, Zenglin Xu, Irwin King, Michael R. Lyu
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We consider the problem of Semi-supervised Learning (SSL) from general unlabeled data, which may contain irrelevant samples. Within the binary setting, our model manages to better utilize the information from unlabeled data by formulating them as a three-class ($-1,+1, 0$) mixture, where class $0$ represents the irrelevant data. This distinguishes our work from the traditional SSL problem where unlabeled data are assumed to contain relevant samples only, either $+1$ or $-1$, which are forced to be the same as the given labeled samples. This work is also different from another family of popular models, universum learning (universum means "irrelevant" data), in that the universum need not to be specified beforehand. One significant contribution of our proposed framework is that such irrelevant samples can be automatically detected from the available unlabeled data, even though they are mixed with relevant data. This hence presents a general SSL framework that does not force "clean" unlabeled data.More importantly, we formulate this general learning framework as a Semi-definite Programming problem, making it solvable in polynomial time. A series of experiments demonstrate that the proposed framework can outperform the traditional SSL on both synthetic and real data.
On modeling neural-network protection facilities for computer-aided systems: A formal model of adaptation and operation. II
Authors: L. G. Nesteruk, F. G. Nesteruk, G. F. Nesteruk
Venue: Automation and Remote Control (2009)

A formal description of the processes in the neural-network information protection facilities for the computer-aided systems representable as an oriented graph was submitted for discussion. Some propositions concerning parallelism of activation of the graph operator vertices and transformation of its topology were proved.
SpamED: A spam E-mail detection approach based on phrase similarity
Authors: Maria Soledad Pera, Yiu-Kai Ng
Venue: Journal of the American Society for Information Science and Technology (2009)

E-mail messages are unquestionably one of the most popular communication media these days. Not only are they fast and reliable but also free in general. Unfortunately, a significant number of e-mail messages received by e-mail users on a daily basis are spam. This fact is annoying since spam messages translate into a waste of the user's time in reviewing and deleting them. In addition, spam messages consume resources such as storage, bandwidth, and computer-processing time. Many attempts have been made in the past to eradicate spam; however, none has proven highly effective. In this article, we propose a spam e-mail detection approach, called SpamED, which uses the similarity of phrases in messages to detect spam. Conducted experiments not only verify that SpamED using trigrams in e-mail messages is capable of minimizing false positives and false negatives in spam detection but it also outperforms a number of existing e-mail filtering approaches with a 96&percnt; accuracy rate. &copy; 2009 Wiley Periodicals, Inc.
Matrix columns allocation problems
Authors: Amos Beimel, Boaz Ben-Moshe, Yehuda Ben-Shimol, Paz Carmi, Eldad Chai, Itzik Kitroser, Eran Omri
Venue: Theoretical Computer Science (2009)

Orthogonal Frequency Division Multiple Access (OFDMA) transmission technique is gaining popularity as a preferred technique in the emerging broadband wireless access standards. Motivated by the OFDMA transmission technique we define the following problem: Let M be a matrix (over R) of size axb. Given a vector of non-negative integers C->= such that @?c"j=a, we would like to allocate a cells in M such that (i) in each row of M there is a single allocation, and (ii) for each element c"i@?C-> there is a unique column in M which contains exactly c"i allocations. Our goal is to find an allocation with minimal value, that is, the sum of all the a cells of M which were allocated is minimal. The nature of the suggested new problem is investigated in this paper. Efficient algorithms are suggested for some interesting cases. For other cases of the problem, NP-hardness proofs are given followed by inapproximability results.
LP-oriented upper bounds for the weighted stability number of a graph
Authors: P. I. Stetsyuk, A. P. Lykhovyd
Venue: Cybernetics and Systems Analysis (2009)

Upper bounds for the weighted stability number of a graph are considered that are based on the approximation of its stable set polytope by linear inequalities for odd cycles and p-wheels in the graph. Algorithms are developed for finding upper bounds on the basis of solution of LP problems with a finite number of inequalities produced by the shortest path algorithm for a special graph. The results of test experiments are given for graphs with several hundred or thousand vertices.
Green Introspection
Authors: Kirk W. Cameron
Venue: Computer (2009)

The same computing technologies pioneered by the hippie geeks of Silicon Valley in the 1970s are now contributors to the energy crisis we face today.
A Model for Ranking Entities and Its Application to Wikipedia
Authors: Gianluca Demartini, Claudiu S. Firan, Tereza Iofciu, Ralf Krestel, Wolfgang Nejdl
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

Entity Ranking (ER) is a recently emerging search task in Information Retrieval, where the goal is not finding documents matching the query words, but instead finding entities which match types and attributes mentioned in the query. In this paper we propose a formal model to define entities as well as a complete ER system, providing examples of its application to enterprise, Web, and Wikipedia scenarios. Since searching for entities on Web scale repositories is an open challenge as the effectiveness of ranking is usually not satisfactory, we present a set of algorithms based on our model and evaluate their retrieval effectiveness. The results show that combining simple Link Analysis, Natural Language Processing, and Named Entity Recognition methods improves retrieval performance of entity search by over 53% for P@10 and 35% for MAP.
A linearization framework for unconstrained quadratic (0-1) problems
Authors: Serigne Gueye, Philippe Michelon
Venue: Discrete Applied Mathematics (2009)

In this paper, we are interested in linearization techniques for the exact solution of the Unconstrained Quadratic (0-1) Problem. Our purpose is to propose ''economical'' linear formulations. We first extend current techniques in a general linearization framework containing many other schemes and propose a new linear formulation. Numerical results comparing classical, Glover's and the new linearization are reported.
Numerical simulation of multi-species biofilms in porous media for different kinetics
Authors: Benito M. Chen-Charpentier, Dobromir T. Dimitrov, Hristo V. Kojouharov
Venue: Mathematics and Computers in Simulation (2009)

There are bacteria that can form strong biofilms in porous media. These biofilms can be used as biobarriers to restrict the flow of pollutants. For certain contaminants, a second species of bacteria that can actually react with the contaminants can be added to the biobarrier to actually degrade the pollutants. We propose some mathematical models for the formation of these reacting biobarriers under different hypotheses, and numerically solve the resulting equations for the flow, transport and reactions. Qualitative comparisons with some experimental results are also given.
On the Breakdown Point of the Hough Transform
Authors: Shreyas B. Guruprasad
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

The degree of robustness of the Hough Transform is examined through its breakdown point by using a noise model called the adversarial noise model. The result thus obtained is compared with existing values in literature and differences are described. An interesting link between the Hough Transform technique and error correction codes is also shown.
Fingerprint Image Compression Based on Directional Filter Banks and TCQ
Authors: Song Zhao, Xiao-Fei Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

A novel compression algorithm for fingerprint image is proposed. Wavelet-Based Contourlet Transform (WBCT), which is based on wavelet transform and directional filter banks (DFBs), can be capable of efficiently approximating natural images containing contours and oscillatory patterns. To reduce frequency scrambling, a new scheme based on maximally-flat filters which implements the DFBs is proposed. A quadtree sorting procedure, similar to SPIHT, is used to explicitly form classes of WBCT coefficients. The classes are encoded using arithmetic and trellis-coded quantization. The resulting encoding algorithm offers consistent improvement over SPIHT performance. Simulations show that the new encoding algorithm provides improved encoding performance over SPIHT and preserves more fingerprint image details.
A Robust Priority Assignment Mechanism for Video Data over Managed IP Networks
Authors: Ya-Ju Yu, Chu-Chuan Lee, Pao-Chi Chang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper proposes a Flexible Significance Classification (FSC) mechanism for video data over managed IP networks. FSC determines the video packet significance in both temporal and spatial domains. In the temporal domain, FSC evaluates the packet significance based on the estimated error propagation provided a packet is lost. In the spatial domain, FSC computes the packet significance based on the content complexity in a packet. Compared with traditional significance classification scheme, simulation results show that the proposed mechanism can significantly improve the accuracy of signification determination by up to 13% and effectively improve the received video quality by up to 0.54dB in PSNR.
Tarboy
Authors: James Lee
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

Arising from the tar pit where millions of robot slaves were banished to death, the Tarboy seeks revenge on the realm's corporate rulers.
First demonstration on all-optical 40 Gbit/s logic AND gate for carrier-suppressed return-to-zero signals
Authors: Jian Wang, Deming Liu, Junqiang Sun, Hairong Liu, Qizhen Sun, Dexiu Huang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We experimentally demonstrate all-optical 40 Gbit/s logic AND gate for carrier-suppressed return-to-zero (CSRZ) signals using cascaded second-harmonic generation and difference-frequency generation (cSHG/DFG) in a periodically poled lithium niobate (PPLN) waveguide. The AND result takes CSRZ format.
Novel multiple-selected and multiple-valued memory design using negative differential resistance circuits suitable for standard SiGe-based BiCMOS process
Authors: Kwang-Jow Gan, Cher-Shiung Tsai, Dong-Shong Liang
Venue: Analog Integrated Circuits and Signal Processing (2009)

A novel multiple-selected and multiple-valued memory (MSMVM) design using the negative differential resistance (NDR) circuits is demonstrated. The NDR circuits are made of Si-based metal-oxide-semiconductor field-effect-transistor (MOS) and SiGe-based heterojunction bipolar transistor (HBT). During suitably designing the parameters and connecting three MOS---HBT---NDR circuits, we can obtain the three-peak current---voltage (I---V) curves with different peak currents in the combined I---V characteristics. For the traditional resonant-tunneling-diode (RTD) memory circuit, one can only obtain four-valued memory states using a constant current source to bias the three-peak NDR circuit. However in this paper, we utilize two switch-controlled current sources to bias the three-peak NDR circuit at different current levels. By controlling the switches on and off alternatively, we can obtain the four-valued, three-valued, two-valued, and one-valued memory levels under the four different conditions. Our design is based on the standard 0.35 μm SiGe BiCMOS process.
Theoretical investigation of the alkali-dimer cation K$_{2}^{+}$: Potential energy, dipole moment and atomic polarizabilities
Authors: H. Berriche, C. Ghanmi, M. Farjallah, H. Bouzouita
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

The potential energy curves of the electronic states of $^{2}$&Sigma;$^{+}_{g, u}$, $^{2}$&Pi;$ _{g, u}$ and $^{2}$&Delta;$_{g, u}$ symmetries of the K$_{2}^{+}$ molecular ionic system dissociating into K (4s, 4p, 5s, 3d, 5p, 4d and 6s) + K$^{+}$, have been calculated. The computation was performed using an ab initio approach, where a non-empirical pseudopotential for the K$^{+}$ core has been involved and a core-core and core valence correlation corrections have been added. The spectroscopic constants have been derived and compared with the available theoretical and experimental works. A good agreement has been obtained for the ground and the first excited states. However, a clear disagreement between this study and the model potential work of Magnier and Aubert-Fr&eacute;con [J. Quant. Spect. Rad. Trans. 78, 2003] has been observed for several excited states. They found that the 5$^{2}$&Sigma;$^{+}_{u}$, 6$^{2}$&Sigma;$^{+}_{g}$, 6$^{2}$&Sigma;$^{+}_{u}$, 7$^{2}$&Sigma;$^{+}_{g}$, 7$^{2}$&Sigma;$^{+}_{u}$, 4$^{2}$&Pi;$_{g}$ and 2$^{2}$&Delta;$_{u}$ states are repulsive, although they are attractive with potential well depths of 10, 100 and 1000 cm$^{-1}$ in our study. Furthermore, the atomic polarizabilities have been predicted from a vibrational spacing analysis based on the WKB approximation applied on the potential energy at long-range distances. These polarizabilities have been used to reproduce the long range potential interaction for some electronic states.
Interaction Reproducing Model: A Model for Giving Supports Appropriate to User State
Authors: Hideki Aoyama, Motoyuki Ozeki, Yuichi Nakamura
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper presents a novel Interaction Reproducing Model (IRM) for the purpose of adjusting computer user support to match the state of the user, and it consists of a set of Interaction Finite State Machines (I-FSMs). Each I-FSM is trained using actual interaction records, and it represents an ideal interaction pattern for a user state. It can choose an appropriate system action by reproducing the interaction pattern of the I-FSM most similar to the current interaction. We developed a prototype teaching system, and conducted preliminary experiments. The results show that user impressions using our approach were better than when using the system without our approach.
Semantic Web Constraint Language and its application to an intelligent shopping agent
Authors: Hak-Jin Kim, Wooju Kim, Myungjin Lee
Venue: Decision Support Systems (2009)

Semantic Web society was initially focused only on data, but then gradually moved toward knowledge. If a vision of the Semantic Web is to enhance humans' decision-making assisted by machines, a missing but important part is knowledge about constraints on data and concepts represented by ontology. This paper proposes a Semantic Web Constraint Language (SWCL) based on OWL, and shows its effectiveness in representing and solving an internet shopper's decision-making problems by implementing a shopping agent in the Semantic Web environment.
The Design of Way-Prediction Scheme in Set-Associative Cache for Energy Efficient Embedded System
Authors: Chia-Ying Tseng, Hsin-Chu Chen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Embedded System develops rapidly, functions turn into more complicate, and multi-media applications are growing daily and they consume more electrical power. Therefore, how to improve stand-by time will become a very important issue. Related researches indicate that the power consumption of processor cache is accounted for a big proportion. Way-prediction and LRU (Least Recently Used) algorithms improve hit rate and would help in reducing the number of tag comparisons, and therefore save energy consumption. In this paper, we use MRU (Most Recently Used) table to record the most used block for each index and use Modified Pseudo LRU (MPLRU) Replacement algorithm for reducing hardware complexity and cache miss rate.Experiments show our prediction hit rate reach 90.15%, thus save 64.12% energy. The experimental results are obtained by using Wattch cache simulator for SPEC95 benchmarks.
Associating fonts with musical genres
Authors: Jukka Holm, Antti Aaltonen, Jarno Seppänen
Venue: Proceedings of the 6th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa (2009)

We arranged an online questionnaire to study the feasibility of representing musical genres with fonts. The questionnaire consisted of 17 figures and each of them contained three text strings with different fonts. In each figure, the participants were asked which musical genre comes to their mind when looking at the text strings. The results suggest that the musical genre may be presented by a font and it can be recognized quite accurately. The most successful font collections were: classical (90.9% of participants made the same association between font and genre), metal (87.3%), country (85.5%), electronica amp; dance (83.6%), and world music (58.2%). On the average, the participants made the correct association in nearly seven cases out of 17.
R-OSGi: distributed applications through software modularization
Authors: Jan S. Rellermeyer, Gustavo Alonso, Timothy Roscoe
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

In this paper we take advantage of the concepts developed for centralized module management, such as dynamic loading and unloading of modules, and show how they can be used to support the development and deployment of distributed applications. We do so through R-OSGi, a distributed middleware platform that extends the centralized, industry-standard OSGi specification to support distributed module management. To the developer, R-OSGi looks like a conventional module management tool. However, at deployment time, R-OSGi can be used to turn the application into a distributed application by simply indicating where the different modules should be deployed. At run time, R-OSGi represents distributed failures as module insertion and withdrawal operations so that the logic to deal with failures is the same as that employed to deal with dependencies among software modules. In doing so, R-OSGi greatly simplifies the development of distributed applications with no performance cost. In the paper we describe R-OSGi and several use cases. We also show with extensive experiments that R-OSGi has a performance comparable or better than that of RMI or UPnP, both commonly used distribution mechanisms with far less functionality than R-OSGi.