ppxscal/embedding_network huggingface dataset:
Inferring document relevance from incomplete information
Authors: Javed A. Aslam, Emine Yilmaz
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Recent work has shown that average precision can be accurately estimated from a small random sample of judged documents. Unfortunately, such "random pools" cannot be used to evaluate retrieval measures in any standard way. In this work, we show that given such estimates of average precision, one can accurately infer the relevances of the remaining unjudged documents, thus obtaining a fully judged pool that can be used in standard ways for system evaluation of all kinds. Using TREC data, we demonstrate that our inferred judged pools are well correlated with assessor judgments, and we further demonstrate that our inferred pools can be used to accurately infer precision recall curves and all commonly used measures of retrieval performance.
User Modeling for the Result Re-Ranking in the Meta-Search Engines via Reinforcement Learning
Authors: Amir Hosein Keyhanipour, Behzad Moshiri, Caro Lucas
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Today there are thousands of search engines available, so it is difficult for users to know where they are, how to use them and what topics they best address. Meta-search engines reduce the users ' burden by dispatching queries to multiple search engines in parallel and combining the returned results. But there are some problems yet. One of them is that, none of them includes the user model in the answer. In this paper, we propose a mechanism to create a mapping between different categories of users and the underlying search engines using the reinforcement learning approach. By this way, the meta-search engine learns to identify which search engines are most appropriate for particular queries from different user models.
Low-resource routing attacks against tor
Authors: Kevin Bauer, Damon McCoy, Dirk Grunwald, Tadayoshi Kohno, Douglas Sicker
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

Tor has become one of the most popular overlay networks for anonymizing TCP traffic. Its popularity is due in part to its perceived strong anonymity properties and its relatively low latency service. Low latency is achieved through Torâs ability to balance the traffic load by optimizing Tor router selection to probabilistically favor routers with highbandwidth capabilities. We investigate how Torâs routing optimizations impact its ability to provide strong anonymity. Through experiments conducted on PlanetLab, we show the extent to which routing performance optimizations have left the system vulnerable to end-to-end traffic analysis attacks from non-global adversaries with minimal resources. Further, we demonstrate that entry guards, added to mitigate path disruption attacks, are themselves vulnerable to attack. Finally, we explore solutions to improve Torâs current routing algorithms and propose alternative routing strategies that prevent some of the routing attacks used in our experiments.
Application of Evolutionary Optimization Techniques for Optimal Location and Parameters Setting of Multiple UPFC Devices
Authors: H. I. Shaheen, G. I. Rashed, S. J. Cheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The Unified Power Flow Controller (UPFC) is one of the most promising Flexible Alternating Current Transmission Systems (FACTS) devices for load flow control. UPFC can effectively control the load flow distribution, improve the usage of existing system installations, and improve the stabilities of the power network. However, the location of UPFC in the system plays a significant role in achieving such benefits. This paper deals with the application of two evolutionary optimization techniques, namely: Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) to find out the optimal number, the optimal locations, and the optimal parameters setting of Multiple UPFCs devices. These variables are optimized to maximize the system loadability with minimum installation cost of UPFCs device. To show the validity of the applied techniques and for comparison purposes, we performed simulation on an IEEE 6-bus and an IEEE 14-bus test power systems. The results we've obtained show that UPFC can significantly increase the system loadability. Our results also indicate that both techniques can successfully find out the optimal location and the optimal parameters setting of Multiple UPFCs.
Managing Heterogeneous Access Networks Coordinated policy based decision engines for mobility management
Authors: C. Fan, M. Schlager, A. Udugama, V. Pangboonyanon, A. C. Toker, G. Coskun
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Next generation networks will consist of heterogeneous access networks and will provide a variety of services. In such an environment the question of the assignment of terminals to access networks and mobility management becomes a challenging problem. This is especially true when one takes the user goals and network operator goals into account. Users would like to be connected to their services over the best available access technology, where the users should be able to define what "best" means for themselves, in other terms users want to be Always- Best-Connected (ABC). The network operator has to satisfy ABC property for users who are essentially competing for resources and has to maintain the best possible utility out of its investment. This can be coined as Always-Best-Managed (ABM) networks. Taking into account that what best means for different users will be different in practice that it will not be possible to fulfill the requirements of each of the users simultaneously, and that the network itself is dynamic in nature, one can imagine the difficulty of achieving ABC and ABM continuously and simultaneously. In this paper we introduce a new approach to policy based mobility management based on two coordinated decision engines, one residing in the terminal and one in the network. We describe our architecture enabling network controlled policy based mobility management and discuss first results observed with our prototype implementation of this architecture.
Special Feature Software Engineering Concepts and Computer Science Curricula
Authors: A. I. Wasserman
Venue: Computer (1977)

