ppxscal/embedding_network huggingface dataset:
Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
Authors: Noboru Kunihiro, Kaoru Kurosawa
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA, where N = prq while ed = 1 mod (p-1)(q-1). In this paper, we show that a deterministic polynomial time equivalence also holds in this variant. The coefficient matrix T to which LLL algorithm is applied is no longer lower triangular, and hence we develop a new technique to overcome this problem.
Detection of cloaked web spam by using tag-based methods
Authors: Jun-Lin Lin
Venue: Expert Systems with Applications: An International Journal (2009)

Web spam attempts to influence search engine ranking algorithm in order to boost the rankings of specific web pages in search engine results. Cloaking is a widely adopted technique of concealing web spam by replying different content to search engines' crawlers from that displayed in a web browser. Previous work on cloaking detection is mainly based on the differences in terms and/or links between multiple copies of a URL retrieved from web browser and search engine crawler perspectives. This work presents three methods of using difference in tags to determine whether a URL is cloaked. Since the tags of a web page generally do not change as frequently and significantly as the terms and links of the web page, tag-based cloaking detection methods can work more effectively than the term- or link-based methods. The proposed methods are tested with a dataset of URLs covering short-, medium- and long-term users' interest. Experimental results indicate that the tag-based methods outperform term- or link-based methods in both precision and recall. Moreover, a Weka J4.8 classifier using a combination of term and tag features yields an accuracy rate of 90.48%.
Capacity Analysis on OFDM Based Two-Hop Regenerative Wireless Networks with Selective Relaying
Authors: Danpu Liu, Guangxin Yue
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Selective relaying periodically selects one single relay with the best channel quality to participate the communication between source and destination. When OFDM is used as the physical layer technique in the network, a new problem is how to select the best relay since independent subcarriers may have different channel conditions. Several schemes have been presented, while their capacities are still unknown. This paper investigates the capacity of OFDM based two-hop regenerative wireless networks with optimal selective relaying in theory. Simulation results validate theoretical analysis. Furthermore, capacities in more practical and suboptimal cases are also simulated and analyzed.
Towards integrated and efficient scientific sensor data processing: a database approach
Authors: Ji Wu, Yongluan Zhou, Karl Aberer, Kian-Lee Tan
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In this work, we focus on managing scientific environmental data, which are measurement readings collected from wireless sensors. In environmental science applications, raw sensor data often need to be validated, interpolated, aligned and aggregated before being used to construct meaningful result sets. Due to the lack of a system that integrates all the necessary processing steps, scientists often resort to multiple tools to manage and process the data, which can severely affect the efficiency of their work. In this paper, we propose a new data processing framework, HyperGrid, to address the problem. HyperGrid adopts a generic data model and a generic query processing and optimization framework. It offers an integrated environment to store, query, analyze and visualize scientific datasets. The experiments on real query set and data set show that the framework not only introduces little processing overhead, but also provides abundant opportunities to optimize the processing cost and thus significantly enhances the processing efficiency.
The application of optical character recognition techniques to bandwidth compression of facsimile data
Authors: Patrice J. Capitant, Robert H. Wallis
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The goal of facsimile bandwidth compression is the efficient transmission of documents achieved by the removal of redundancy in the encoding technique. For the case of printed or typewritten documents, the most powerful encoding technique is the Combined Symbol Matching (CSM) algorithm, which is based on the detection of recurrent patterns (such as alphanumeric characters) in the document being encoded &lang;4, 5, 6, 10&rang;. As the transmitter scans the document, it locates and extracts isolated patterns, transmits them to the receiver, and stores them in a library. Using the received patterns, the receiver also accumulates an exact copy of the transmitter's library. As each new pattern is isolated, it is compared with the library patterns which have been previously encountered. If the pattern is unfamiliar, it is added to the library. However if a "match" is detected, this indicates a recurrence of a pattern, and there is no need to retransmit it, since it is available in the receiver's copy of the library. Therefore, the library entry number (library ID) is transmitted instead, enabling the receiver to reconstruct the pattern from the "prototype" in its library. Since the library ID can be transmitted with far fewer bits than the binary pattern that it points to, a significant bandwidth compression may be attained. For printed documents, the CSM algorithm is typically twice as efficient as the best run-length coding algorithms.
Generalized Framework for Syntax-Based Relation Mining
Authors: Bonaventura Coppola, Alessandro Moschitti, Daniele Pighin
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Supervised approaches to Data Mining are particularly appealing as they allow for the extraction of complex relations from data objects. In order to facilitate their application in different areas, ranging from protein to protein interaction in bioinformatics to text mining in computational linguistics research, a modular and general mining framework is needed. The major constraint to the generalization process concerns the feature design for the description of relational data. In this paper, we present a machine learning framework for the automatic mining of relations, where the target objects are structurally organized in a tree. Object types are generalized by means of the use of roles, whereas the relation properties are described by means of the underlying tree structure. The latter is encoded in the learning algorithm thanks to kernel methods for structured data, which represent structures in terms of their all possible subparts. This approach can be applied to any kind of data disregarding their very nature. Experiments with Support Vector Machines on two text mining datasets for relation extraction, i.e. the PropBank and FrameNet corpora, show both that our approach is general, and that it reaches state-of-the-art accuracy.
Accelerating critical section execution with asymmetric multi-core architectures
Authors: M. Aater Suleman, Onur Mutlu, Moinuddin K. Qureshi, Yale N. Patt
Venue: Proceeding of the 14th international conference on Architectural support for programming languages and operating systems (2009)

