ppxscal/embedding_network huggingface dataset:
An alternative approach to natural language query expansion in search engines: Text analysis of non-topical terms in Web documents
Authors: Rahmatollah Fattahi, Concepción S. Wilson, Fletcher Cole
Venue: Information Processing and Management: an International Journal (2008)

This paper presents a new approach to query expansion in search engines through the use of general non-topical terms (NTTs) and domain-specific semi-topical terms (STTs). NTTs and STTs can be used in conjunction with topical terms (TTs) to improve precision in retrieval results. In Phase I, 20 topical queries in two domains (Health and the Social Sciences) were carried out in Google and from the results of the queries, 800 pages were textually analysed. Of 1442 NTTs and STTs identified, 15% were shared between the two domains; 62% were NTTs and 38% were STTs; and approximately 64% occurred before while 36% occurred after their respective topical terms (TTs). Findings of Phase II showed that query expansion through NTTs (or STTs) particularly in the 'exact title' and URL search options resulted in more precise and manageable results. Statistically significant differences were found between Health and the Social Sciences vis-a-vis keyword and 'exact phrase' search results; however there were no significant differences in exact title and URL search results. The ratio of exact phrase, exact title, and URL search result frequencies to keyword search result frequencies also showed statistically significant differences between the two domains. Our findings suggest that web searching could be greatly enhanced combining NTTs (and STTs) with TTs in an initial query. Additionally, search results would improve if queries are restricted to the exact title or URL search options. Finally, we suggest the development and implementation of knowledge-based lists of NTTs (and STTs) by both general and specialized search engines to aid query expansion.
Working day movement model
Authors: Frans Ekman, Ari Keränen, Jouni Karvo, Jörg Ott
Venue: Proceeding of the 1st ACM SIGMOBILE workshop on Mobility models (2008)

Abstract movement models, such as Random Waypoint, do not capture reliably the properties of movement in the real life scenarios. We present and analyse a movement model for delay-tolerant network simulations that is able to produce inter-contact time and contact time distributions that follow closely the ones found in the traces from the real-world measurement experiments. We validate the movement model using the ONE simulator.
A simple and efficient sampling method for estimating AP and NDCG
Authors: Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge tens of thousands of documents. While the first method proposed by Aslam et al. [1] is quite accurate and efficient, it is overly complex, making it difficult to be used by the community, and while the second method proposed by Yilmaz et al., infAP [14], is relatively simple, it is less efficient than the former since it employs uniform random sampling from the set of complete judgments. Further, none of these methods provide confidence intervals on the estimated values. The contribution of this paper is threefold: (1) we derive confidence intervals for infAP, (2) we extend infAP to incorporate nonrandom relevance judgments by employing stratified random sampling, hence combining the efficiency of stratification with the simplicity of random sampling, (3) we describe how this approach can be utilized to estimate nDCG from incomplete judgments. We validate the proposed methods using TREC data and demonstrate that these new methods can be used to incorporate nonrandom samples, as were available in TREC Terabyte track '06.
Xensible interruptions from your mobile phone
Authors: G. H. (Henri) ter Hofte
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