The field of software engineering is beginning to emerge as an area of study dealing with the problems and methods involved in producing software systems. Within recent years, it has become apparent that programming is a much harder task than it was once thought to be, especially for large production-oriented systems involving a number of people. This concern has led to the need for educating software engineering specialists to work on the construction of such systems.
Virtual sensors for service oriented intelligent environments
Authors: Raja Bose, Abdelsalam Helal, Vishak Sivakumar, Shinyoung Lim
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Service-oriented architecture (SOA) is a popular industry standard that provides an elegant model to create and compose interoperable applications. In the case of sensor networks, SOA is considered to be a very attractive enabler for sensor programmability and self-integration. However, SOA cannot be used without additional mechanisms to enhance the reliability and availability of the sensors behind the services. In the absence of such mechanisms, sensor-based SOA could provide a false promise of service whose, quality and availability are highly questionable and cannot be guaranteed. In this paper, we propose a Virtual Sensor framework for service-oriented sensor networks with the aim of enhancing reliability, prolonging availability and enabling automatic service composability. We classify and model three useful virtual sensor concepts and present compensation algorithms for coping with sensor failure. To quantify the merit of our approach, we developed a Data Quality Indicator measure for expressing the perceived quality of virtual sensor readings.
A Novel Pruning Technique for Mining Maximal Frequent Itemsets
Authors: Fujiang Ao, Yuejin Yan, Jian Huang, Kedi Huang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Maximal frequent itemsets (MFIs) mining is important for many applications. To improve the performance of the MFI algorithms, the key is to use appropriate pruning techniques which can maximally reduce the searching space of the algorithm. In this paper, we present a novel pruning technique, subset equivalence pruning. To mining MFIs in data streams, we reconstruct the FPmax* algorithm to a single-pass algorithm, named FPmax*-DS. Subset equivalence pruning technique is added in FPmax*-DS. The experiments show that the pruning technique can efficiently reduce the searching space. Especially for some dense datasets, the size of searching space can be trimmed off by about 40%.
Coherent Optical Computing
Authors: D. Casasent
Venue: Computer (1979)

Optical computing has a great many applications in data processing, owing in part to the high speed and parallelism inherent in optical devices.
The Design of Special-Purpose VLSI Chips
Authors: M. J. Foster
Venue: Computer (1980)

Structured VLSI design proceeds from algorithm to logic cell to cell array to special-purpose chip, yielding cheap, powerful, and modular hardware that will permanently alter the systems landscape of the 80's.
FPGA/ASIC based Cryptographic Object Store System
Authors: Dan Feng, Lanxiang Chen, Lingfang Zeng, Zhongying Niu
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

To avoid re-encryption in cryptographic storage system when revoking users, Field Programmable Gate Array (FPGA) and Application Specific Integrated Circuit (ASIC) hardware module have been introduced to a cryptographic object store system, let private key never leave the hardware module and symmetric key only exist in hardware module in plaintext. Anyone doesn't know private or symmetric key, so when revoking users, it just needs to modify access control list (ACL) to delete the privileges of the users. To facilitate file sharing and key management, group is adopted. In our system, almost all computationally expensive cryptographic operations are through FPGA/ASIC hardware module. Once creator revokes some users, objects don't need re-encryption. How to use ACL and FPGA/ASIC hardware module to authenticate and authorize are described. And the procedure of object store and the distribution of meta-data are detailed. Finally, a cryptographic object store prototype system is implemented with tested and effective performance.
VLSI Processor Architecture
Authors: J. L. Hennessy
Venue: IEEE Transactions on Computers (1984)

A processor architecture attempts to compromise between the needs of programs hosted on the architecture and the performance attainable in implementing the architecture. The needs of programs are most accurately reflected by the dynamic use of the instruction set as the target for a high level language compiler. In VLSI, the issue of implementation of an instruction set architecture is significant in determining the features of the architecture. Recent processor architectures have focused on two major trends: large microcoded instruction sets and simplified, or reduced, instruction sets. The attractiveness of these two approaches is affected by the choice of a single-chip implementation. The two different styles require different tradeoffs to attain an implementation in silicon with a reasonable area. The two styles consume the chip area for different purposes, thus achieving performance by different strategies. In a VLSI implementation of an architecture, many problems can arise from the base technology and its limitations. Although circuit design techniques can help alleviate many of these problems, the architects must be aware of these limitations and understand their implications at the instruction set level.
A New Blind Adaptive Multiuser Detection Algorithm of Kalman Filtering Based on Subspace
Authors: Deng-Ao Li, Ju-Min Zhao, Yong-Chao Shi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