To improve the performance of a single application on Chip Multiprocessors (CMPs), the application must be split into threads which execute concurrently on multiple cores. In multi-threaded applications, critical sections are used to ensure that only one thread accesses shared data at any given time. Critical sections can serialize the execution of threads, which significantly reduces performance and scalability. This paper proposes Accelerated Critical Sections (ACS), a technique that leverages the high-performance core(s) of an Asymmetric Chip Multiprocessor (ACMP) to accelerate the execution of critical sections. In ACS, selected critical sections are executed by a high-performance core, which can execute the critical section faster than the other, smaller cores. As a result, ACS reduces serialization: it lowers the likelihood of threads waiting for a critical section to finish. Our evaluation on a set of 12 critical-section-intensive workloads shows that ACS reduces the average execution time by 34% compared to an equal-area 32T-core symmetric CMP and by 23% compared to an equal-area ACMP. Moreover, for 7 out of the 12 workloads, ACS improves scalability by increasing the number of threads at which performance saturates.
HMMer acceleration using systolic array based reconfigurable architecture
Authors: Yanteng Sun, Peng Li, Guochang Gu, Yuan Wen, Yuan Liu, Dong Liu
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

HMMer is a widely-used bioinformatics software package that uses profile Hidden Markov Models (HMMs) to model the primary structure consensus of a family of protein or nucleic acid sequences. However, with the rapid growth of both sequence and model databases, it is more and more time-consuming to run HMMer on traditional computer architecture. With the development of modern field programmable gate array (FPGA) technology, applications can be accelerated using CPU-FPGA cooperative system by mapping computational-intensive work onto FPGA. In this paper, the computation kernel of HMMer, P7Viterbi, is selected to be accelerated by FPGA. After carefully data dependency analysis, we proposed a systolic array based reconfigurable architecture to exploit both inter-module and intra-module parallelism. There is an infrequent feedback loop in P7Viterbi to update the value of beginning state (B state), which limits further parallelization. Previous work either ignored the feedback loop or serialized the process, leading to loss of either precision or efficiency. Our proposed architecture can exploit maximum parallelism without loss of precision. The proposed architecture speculatively runs with fully parallelism assuming that the feedback loop does not take place. If the rare feedback case actually occurs, a rollback mechanism is used to ensure correctness. Results show that by using Xilinx Virtex-5 110T FPGA, the proposed architecture can achieve about a 56.8 times speedup compared with that of Intel Core2 Duo 2.33GHz CPU.
Complete numerical isolation of real roots in zero-dimensional triangular systems
Authors: Jin-San Cheng, Xiao-Shan Gao, Chee-Keng Yap
Venue: Journal of Symbolic Computation (2009)

We present a complete numerical algorithm for isolating all the real zeros of a zero-dimensional triangular polynomial system F"n@?Z[x"1...x"n]. Our system F"n is general, with no further assumptions. In particular, our algorithm successfully treats multiple zeros directly in such systems. A key idea is to introduce evaluation bounds and sleeve bounds. We also present a much more efficient algorithm for zero-dimensional triangular systems without multiple roots. We implemented our algorithms, and promising experimental results are shown.
Design of an Intelligent Global Terminal Backsteping Controller for a Class of Constrained Input Systems
Authors: Jinhua Wu, Junwei Lei, Jinyong Yu, Zuoe Fan
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