Mobile phones may interrupt in any place at any time. Using the SocioXensor research tool on people's own mobile phones, we conducted an experience sampling study to explore which context information predicts a person's availability for a phone call, and which context information people wanted to disclose to particular social relations. Like other studies, we found that a small set of context information can help initiators of phone calls to improve their ability to know when recipients are receptive to phone calls. We also found that if we restrict the information to information recipients actually want to disclose, which is only a small subset of all information, enough context information is still available for initiators of phone calls to improve their ability to know when recipients are receptive to phone calls.
Introduction to the special issue on the 2007 workshop on design, analysis, and simulation of chip multiprocessors (dasCMP'07)
Authors: Norman P. Jouppi, Rakesh Kumar, Dean Tullsen
Venue: ACM SIGARCH Computer Architecture News (2008)

Chip multiprocessor architectures are becoming increasingly attractive as an option to provide high instruction throughput while keeping power and complexity under control. Such architectures have also been shown to have scalability and productivity advantages. Multi-core processors are fast becoming mainstream.
A stream chip-multiprocessor for bioinformatics
Authors: Ravi Kiran Karanam, Arun Ravindran, Arindam Mukherjee
Venue: ACM SIGARCH Computer Architecture News (2008)

Bioinformatics applications such as gene and protein sequence matching algorithms are characterized by the need to process large amounts of data. While uni-processor performance growth is slowing due to an increasing gap between processor and memory speeds and a saturation of processor clock frequencies, Genbank data is doubling every 15 months. With the advent of chip multiprocessor systems, great improvements in processor performance could potentially be achieved by taking advantage of the high interprocessor communication bandwidth and new models of programming. We propose a stream chip multiprocessor micro- architecture customized for bioinformatics applications that takes advantage of the memory bandwidth available in chip multiprocessors by exploiting the data parallelism available in bioinformatics applications. The proposed stream chip multiprocessor micro architecture, on a Xilinx Virtex-5 FPGA with 60 customized MicroBlaze soft processor cores running at 80 MHz with a PCI- bus limited main memory bandwidth of 0.12 GB/s, would achieve a speed-up of 68% for the Smith-Waterman sequence matching algorithm compared to a 2.4 GHz AMD Opteron 250. An extrapolated 60 long stream CMP running at 1 GHz with a memory access rate of 2.7 GB/s would run 41.7 times faster than the 1.2 GHz Sun Niagara processor, 16.5 times faster than the 2.4 GHz AMD Opteron 250 and 12.3 times faster than the 2.4 GHz Intel Xeon processor.
Knowledge Articulation Method Using Design Data History
Authors: Kazuo Hiekata, Hiroyuki Yamato, Wataru Oishi
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper proposes a methodology to articulate design knowledge using a design trace. A software system is developed to support the proposed methodology. The system is a kind of design navigator and is also a design data storage. Design data are stored in RDF format which is a standard metadata description language. By incorporating with the software, design knowledge is articulated through the following processes: (1) define initial workflow, (2) record the design trace, (3) generation tree of the design history and (4) interview with the designer to revise workflow and to determine the design knowledge.This methodology and the software were applied to the marine propeller design. Since this is a typical parametric design, all the input and output data are recorded and the articulation was made in the proposed manner. The workflow and knowledge was extracted successfully.
Expanded Definition of Functional Operation Conditions and its Effects on the Computation of Functional Broadside Tests
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

Functional operation of a synchronous sequential circuit is defined to start after the circuit is initialized to a known state, typically by a synchronizing sequence. The states that the circuit can visit after it is synchronized are called reachable states, and functional operation consists of state-transitions between reachable states. We expand the definition of functional operation to include all the state-transitions that may be traversed during the application of the synchronizing sequence. This adds certain state-transitions that involve unreachable states to the definition of functional operation. Expanding the definition of functional operation is justified by the fact that the circuit needs to be designed for correct operation during the synchronization process. It is advantageous when functional broadside tests are used to avoid overtesting. We study the effect of the expanded definition on the coverage of transition faults.
Model based microwave non destructive testing of pipes
Authors: G. Acciani, G. Brunetti, G. Fornarelli, C. Guaragnella
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The problem of non destructive microwave testing of pipes has been addressed to evaluate the effectiveness of the technique based on the measurement of the scattering parameter S11. An asymmetric bifilar transmission line has been used to acquire data to be used in the defect modeling, being the pipe to be tested one of the two wires in the line, and a normal copper wire the other. The proposed data preprocessing to be used in a defect classification system is the focus of the paper. A linear time invariant convolving model of the defect is presented to take care of the experimental data acquisition setup. The assumption is that proper modeling can enhance in distinguishing different defects in the measurement system. The technique to extract the model from the acquired data is presented, together with a few experimental results conducted on real acquired data.
Convergence analysis of a domain decomposition paradigm
Authors: Randolph E. Bank, Panayot S. Vassilevski
Venue: Computing and Visualization in Science (2008)

We describe a domain decomposition algorithm for use in several variants of the parallel adaptive meshing paradigm of Bank and Holst. This algorithm has low communication, makes extensive use of existing sequential solvers, and exploits in several important ways data generated as part of the adaptive meshing paradigm. We show that for an idealized version of the algorithm, the rate of convergence is independent of both the global problem size N and the number of subdomains p used in the domain decomposition partition. Numerical examples illustrate the effectiveness of the procedure.
Interest-Based Peer Selection in P2P Network
Authors: Harry Chiou, Addison Su, Stephen Yang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

Currently most distributed peer-to-peer network systems send to other peers when users' query request, but their search result is a great deal of needless answer as gap between their search goal and their information need. It is because each peers own different interest domain knowledge. However, we purpose interest-based peer selection in order to rank best peers under the user context with content retrieval tasks. Generally speaking, providers may be best peers what user want find. Providers can satisfy users' information need, if we figure out providers what are user search goal.Based on ACM domain knowledge, we propose reference ontology in order to calculate the semantic similarity under each peer preferences, and rank best peers. Feedback data is updated ontological user profile by user activities and content retrieval tasks. Our approach can satisfy users' information need and reduce their search time-consuming.
Performance Modeling and Simulation of Microstrip Dipole Array Antenna for WLAN Application
Authors: Ping Jack Soh, Razif Arief Jamil Abdullah Amir, Mahyuni Mozi Aiza, Abdullah Al-Hadi Azremi, Mohamad Zoinol Abidin Abdul Aziz
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper proposed a performance simulation of a two-element, microstrip dipole array antenna for WLAN application. Simulation is done using two different simulation techniques, the circuit model (CM) derived from the Transmission Line Model (TLM), and is compared with another simulation set using the Method of Moments (MoM). Both methods are simulated using Microwave Office. The basic microstrip dipole antenna is accurately modeled and the linear array structure is done by combining two basic units. Both simulation sets of MoM and CM are evaluated to determine their level of variation in terms of return loss (S11), bandwidth and resonant frequency (fres). The MoM designed for dipole antennas achieved the best return loss (S11), bandwidth and resonant frequency (fres) at the desired frequency. The equivalent circuit proposed produced good return loss and comparable with simulation using MoMs. Details of the proposed antenna design and simulation results for 2.45 GHz WLAN band are presented and deliberated
A programming method for building component-based commercial software for image processing
Authors: Feriel Benhissi, Salem Nasri
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

This paper discusses a consistent method for building component-based commercial software for image processing. The resulting framework greatly facilitates the incorporation into the software of any processing function without worrying about the memory storage and generalizing its usage to any image format while focusing on the algorithmic behavior of the function. Also it allows the software to be expandable, maintainable, understandable and stable. It implements handles and rep objects, and use templates so a single version of the code will work with any type of pixel. Thanks to the handles, we are able to manage the number of copies of a given image and so avoid memory leakage and fragmentation. The method deals separately with the issues related to image processing problems such as memory management and memory alignment. We also present a practical implementation of the method in which we demonstrate how to apply C++ to solve the problems inherent in building commercial software for image processing. The method can be easily applied to any object oriented language.
Understanding and characterizing insights: how do people gain insights using information visualization?
Authors: Ji Soo Yi, Youn-ah Kang, John T. Stasko, Julie A. Jacko
Venue: Proceedings of the 2008 conference on BEyond time and errors: novel evaLuation methods for Information Visualization (2008)

Even though "providing insight" has been considered one of the main purposes of information visualization (InfoVis), we feel that insight is still a not-well-understood concept in this context. Inspired by research in sensemaking, we realized the importance of the procedural aspects in understanding insight. Thus, rather than asking "What is insight?" we instead focus on "How do people gain insights?" In an effort to better understand and characterize insight, we reviewed previous literature in InfoVis, seeking other researchers' comments and views on this concept. We found that: 1) Insights are often regarded as end results of using InfoVis and the procedures to gain insight have been largely veiled; 2) Four largely distinctive processes of gaining insight (Provide Overview, Adjust, Detect Pattern, and Match Mental Model) have been discussed in the InfoVis literature; and 3) These different processes provide some hints to understand the procedures in which insight can be gained from InfoVis. We hope that our findings help researchers and practitioners evaluate InfoVis systems and technologies in a more insight-oriented way.
PowerAntz: distributed power sharing strategy for network on chip
Authors: Suman Kalyan Mandal, Rabi N. Mahapatra
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Advent of Network-on-Chip (NoC) based complex system designs made on-chip power management a challenging issue. Power management schemes have been proposed to tackle the problem. But they fail to provide optimal sharing when the power budget distribution varies significantly among on-chip components that are placed further apart on a chip. This paper presents PowerAntz, a distributed power management strategy for NoC based systems. This adaptive and distributed approach to power sharing across various components of a large chip is shown to be a scalable solution. Our experiments have demonstrated PowerAntz to be up to 30% more effective in distributing power budget compared to existing strategies. Further, it also achieves up to 21.25% improvement in power utilization while keeping overhead as low as zero in best case.
Distributed algorithms for secure multipath routing in attack-resistant networks
Authors: Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: 1) routing decisions are made locally by network nodes without the centralized information of the entire network topology; 2) routing decisions minimize throughput loss under a single-link attack with respect to different session models; and 3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, both of which provide provably optimal solutions. Experiments show that the Bound-Control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the Lex-Control algorithm further enhances the Bound-Control algorithm by countering severe single-link attacks and various types of multi-link attacks. Moreover, the Lex-Control algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attack-resistant network and analyze how the algorithms address resiliency and security in different network settings.
Race directed random testing of concurrent programs
Authors: Koushik Sen
Venue: ACM SIGPLAN Notices (2008)