To solve the problem of multiple-access interference(MAI) in the DS-CDMA system, this paper analyzed the blind adaptive multiuser detection algorithm of Kalman filtering proposed by Zhang Xianda etc., and put forward a new algorithm based on subspace to reduce the computation complexity. The simulation results show that the new algorithm has better convergence performance in non-fading channels as well as in slowly time-varying Rayleigh fading channels.
Adaptive REACT protocol for Emergency Applications in Vehicular Networks
Authors: Erwin Van de Velde, Chris Blondia
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Vehicular communication is gaining more and more interest from big consortia and companies in the car industry. Wireless communication in a vehicular environment creates unique opportunities but poses also its own challenges. Therefore we proposed in previous work a new routing protocol, REACT, which uses geographical information and is able to react to a fast changing environment. In this paper, we will look at a few optimizations for this protocol in order to make it more adaptive to the current network conditions. As vehicles move very fast, link breaks occur more often.We attempt to predict this behavior, trying to use a link as long as possible but not longer than it really exists. Another important part of the REACT protocol consists of beaconing as means of exchanging position information with neighbors. The interval between two consecutive beacons is an important parameter in determining the end-to-end delay and we propose an algorithm that adapts this parameter in order to speed up neighbor discovery without generating too much beaconing overhead. The two optimizations were implemented and tested in a simulator and the results show a performance amelioration in the end-to-end delay in scenarios with sparse and dense road traffic.
Fault Tolerant Source Routing for Network-on-chip
Authors: Young Bok Kim, Yong-Bin Kim
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

This paper presents a new routing protocol of network-on-chip(Noc) called "Source Routing for Noc" (SRN) for fault tolerant communication of Systems-on-chip(Soc). The proposed SRN algorithm is composed of two mechanisms of Route Discovery and Route maintenance to allow nodes to discover and maintain source routes to arbitrary destinations in Noc, and all aspects of the protocol operate entirely on-demand allowing the routing packet overhead to scale automatically based on its need. The SNR algorithm in this paper demonstrates up to 50 % more fault tolerance comparing with the conventional algorithms. This new method can be easily adapted and implemented with lower cost due to less hardware overhead in SoC that integrate a large number of communicating IP cores.
If We Want Your Opinion
Authors: Daniel M. Bikel, Jeffrey Sorensen
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Sentiment has traditionally been considered a "deep" attribute of writing, often requiring the interpretation of figurative language to uncover the writer's intention. The natural language processing community has become increasingly interested in detecting, through automatic means, the expression of opinions and measuring the intensity of emotions held by the writer. Despite the depth and abstraction often associated with expressions of sentiment, we apply strictly lexical analysis to the opinions expressed about books and find that machine learning techniques are capable of resolving even fine-grained distinctions between opinions. Using an averaged perceptron classifier trained using a word subsequence kernel, we achieve an accuracy of 89% when distinguishing between 1- and 5-star reviews. Further, this same model yields significant separation when scoring intermediate reviews--making distinctions even human annotators find difficult. We detail the collection of data for supervised training and present the results of our sentiment classifier along with some discussion about why we believe this approach to be effective.
Transcoding-based error-resilient video adaptation for 3G wireless networks
Authors: Sertac Eminsoy, Safak Dogan, Ahmet M. Kondoz
Venue: EURASIP Journal on Advances in Signal Processing (2007)

Transcoding is an effective method to provide video adaptation for heterogeneous internetwork video access and communication environments, which require the tailoring (i.e., repurposing) of coded video properties to channel conditions, terminal capabilities, and user preferences. This paper presents a video transcoding system that is capable of applying a suite of error resilience tools on the input compressed video streams while controlling the output rates to provide robust communications over error-prone and bandwidth-limited 3G wireless networks. The transcoder is also designed to employ a new adaptive intra-refresh algorithm, which is responsive to the detected scene activity inherently embedded into the video content and the reported time-varying channel error conditions of the wireless network. Comprehensive computer simulations demonstrate significant improvements in the received video quality performances using the new transcoding architecture without an extra computational cost.
Run-time Composition and Adaptation of Mismatching Behavioural Transactions
Authors: Javier Camara, Gwen Salaun, Carlos Canal
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