A new intelligent global terminal backsteping design method is proposed for a class of constrained input systems. It has several advantages as the following. Firstly, the differential bomb problem is avoided because of the no time derivative design concept. So the control law is simplified and the system becomes more stable and robust. Secondly, a quantitative analysis about the convergence time of each step is discussed by adopting the global terminal control rule based on the popular backstepping design method. At last, the high gain problem and input saturation problem are solved successfully by adopting the soft function and intelligent rule of regulation for parameters of controller. The control law intelligently regulate the convergence time to make the control as small as possible to avoid the saturation of input. So the method is meaningful because it is able to solve the constrained input problem, differential bomb problem and high gain feedback problem successfully. And the numerical simulation shows the effectiveness of this proposed method
Cluster head election techniques for coverage preservation in wireless sensor networks
Authors: Stanislava Soro, Wendi B. Heinzelman
Venue: Ad Hoc Networks (2009)

Coverage preservation is one of the basic QoS requirements of wireless sensor networks, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles in applications that require complete coverage of the monitored area over long periods of time. In this paper, we take a unique look at the cluster head election problem, specifically concentrating on applications where the maintenance of full network coverage is the main requirement. Our approach for cluster-based network organization is based on a set of coverage-aware cost metrics that favor nodes deployed in densely populated network areas as better candidates for cluster head nodes, active sensor nodes and routers. Compared with using traditional energy-based selection methods, using coverage-aware selection of cluster head nodes, active sensor nodes and routers in a clustered sensor network increases the time during which full coverage of the monitored area can be maintained anywhere from 25% to 4.5x, depending on the application scenario.
Plan recognition for interface agents
Authors: Marcelo Gabriel Armentano, Analía Amandi
Venue: Artificial Intelligence Review (2007)

Interface agents are computer programs that provide personalized assistance to a user dealing with computer based applications. By understanding the tasks the user performs in a software application an interface agent could be aware of the context that represents the user's focus of attention at each particular moment. With this purpose, plan recognition aims at identifying the plans or goals of a user from the tasks he (for simplicity, we use "he" to refer to the user, but we do not mean any distinctions about sexes) performs. A prerequisite for the recognition of plans is knowledge of a user's possible tasks and the combination of these tasks in complex task sequences, which describes typical user behavior. Plan recognition will enable an interface agent to reason about what the user might do next so that it can determine how to assist him. In this work we present the state of the art in Plan Recognition, paying special attention to the features that make it useful to interface agents. These features include the ability to deal with uncertainty, multiple plans, multiple interleaved goals, overloaded tasks, noisy tasks, interruptions and the capability to adapt to a particular user.
Network flow-based power optimization under timing constraints in MSV-driven floorplanning
Authors: Qiang Ma, Evangeline F. Y. Young
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Power consumption has become a crucial problem in modern circuit design. Multiple Supply Voltage (MSV) design is introduced to provide higher flexibility in controlling the power and performance tradeoff. One important requirement of MSV design is that timing constraints of the circuit must be satisfied after voltage assignment of the cells. In this paper, we will show that the voltage assignment task on a given netlist can be formulated as a convex cost dual network flow problem and can be solved optimally in polynomial time using a cost-scaling algorithm when the delay choices of each module are continuous in the real or integer domain. We can make use of this approach to obtain a feasible voltage assignment solution in the general cases with power consumption approximating the minimum one. Furthermore, we will propose a framework to optimize power consumption and physical layout of a circuit simultaneously during the floorplanning stage, by embedding this cost-scaling solver into a simulated annealing based floorplanner. This is effective in practice due to the short running time of the solver. We compared our approach with the latest work [9] on the same problem, and the experimental results show that, using our framework, significant improvement on power saving (18% less power cost on average) can be achieved in much less running time (7X faster on average) for all the test cases, which confirms the effectiveness of our approach.
The changing dynamic of social interaction in World of Warcraft: the impacts of game feature change
Authors: Vivian Hsueh-hua Chen, Henry Been-Lirn Duh, Hong Renyi
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