Bugs in multi-threaded programs often arise due to data races. Numerous static and dynamic program analysis techniques have been proposed to detect data races. We propose a novel randomized dynamic analysis technique that utilizes potential data race information obtained from an existing analysis tool to separate real races from false races without any need for manual inspection. Specifically, we use potential data race information obtained from an existing dynamic analysis technique to control a random scheduler of threads so that real race conditions get created with very high probability and those races get resolved randomly at runtime. Our approach has several advantages over existing dynamic analysis tools. First, we can create a real race condition and resolve the race randomly to see if an error can occur due to the race. Second, we can replay a race revealing execution efficiently by simply using the same seed for random number generation--we do not need to record the execution. Third, our approach has very low overhead compared to other precise dynamic race detection techniques because we only track all synchronization operations and a single pair of memory access statements that are reported to be in a potential race by an existing analysis. We have implemented the technique in a prototype tool for Java and have experimented on a number of large multi-threaded Java programs. We report a number of previously known and unknown bugs and real races in these Java programs.
Undergraduate research experiences in data mining
Authors: Imad Rahal
Venue: Proceedings of the 39th SIGCSE technical symposium on Computer science education (2008)

The new interdisciplinary field of Data Mining emerged in the early 1990s as a response to the profusion of digital data generated in numerous fields such as biology, chemistry, astronomy, advertising, banking and finance, retail market, stock market, and the WWW. In this paper, I describe an undergraduate course in Data Mining offered at the College of Saint Benedict and Saint John's University in Spring of 2007 as a CSCI-317-upper-division "Topics in Computer Science"- course, entitled "Data Intelligence." One of the main objectives of the course was to engage students in experimental computing research through a number of carefully planned research activities resulting in better understanding of the course contents and deeper insights into the challenges faced by the data mining community.
Conversion of continuous speech sound to articulation animation as an application of visual coarticulation modeling
Authors: Gergely Feldhoffer, Tamás Bárdi
Venue: Acta Cybernetica (2007)