Reuse of software entities such as components or web services raise composition issues since, most of the time, they present mismatching behavioural interfaces. Here, we particularly focus on systems for which the number of transactions is unbounded, and unknown in advance. This is typical in pervasive systems where a new client may show up at any moment to request or access a specific service. Hence, we advocate for the use of the ð-calculus to specify component interfaces. The ð-calculus is particularly suitable for creating new component instances and channels dynamically. The unbounded number of transactions and the use of the ð-calculus obliges to apply the composition at run-time. In this paper, we propose a run-time composition engine that solves existing mismatches.
Tutorial Series 5 Software Design
Authors: J. C. Enos
Venue: Computer (1981)

Evolving from historical and contemporary practices, various forces of change will combine in the near future to bring significant improvement to software design.
Efficient TTI for 3G multimedia applications
Authors: Costas Chaikalis
Venue: Advances in Multimedia (2007)

Time transmission interval (TTI) or outer block interleaving is an important task for the implementation of UMTS turbo coding in flat Rayleigh fading environment. An efficient TTI choice can save computational complexity. However, different multimedia scenarios are investigated using the maximum UMTS frame length, and simulation results are presented for the four possible outer block interleaver configurations in the case of flat Rayleigh fading channel. It is shown that different operating environments require an appropriate TTI in terms of bit error rate (BER) performance for the following data rates: 28.8 kbps, 64 kbps, 144 kbps, 384 kbps, and 2 Mbps.
Multiple-part based Pedestrian Detection using Interfering Object Detection
Authors: Xin Mao, Feihu Qi, Wenjia Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

We propose an improved pedestrian detection framework based on Viola's Adaboost cascade framework, and its improvements focus on the three aspects: First we use edgelet features in addition to the haar-like features to capture more information about the pedestrian contours. Second we design a fast algorithm to combine the multiple-part detectors. Third we introduce the concept of "interfering object detection" to depress the false alarms. Experiment results show that our improved framework enhances the overall detecting performance by successfully detecting pedestrians with more informative features and effectively depressing the false alarms.
Trends in Artificial Intelligence
Authors: A. D. C. Holden
Venue: IEEE Transactions on Computers (1976)

THIS Special Issue on Artificial Intelligence in the IEEE TRANSACTIONS ON COMPUTERS is composed of selected papers from the 3rd International Joint Conference on Artificial Intelligence (IJCAI), Stanford University, Stanford, CA, 1973. Far more high-quality papers have been presented at these conferences erences than can be accommodated in any one journal. However, the interdisciplinary nature of artificial intelligence (AI) means that IJCAI papers regularly appear in several journals.
Multiserver Systems Subject to Breakdowns: An Empirical Study
Authors: I. Mitrani
Venue: IEEE Transactions on Computers (1983)

The tradeoffs between efficiency and reliability in M / M / N queueing systems subject to breakdowns are studied numerically. The dependence of the optimal number of servers on the system parameters is investigated under two different sets of assumptions about the pattern of breakdowns and repairs.
Software Environment for Research on Evolving User Interface Designs
Authors: Juan Quiroz, Anil Shankar, Sergiu M. Dascalu, Sushil J. Louis
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

We investigate the trade off between investing effort in improving the features of a research environment that increases productivity and investing such effort in actually conducting the research experiments using a less elaborated, albeit sufficiently operational environment. The study case presented is an interactive genetic algorithm environment we created to evolve user interfaces designs. We present three productivity improvements integrated in our environment and examine whether on the long run the research productivity can be in fact increased by spending development time on enhancing the research tools rather than on performing the research itself. The three improvements are the integration of the entire system interface into a main wxPython window, the addition of a runs manager for setting up multiple experiments, and the creation of a data manager for effective exploration and visualization of data produced in the experiment runs. We also discuss several guidelines for transitioning a research environment such as ours from a researcher's tool to an end-user's tool.
An Efficient Intra-frame Prediction Algorithm Based on Characteristic of 4 × 4 Sub-block for H.264/AVC
Authors: Jia Kebin, Lv Zhuoyi, Xie Jing, Liu Pengyu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

H.264/AVC is the newest video coding standard with high compression efficiency. Because it will take a long time to code with extremely complex algorithm, it can not achieve real-time application. In this paper, according to the feature of intra-frame prediction algorithm, an efficient algorithm based on characteristic of 4 × 4 sub-block is proposed. This algorithm makes use of the real condition, then selects one from the nine prediction directions. Therefore, it can reduce complexity of algorithm and coding time dramatically. Experimental results show that the compression time of proposed algorithm is 18.98% less than that of H.264/AVC, at the expense of a little quality degradation.