This study examines how changes in game features through patches and expansions can affect the social interaction within massively multiplayer games. Since patches and expansions are now commonplace within massively multiplayer games, understanding of the relationship would enable better production of social capital. In-depth interviews uncovered that the recent changes to the World of Warcraft affect in-game social interaction in 3 aspects. The areas of social interaction affected included interpersonal relationships, community size and social alienation. The discussions highlight how these findings can advance models of social interaction within MMOs.
Generalized Scalar Multiplication Secure against SPA, DPA, and RPA
Authors: Atsuko Miyaji
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In the execution on a smart card, elliptic curve cryptosystems have to be secure against side channel attacks such as the simple power analysis (SPA), the differential power analysis (DPA), and the refined power analysis (RPA), and so on. MMM-algorithm proposed by Mamiya, Miyaji, and Morimoto is a scalar multiplication algorithm secure against SPA, DPA, and RPA, which can decrease the computational complexity by increasing the size of a pre-computed table. However, it provides only 4 different cases of pre-computed tables. From the practical point of view, a wider range of time-memory tradeoffs is usually desired. This paper generalizes MMM-algorithm to improve the flexibility of tables as well as the computational complexity. Our improved algorithm is secure, efficient and flexible for the storage size.
Simulation optimization with mathematical programming representation of discrete event systems
Authors: Andrea Matta
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Optimization-via-simulation consists in applying iteratively two detached models until an optimality condition is reached: a simulation model for predicting the system performance, and a model for generating potential optimal solutions. Mathematical programming representation has been recently used to describe the behavior of discrete event systems as well as their formal properties. This paper proposes explicit mathematical programming representations for jointly simulating and optimizing discrete event systems. The main advantage of such models is the rapidity of searching for the optimal solution, given to the explicit knowledge of objective function and constraints. Three types of formulations are proposed for solving the buffer allocation problem in flow lines with finite buffer capacities: an exact mixed integer linear model, an approximate LP model and a stochastic programming model. Numerical analysis shows that the computational time required to solve resource allocation problems can be significantly reduced by using the proposed formulations.
Stimulated Brillouin scattering of various specialty fibers and its application in slow light
Authors: Changyong Tian, Chongqing Wu, P. Shum, Li xia, Songnian Fu, Ning Guo
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

We have tested and characterized the stimulated brillion scatter (SBS) optical spectrum in single-mode optical fibre (SMF), photosensitive fibres (PSF) and photonic crystal fibers (PCF). The different refractive indexes of fibbers cause different Brillion frequency shifts. We have also demonstrated the slow light in SMF visa SBS. The width of 100ns pulse can be delayed from 0ns to 40ns by tuning the power of the pump.
Proceedings of the ACM 2009 international conference on Supporting group work
Venue: Conference on Supporting Group Work (2009)

It is our great pleasure to welcome you to GROUP 2009. This year's conference continues its tradition of being an international conference that offers a venue for research bridging the fields of Computer Supported Cooperative Work (CSCW) and Information Systems (IS), with a continued focus on collaboration and organization and increasing attention to Social Computing. We find ourselves once again on lovely Sanibel Island, but this time we are enjoying the weather in May instead of November. To accommodate changes in the timing of CSCW, the Group community decided to reconvene only 18 months after our last meeting. This provided many scheduling challenges but we are very pleased with the demonstrated commitment to Group of the many people who submitted papers and reviewed them, and to those of you who could join us at the conference. We could not be here without your willingness to submit, review and meet "off season" for Group this year. (We'll convene again in November, 2010.) The call for papers attracted 110 submissions from Asia, Latin America, Europe, and North America. The program committee accepted 35 Papers and 5 Notes that cover a variety of topics, including collaborative tools and technologies, computer mediated communication, and social software. In addition to three pre-conference workshops, we are able to host the second Doctoral Consortium at Group, with generous funding from the National Science Foundation, bringing together 14 advanced PhD students for a full-day workshop with leading researchers in our field. During the poster session you will be able to see what these students are working on, and you will find posters from other researchers in academia and industry whom we have invited to present at Group as well.
TRIUMF - A System for Remote Multimedia Interviewing
Authors: M. Kiddell, M. Chen, D. J. Oborne, F. W. Slater, M. McCulloch
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Modern communication technologies enable recruitment interviews to be held remotely through the use of video conferencing. However, the effective deployment of such services, at a standard comparable to traditional face-to-face interviews, requires an integrated hardware and software environment to support a wide range of activities during recruitment interviews. In this paper, we present a system for such an environment, and demonstrate how multimedia communications are managed in the environment and how they can be used to assist the interviews in ways that would not be easily achievable in traditional face-to-face interviews.