ppxscal/embedding_network huggingface dataset:
On improving wikipedia search using article quality
Authors: Meiqun Hu, Ee-Peng Lim, Aixin Sun, Hady Wirawan Lauw, Ba-Quy Vuong
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

Wikipedia is presently the largest free-and-open online encyclopedia collaboratively edited and maintained by volunteers. While Wikipedia offers full-text search to its users, the accuracy of its relevance-based search can be compromised by poor quality articles edited by non-experts and inexperienced contributors. In this paper, we propose a framework that re-ranks Wikipedia search results considering article quality. We develop two quality measurement models, namely Basic and P<scp>eer</scp>R<scp>eview</scp>, to derive article quality based on co-authoring data gathered from articles' edit history. Compared withWikipedia's full-text search engine, Google and Wikiseek, our experimental results showed that (i) quality-only ranking produced by P<scp>eer</scp>R<scp>eview</scp> gives comparable performance to that of Wikipedia and Wikiseek; (ii) P<scp>eer</scp>R<scp>eview</scp> combined with relevance ranking outperforms Wikipedia's full-text search significantly, delivering search accuracy comparable to Google.
Panorama: capturing system-wide information flow for malware detection and analysis
Authors: Heng Yin, Dawn Song, Manuel Egele, Christopher Kruegel, Engin Kirda
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Malicious programs spy on users' behavior and compromise their privacy. Even software from reputable vendors, such as Google Desktop and Sony DRM media player, may perform undesirable actions. Unfortunately, existing techniques for detecting malware and analyzing unknown code samples are insufficient and have significant shortcomings. We observe that malicious information access and processing behavior is the fundamental trait of numerous malware categories breaching users' privacy (including keyloggers, password thieves, network sniffers, stealth backdoors, spyware and rootkits), which separates these malicious applications from benign software. We propose a system, Panorama, to detect and analyze malware by capturing this fundamental trait. In our extensive experiments, Panorama successfully detected all the malware samples and had very few false positives. Furthermore, by using Google Desktop as a case study, we show that our system can accurately capture its information access and processing behavior, and we can confirm that it does send back sensitive information to remote servers in certain settings. We believe that a system such as Panorama will offer indispensable assistance to code analysts and malware researchers by enabling them to quickly comprehend the behavior and innerworkings of an unknown sample.
A Deterministic Implementation Process for Accurate and Traceable System Timing and Space Analysis
Authors: M. Ward, N. C. Audsley
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Traditionally, implementations of dependable real-time systems have targeted CPUs, with application level concurrency implemented as pseudo-concurrency on the CPU. For such systems, much research has addressed timing and resource analysis to enable offline guarantees regarding actual worst-case run-time performance. Three major weaknesses exist with the traditional implementation method. Firstly, analysis is post-hoc, after application compilation and worst-case execution time analysis. Secondly, timing analysis is pessimistic and difficult, due to the unpredictable nature of complex CPUs. Thirdly, the compilation process is largely non-traceable, in that it is difficult to relate object code back to source code (which introduces verification difficulties in safety-critical systems). This paper addresses these three problems with an implementation approach and analysis method that: enables timing and space properties to be established directly from source (not after compilation); provides a deterministic and traceable implementation to ease verification; and enables non-pessimistic timing analysis of the implementation as no CPU is utilised. As an exemplar of the approach, the compilation of a standard real-time safety-critical subset of Ada to a circuit (implem
FreeViz-An intelligent multivariate visualization approach to explorative analysis of biomedical data
Authors: Janez Demšar, Gregor Leban, Bla Zupan
Venue: Journal of Biomedical Informatics (2007)

Visualization can largely improve biomedical data analysis. It plays a crucial role in explorative data analysis and may support various data mining tasks. The paper presents FreeViz, an optimization method that finds linear projection and associated scatterplot that best separates instances of different class. In a single graph, the resulting FreeViz visualization can provide a global view of the classification problem being studied, reveal interesting relations between classes and features, uncover feature interactions, and provide information about intra-class similarities. The paper gives mathematical foundations of FreeViz, and presents its utility on various biomedical data sets.
Thermal-Safe Test Access Mechanism and Wrapper Co-optimization for System-on-Chip
Authors: Thomas Edison Yu, Tomokazu Yoneda, Krishnendu Chakrabarty, Hideo Fujiwara
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Smaller manufacturing processes have resulted in higher power densities which put greater emphasis on packaging and temperature control during test. For system-on-chips, peak power-based scheduling algorithms are used to optimize tests while satisfying power budgets. However, imposing power constraints does not necessarily mean that overheating is avoided due to the non-uniform power distribution across the chip. This paper presents a TAM/Wrapper co-design methodology for system-on-chips that ensures thermal safety while still optimizing the test schedule. The method combines a simplified thermal-cost model with a traditional bin-packing algorithm to minimize test time while satisfying temperature constraints. Experiments show that even minimal increases in test time can yield considerable decrease in test temperature as well as the possibility of further lowering temperatures beyond those achieved using traditional power-based test scheduling.
A Conceptual Framework for a SIM-based Electronic Transaction Authentication System
Authors: Manzur Ashraf, Syed Mahfuzul Aziz, M. Lutful Kabir
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper presents a SIM-based tool for user authentication in various service areas such as financial transactions in e-commerce. Other remote services can use SIM as an authentication tool over existing GSM technology through GPRS, which is an additional packet data feature for the GSM network. It allows both packet-switched and circuit-switched traffic to exist in the GSM infrastructure. As GPRS is designed to support packet based protocols, such as the Internet Protocol (IP) based bursty and uneven traffic flow, it enables new services such as reasonably fast access to the Internet, electronic mail and other data oriented services, that have been too inefficient in traditional circuit-switched digital mobile networks. Using GPRS features, the e-commerce applications can use SIM as user authentication for transactions. SIM can also be a tool for user identity and authentication around the corporate intranets. This can reduce security infrastructure setup and investment overhead for the security concerned organizations. This paper depicts an electronic payment protocol by means of SIM based authentication with the illustrations of its formal modelling & verification results.
A New Subcarrier and Power Allocation Algorithm Based on Statistical Information in Multiuser OFDM System
Authors: Xuebing Pei, Guangxi Zhu, Gan Liu
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

In this paper, multiuser waterfilling theory applied to subcarrier and power allocation in orthogonal frequency division multiplexing (OFDM) system is researched. Note that the traditional scheduling algorithm making use of the channel status information(CSI) feedback needs broad control channel to transfer the frequent CSI in multipath Rayleigh fast fading channel, which is often impractical or inefficient, we propose a resource allocation algorithm based on tap correlation information(TCOI), which is characterized by channel statistical information. The algorithm is designed to utilize the TCOI to reduce the channel feedback. Because the optimal resolution is high nonlinear, we convert the proposed algorithm into discrete method to achieve lower algorithm complexity. The simulation result shows that the proposed algorithm has tiny reduction in overall system capacity, but much lower complexity of algorithm and small channel feedback comparing to the traditional scheduling algorithm based on CSI, what's more it outperforms greatly channel independent scheduling basing on pathloss in fast Rayleigh fading channel1.
Technical Keynoters Focus on Emerging Telecommunications Policy
Authors: W. Myers, J. Luke
Venue: Computer (1978)

The past, present, and future of telecommunications in this country were very much on the minds of technical keynoters and panel members at COMPCON 78 Fall. The rapid emergence of data transmission technology in recent years has put increasing pressure-and even strain-on the regulatory and market systems that have governed who can offer what services, and under what conditions, over the nation's vast telecommunications system.
Guest Editors' Introduction: Social Media and Search
Authors: Junghoo Cho, Andrew Tomkins
Venue: IEEE Internet Computing (2007)

The past few years have seen a rapid rise in social media Web sites. As user content becomes the dominant content form on the Web, various questions arise about the most effective approach to processing it.
The why of Y
Authors: Richard P. Gabriel
Venue: ACM SIGPLAN Lisp Pointers (1988)

Did you ever wonder how Y works and how anyone could ever have thought of it? Do you feel like a Lisp weakling when some heavy-duty Scheme hacker kicks sand in your face by admiring Y in public? In this note I'll try to explain to you not only how it works, but how someone could have invented it. I'll use Scheme notation because it is easier to understand when functions passed as arguments are being applied. At the end, I'll show you Common Lisp equivalents of some of the Scheme code.
Quota enforcement for high-performance distributed storage systems
Authors: Kristal T. Pollack, Darrell D. E. Long, Richard A. Golding, Ralph A. Becker-Szendy, Benjamin Reed
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Storage systems manage quotas to ensure that no one user can use more than their share of storage, and that each user gets the storage they need. This is difficult for large, distributed systems, especially those used for high-performance computing applications, because resource allocation occurs on many nodes concurrently. While quota management is an important problem, no robust scalable solutions have been proposed to date. We present a solution that has less than 0.2% performance overhead while the system is below saturation, compared with not enforcing quota at all. It provides byte-level accuracy at all times, in the absence of failures and cheating. If nodes fail or cheat, we recover within a bounded period. In our scheme quota is enforced asynchronously by intelligent storage servers: storage clients contact a shared management service to obtain vouchers, which the clients can spend like cash at participating storage servers to allocate storage space. Like a digital cash system, the system periodically reconciles voucher usage to ensure that clients do not cheat by spending the same voucher at multiple storage servers. We report on a simulation study that validates this approach and evaluates its performance.
Efficient delay tracking methods with sidelobes cancellation for BOC-modulated signals
Authors: Adina Burian, Elena Simona Lohan, Markku Kalevi Renfors
Venue: EURASIP Journal on Wireless Communications and Networking (2007)

In positioning applications, where the line of sight (LOS) is needed with high accuracy, the accurate delay estimation is an important task. The new satellite-based positioning systems, such as Galileo and modernized GPS, will use a new modulation type, that is, the binary offset carrier (BOC) modulation. This type of modulation creates multiple peaks (ambiguities) in the envelope of the correlation function, and thus triggers new challenges in the delay-frequency acquisition and tracking stages. Moreover, the properties of BOC-modulated signals are yet not well studied in the context of fading multipath channels. In this paper, sidelobe cancellation techniques are applied with various tracking structures in order to remove or diminish the side peaks, while keeping a sharp and narrow main lobe, thus allowing a better tracking. Five sidelobe cancellation methods (SCM) are proposed and studied: SCM with interference cancellation (IC), SCM with narrow correlator, SCM with high-resolution correlator (HRC), SCM with differential correlation (DC), and SCM with threshold. Compared to other delay tracking methods, the proposed SCM approaches have the advantage that they can be applied to any sine or cosine BOC-modulated signal. We analyze the performances of various tracking techniques in the presence of fading multipath channels and we compare them with other methods existing in the literature. The SCM approaches bring improvement also in scenarios with closely-spaced paths, which are the most problematic from the accurate positioning point of view.
Dynamic assignment of dedicated and flexible servers in tandem lines
Authors: Sigrún Andradóttir, Hayriye Ayhan, Douglas G. Down
Venue: Probability in the Engineering and Informational Sciences (2007)

Consider a system of queuing stations in tandem having both flexible servers (who are capable of working at multiple stations) and dedicated servers (who can only work at the station to which they are dedicated). We study the dynamic assignment of servers to stations in such systems with the goal of maximizing the long-run average throughput. We also investigate how the number of flexible servers influences the throughput and compare the improvement that is obtained by cross-training another server (i.e., increasing flexibility) with the improvement obtained by adding a resource (i.e., a new server or a buffer space). Finally, we show that having only one flexible server is sufficient for achieving near-optimal throughput in certain systems with moderate to large buffer sizes (the optimal throughput is attained by having all servers flexible). Our focus is on systems with generalist servers who are equally skilled at all tasks, but we also consider systems with arbitrary service rates.
Dynamic programming decision path encoding of genetic algorithms for production allocation problems
Authors: Ying-Hua Chang, Young-Chang Hou
Venue: Computers and Industrial Engineering (2008)

Genetic algorithm is a novel optimization technique for solving constrained optimization problems. The penalty function methods are the popular approaches because of their simplicity and ease of implementation. Penalty encoding method needs more generations to get good solutions because it causes invalid chromosomes during evolution. In order to advance the performance of Genetic Algorithms for solving production allocation problems, this paper proposes a new encoding method, which applies the upper/lower bound concept of dynamic programming decision path on the chromosome encoding of genetic algorithm, that encodes constraints into chromosome to ensure that chromosomes are all valid during the process of evolution. Utilization of the implicated parallel processing characteristic of genetic algorithms to improve dynamic programming cannot guarantee to solve complex problems in the polynomial time. Additionally, a new simultaneous crossover and mutation operation is proposed to enable the new method to run correctly following the standard genetic algorithm procedures. This approach is evaluated on some test problems. Solutions obtained by this approach indicate that our new encoding genetic algorithms certainly accelerate the performance of the evolution process.
The ipclib PEPA Library
Authors: Allan Clark
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

PEPA[6] is a popular stochastic process algebra which allows a compositional approach to stochastic model description. The ipc compiler translates a given PEPA model into a format suitable for processing by the Hydra[5] Markovian response-time analyser. The ipc software has undergone some improvements which have led to its refactoring as a library for handling PEPA models.
A Practical Method for Reducing Weak Precedence Parsers
Authors: J. Aoe
Venue: IEEE Transactions on Software Engineering (1983)

This paper presents a practical method for constructing a more compact matrix structure of the precedence information used in a new weak precedence parsing. The parsing algorithm differs from the conventional weak precedence algorithm in that the precedence relation .> signals a sequence of reduce actions, not just one. The method can be used for any weak precedence grammars without degrading the good error detection capability of the traditional weak precedence parsers. It is shown by the empirical results that the obtained matrices are the very reasonable size and that the presented parsing algorithm is very efficient.
New Stochastic Algorithms for Scheduling Ads in Sponsored Search
Authors: Esteban Feuerstein, Pablo Ariel Heiber, Javier Martinez-Viademonte, Ricardo Baeza-Yates
Venue: Proceedings of the 2007 Latin American Web Conference (2007)

We introduce a family of algorithms for the selection of ads in sponsored search that intends to increase the variety of choices, while not significantly reducing revenue and maintaining an incentive for advertisers to keep their bids as high as possible. Diversification of ads may be convenient for many reasons, which we also expose. Our algorithms try to distribute the available slots among all ads, using a proportional mechanism based on the bids and the expected click-through rates of the ads. Although in our experiments we used a simple first-price auction, our algorithms are compatible with strictly incentive-compatible auctions and pricing mechanisms. We have analyzed the performance of our algorithms in two different scenarios: assuming a static intrinsic click-through rate associated to each ad and in the more general case in which those rates may vary dynamically with time. Our main result is an algorithm that performs reasonably well in terms of revenue as the traditionally used, while notably increasing the diversification. In some scenarios, our newly introduced algorithms even outperform the traditional ones.
A Fast Keyword-Spotting Technique
Authors: L. Li, S. J. Lu, C.-L. Tan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In order to capture the content of an imaged document but avoid the time-consuming full-scale OCR which is frag- ile to handle touching characters, a fast and segmentation- free keyword spotting method is proposed in this paper. The keyword spotting method is based on word shape coding technique. The proposed coding scheme has little ambigu- ity, and can be swiftly executed. It is a promising technique to boost better document image retrieval. The strength of the proposed method is demonstrated in a document filter- ing experiment. The experimental results show that docu- ment filtering based on the proposed method is more than 20 times faster than the one based on OCR, and has com- parable filtering accuracy.
Deciding the physical implementation of ETL workflows
Authors: Vasiliki Tziovara, Panos Vassiliadis, Alkis Simitsis
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

In this paper, we deal with the problem of determining the best possible physical implementation of an ETL workflow, given its logical-level description and an appropriate cost model as inputs. We formulate the problem as a state-space problem and provide a suitable solution for this task. We further extend this technique by intentionally introducing sorter activities in the workflow in order to search for alternative physical implementations with lower cost. We experimentally assess our method based on a principled organization of test suites.
New Applications
Authors: D. A. Michalopoulos
Venue: Computer (1978)

Although it was discovered more than 100 years ago that the electrical resistance of certain metals can be influenced by an applied magnetic field, it is only in recent years that proposals have been put forward for practical applications of this "magnetoresistance effect," as it is called. There are two important reasons for the revival of research in this field. The first is the development of magnetic recording in the direction of increasingly high information densities, which calls for magnetic sensors of a compactness that cannot be achieved with conventional inductive sensors. The second is the development of methods, related to integrated circuit technology, by which micropatterns can be made in thin metal layers, making it possible to fabricate tiny magnetoresistive elements capable of detecting magnetic fields varying on a micron scale.
A fault-tolerant node scheduling scheme to extend the lifetime of wireless sensor networks
Authors: Babak Pazand, Amitava Datta, Rachel Cardell-Oliver
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

In this paper, we propose a fault-tolerant node scheduling scheme to solve the coverage problem in sensor networks.
Symbol grounding through robotic manipulation in cognitive systems
Authors: Eris Chinellato, Antonio Morales, Enric Cervera, Angel P. del Pobil
Venue: Robotics and Autonomous Systems (2007)

Though proposals have been put forth to solve the classical symbol grounding problem through robotic sensorimotor interactions, only little progress has been made in this direction with actual working systems, and symbol grounding through physical interaction has been rarely dealt with. We address this problem in the context of robotic manipulation for cognitive systems, and claim that there are symbols which do not refer simply to physical objects but rather to the embodied interactions between the robot and the objects in its environment. Through the description of two manipulation experiments we offer a proposal on which to build a theory of symbolic representations for physical interactions. Some important neuroscience studies that support our view are also briefly described.
A Unified Service Discovery Framework
Authors: Beihong Jin, Liang Zhang, Zhi Zang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The requirements of service discovery are spread everywhere as service discovery is the prerequisite of resource sharing, data integration and process collaboration in the network environments. In this paper, a unified service discovery framework Service CatalogNet is presented to cover many application scenarios including grid environment. We introduce the service description model in Service CatalogNet which can describe non-functional features by dynamic contexts and is supported by the semantic query engine. We also propose the unified service discovery mechanism and give the evaluations of the algorithm in terms of number of messages and query time.