A voice to facial animation conversion system is presented in this paper. In particular the temporal structure of the multimodal speech is discussed. Mutual information and neural network training is used to estimate the optimal temporal scope for audio to video conversion.
A Document Clustering Method Based on One-Dimensional SOM
Authors: Yan Yu, Pilian He, Yushan Bai, Zhenlei Yang
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper a new method is presented and used in clustering document collections. This method is based on the one-dimensional arrays of Self-Organizing Map network (1-D SOM array). The main idea of this method is to obtain the clustering results by calculating the distances between every two adjacent MSPs (the most similar prototype to the input vector) of well trained 1-D SOM. The process is simple, easy to understand and unnecessary to give the number of clusters beforehand. The experimental results show that this method works well in clustering document collection.
Design-process integration for performance-based OPC framework
Authors: Siew-Hong Teh, Chun-Huat Heng, Arthur Tay
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Along the continued shrinking of critical dimension (CD), the optical proximity correction (OPC) scheme inevitably becomes more aggressive and results in greater mask complexity and cost. Conventional OPC are edge-placement-error (EPE) driven without considering the effect of correction on circuit performance at all. We propose a performance-based OPC (PB-OPC) framework that employs a much simpler mask correction algorithm based on the real-time estimated device performances. When compared to the conventional OPC approach, our PB-OPC achieved 33 to 93% reduction in mask MEBES size and closer circuit performance matching to the design intent.