ppxscal/embedding_network huggingface dataset:
Squirrel: An Advanced Semantic Search and Browse Facility
Authors: Alistair Duke, Tim Glover, John Davies
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Search is seen as a key application that can benefit from semantic technology with improvements to recall and precision over conventional Information Retrieval techniques. This paper describes Squirrel, a search and browse tool that provides access to semantically annotated data. Squirrel provides combined keyword based and semantic searching. The intention is to provide a balance between the speed and ease of use of simple free text search and the power of semantic search. In addition, the ontological approach provides the user with a much richer browsing experience. Squirrel builds on and integrates a number of semantic technology components. These include machine learning and information extraction components which generate, extract and manage semantic metadata contained within and about textual documents at index time. A number of run-time components have also been integrated to deliver an enhanced user experience which goes beyond merely presenting a list of documents as a query response. The tool has been trialled and evaluated in two case studies and we report early results from this exercise, revealing promising results.
Mitigating Soft Errors in SRAM Address Decoders Using Built-in Current Sensors
Authors: Egas Henes Neto, Gilson Wirth, Fernanda Lima Kastensmidt
Venue: Journal of Electronic Testing: Theory and Applications (2008)

In this paper, we propose a diagnose strategy based on built-in current sensors able to detect the effects of single event transients (SETs) in SRAM memory decoders. By analyzing the effects, it is possible to mitigate the error by warning the system about the erroneous write and read operation or by circuit error correction avoiding catastrophic multiple bit upset errors. While EDAC can only protect faults in the memory cell array, the proposed method can cope with faults in the combinational memory circuitry. This BICS-based technique can be used in combination with EDAC to achieve high reliability in memories fabricated in nanometer technologies. Our methodology has been validated by Spice simulation and results show that our approach presents a low area, performance and power dissipation penalty.
Standby Power Control Architecture in Context-Aware Home Networks
Authors: Joon Heo, Ji Hyuk Heo, Choong Seon Hong, Seok Bong Kang, Sang Soo Jeon
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

Standby power is the energy consumed by appliances when they are not performing their main functions or when they are switched off. In this paper, we propose a Host-Agent based standby power control architecture in context-aware home network. The proposed architecture uses the IEEE 802.15.4 based ZigBee protocol between Host and Agent for communication and security. We have made an experiment on according to various context-aware scenarios using the implemented prototype devices.
An Efficient ID-Based Proxy Signature Scheme from Pairings
Authors: Chunxiang Gu, Yuefei Zhu
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is only one, so our scheme is more efficient comparatively. The new scheme can be proved secure with the hardness assumption of the k-Bilinear Diffie-Hellman Inverse problem, in the random oracle model.
Understanding Users' Attitudes Towards Using a VoIP Survey
Authors: Hsiu-Mei Huang, Chun-Hung Hsieh, Pei-I Yang, Chung-Min Lai, Wei-Hong Lin
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

The Internet phone is a popular new technology. Several researches have been done on Internet phone technology. Many researches were done on how to make use of the Internet phone. The purpose of this paper is to explore users' perceptions on the use of the Internet phone as a survey tool.There are five factors that include usefulness, ease-of-use, perceived liking, perceived self-efficacy and computer anxiety in this study. This questionnaire was designed based on prior factors. Next, the questionnaire is used to collect data that explores users' intentions to using a VoIP survey. The analysis tool of this study is to apply cluster analysis, discrimination analysis and an independent-sample T test.The results show that the k-means clustering is able to detect factor relationships and patterns for users' attitudes towards a VoIP survey. In this study, k-means clustering classifies users' attitudes into high pleasure and low pleasure towards a VoIP survey. After that, classification results indicate 97.3% of original grouped cases correctly classified and 97.3% of cross-validated grouped cases correctly classified.Finally, this study contributes to understanding that both self-efficacy and perceived anxiety are main factors to the impact users' attitudes toward a VoIP survey.
Opportunistic Acquisition of Adaptation Knowledge and Cases -- The IakA Approach
Authors: Amélie Cordier, Béatrice Fuchs, Léonardo Lana De Carvalho, Jean Lieber, Alain Mille
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

A case-based reasoning system relies on different knowledge containers, including cases and adaptation knowledge. The knowledge acquisition that aims at enriching these containers for the purpose of improving the accuracy of the CBR inference may take place during design, maintenance, and also on-line, during the use of the system. This paper describes IakA, an approach to on-line acquisition of cases and adaptation knowledge based on interactions with an oracle (a kind of "ideal expert"). IakA exploits failures of the CBR inference: when such a failure occurs, the system interacts with the oracle to repair the knowledge base. IakA-NF is a prototype for testing IakA in the domain of numerical functions with an automatic oracle. Two experiments show how IakA opportunistic knowledge acquisition improves the accuracy of the CBR system inferences. The paper also discusses the possible links between IakA and other knowledge acquisition approaches.
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
Authors: C. Greg Plaxton
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We present a fast algorithm for the following classic scheduling problem: Determine a maximum-weight schedule for a collection of unit jobs, each of which has an associated release time, deadline, and weight. All previous algorithms for this problem have at least quadratic worst-case complexity. This job scheduling problem can also be viewed as a special case of weighted bipartite matching: each job represents a vertex on the left side of the bipartite graph; each time slot represents a vertex on the right side; each job is connected by an edge to all time slots between its release time and deadline; all of the edges adjacent to a given job have weight equal to the weight of the job. Letting U denote the set of jobs and V denote the set of time slots, our algorithm runs in O(|U| + klog2 k) time, where k ≤ min {|U|,|V|} denotes the cardinality of a maximum-cardinality matching. Thus our algorithm runs in nearly linear time, a dramatic improvement over the previous quadratic bounds.
Gradually Convertible Undeniable Signatures
Authors: Laila Aimani, Damien Vergnaud
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

In 1990, Boyar, Chaum, Damgård and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted by the signer to ordinary signatures. Michels, Petersen and Horster presented, in 1996, an attack on the Elgamal-based seminal scheme of Boyar et al. and proposed a repaired version without formal security analysis. In this paper, we modify their protocol so that it becomes a generic one and it provides an advanced feature which permits the signer to universally convert achronously all signatures pertaining to a specific time period. We supply a formal security treatment of the modified scheme: we prove, in the generic group model, that the protocol is existentially unforgeable and anonymous under chosen message attacks, assuming new assumptions (though reasonable) on the underlying hash function.
Active Class Selection
Authors: R. Lomasky, C. E. Brodley, M. Aernecke, D. Walt, M. Friedl
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

This paper presents Active Class Selection (ACS), a new class of problems for multi-class supervised learning. If one can control the classes from which training data is generated, utilizing feedback during learning to guide the generation of new training data will yield better performance than learning from any a priori fixed class distribution. ACS is the process of iteratively selecting class proportions for data generation. In this paper we present several methods for ACS. In an empirical evaluation, we show that for a fixed number of training instances, methods based on increasing class stability outperform methods that seek to maximize class accuracy or that use random sampling. Finally we present results of a deployed system for our motivating application: training an artificial nose to discriminate vapors.
A First Step towards Argument Mining and Its Use in Arguing Agents and ITS
Authors: Safia Abbas, Hajime Sawamura
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Argumentation is an interdisciplinary research area that incorporates many fields such as artificial intelligence, multi-agent systems, and collaborative learning. Although different argumentation tools have been developed, a structured data representation format has been missing. Recent researches have focused on applying mining techniques to find meaningful knowledge from these unstructured textual data. This paper reports work in progress on building Relational Argument DataBase(RADB) for argument mining and its use in arguing agents and ITS. The RADB depends on the Argumentation Interchange Format Ontology (AIF) using "Walton Theory" for argument analysis. Our aim is to present a preliminary attempt to support argument construction for agents and/or humans from structured argument database together with different mining techniques. We also discuss the usage of relational argument database in agent-based intelligent tutoring system(ITS) framework.
Efficient Algorithms for Non-Rational and Rational Bézier Curves
Authors: Natasha Dejdumrong
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

In this paper, a new basis with linear computational complexity has been introduced and used to form non-rational and rational curves. Two algorithms for computing points on non-rational and rational proposed curves are expressed with their linear complexity. Moreover, the relationships between these proposed curves and the Bézier curves, for both non-rational and rational forms, are given by using polar form and homogeneous coordinate approaches. Consequently, two efficient algorithms with linear complexity have been introduced to be used in drawing non-rational and rational Bézier curves.
Scale-Splitting Error in Complex Automata Models for Reaction-Diffusion Systems
Authors: Alfonso Caiazzo, Jean Luc Falcone, Bastien Chopard, Alfons G. Hoekstra
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Complex Automata (CxA) have been recently proposed as a paradigm for the simulation of multiscale systems. A CxA model is constructed decomposing a multiscale process into single scale sub-models, each simulated using a Cellular Automata algorithm, interacting across the scales via appropriate coupling templates. Focusing on a reaction-diffusion system, we introduce a mathematical framework for CxA modeling. We aim at the identification of error sources in the modeling stages, investigating in particular how the errors depend upon scale separation. Theoretical error estimates will be presented and numerically validated on a simple benchmark, based on a periodic reaction-diffusion problem solved via multistep lattice Boltzmann method.
ULISSE, a network intrusion detection system
Authors: Stefano Zanero
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

In this paper we present a tool for network anomaly detection and network intelligence which we named ULISSE. It uses a two tier architecture with unsupervised learning algorithms to perform network intrusion and anomaly detection. ULISSE uses a combination of clustering of packet payloads and correlation of anomalies in the packet stream. We show the experiments we conducted on such architecture, we give performance results, and we compare our achievements with other comparable existing systems.
Online payment service providers and customer relationship management
Authors: Alan D. Smith
Venue: International Journal of Electronic Finance (2008)

With the rise of e-commerce, online payment service providers, such as PayPal, have proven to be an effective tool for online transactions. A personal interview of 190 semi-professional and professional working adults within the metropolitan area of Pittsburgh, PA, derived from several companies in the service sectors. A total of 20 variables were collected and represented in the final analysis of the dataset. Using chi-square and multiple linear regression techniques during the hypothesis-testing procedure, with active enrolment in PayPal online payment services as the dependent variable, yielded interesting results. Customer Relationship Management (CRM) is an important part of online payment service providers' future. As evident in the present study, many potential customers still opt for a more costly transactional approach by paying for online purchases with a credit card instead of signing up for an online payment service account.
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
Authors: Prasad Chebolu, Alan Frieze, Páll Melsted
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic factor.
Multipath Key Establishment for Wireless Sensor Networks Using Just-Enough Redundancy Transmission
Authors: Jing Deng, Yunghsiang S. Han
Venue: IEEE Transactions on Dependable and Secure Computing (2008)

In random key pre-distribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and loaded on the sensors prior to deployment. After deployment, each sensor tries to find a common key shared by itself and each of its neighbors to establish a link key to protect the wireless communication between themselves. One intrinsic disadvantage of such techniques is that some neighboring sensors do not share any common key. In order to establish a link key among such neighbors, a multi-hop secure path may be used to deliver the secret. Unfortunately, the possibility of sensors being compromised on the path may render such establishment process insecure. In this work, we propose and analyze a Just Enough Redundancy Transmission (JERT) scheme that uses the powerful Maximum Distance Separable (MDS) codes to address the problem. In the JERT scheme, the secret link key is encoded in (n, k) MDS code and transmitted through multiple multi-hop paths. To reduce the total information that needs to be transmitted, the redundant symbols of the MDS codes are transmitted only if the destination fails to decode the secret. The JERT scheme is demonstrated to be efficient and resilient against node capture. One salient feature of the JERT scheme is its flexibility of trading transmission for lower information disclosure.
A Capability Assessment Framework for the Adoption of B2B Integration Systems
Authors: Spyros Mouzakitis, Dimitris Askounis
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

In today's information intensive business world it is critical that decision-makers across the entire supply chain have access to knowledge that is crucial in helping them make more informed business decisions for the adoption of B2B integration (B2Bi) systems. This paper presents a practical capability assessment framework that aims to provide knowledge and in-focus guidance to the enterprises in their effort to adopt B2Bi systems. Our methodology and findings can assist enterprises and public bodies to utilize, share and enrich a knowledge base about B2Bi organizational readiness, throughout their evolution as part of the Knowledge Society.
The Design of a Control Unit-Reflections on Reading Babbage's Notebooks
Authors: M. V. Wilkes
Venue: IEEE Annals of the History of Computing (1981)

Babbage published very little on the detailed design of the control system for the Analytical Engine. In this paper the author puts forward a possible reason for this and discusses the relationship between Babbage's ideas as revealed in his unpublished work and modern concepts.
Some Experiments in Humour Recognition Using the Italian Wikiquote Collection
Authors: Davide Buscaldi, Paolo Rosso
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper we present some results obtained in humour classification over a corpus of Italian quotations manually extracted and tagged from the Wikiquote project. The experiments were carried out using both a multinomial Naïve Bayes classifier and a Support Vector Machine (SVM). The considered features range from single words to n-grams and sentence length. The obtained results show that it is possible to identify the funny quotes even with the simplest features (bag of words); the bayesian classifier performed better than the SVM. However, the size of the corpus size is too small to support definitive assertions.
FPGA Intrinsic PUFs and Their Use for IP Protection
Authors: Jorge Guajardo, Sandeep S. Kumar, Geert-Jan Schrijen, Pim Tuyls
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

In recent years, IP protection of FPGA hardware designs has become a requirement for many IP vendors. In [34], Simpson and Schaumont proposed a fundamentally different approach to IP protection on FPGAs based on the use of Physical Unclonable Functions (PUFs). Their work only assumes the existence of a PUF on the FPGAs without actually proposing a PUF construction. In this paper, we propose new protocols for the IP protection problem on FPGAs and provide the first construction of a PUF intrinsic to current FPGAs based on SRAM memory randomness present on current FPGAs. We analyze SRAM-based PUF statistical properties and investigate the trade offs that can be made when implementing a fuzzy extractor.
A penalty finite volume method for the transient Navier--Stokes equations
Authors: Guoliang He, Yinnian He, Zhangxin Chen
Venue: Applied Numerical Mathematics (2008)

A fully discrete penalty finite volume method is introduced for the discretization of the two-dimensional transient Navier-Stokes equations, where the temporal discretization is based on a backward Euler scheme and the spatial discretization is based on a finite volume scheme that uses a pair of P"2-P"0 trial functions on triangles. This method allows us to efficiently separate the computation of velocity from that of pressure with reasonably large time steps, and conserves mass locally. In addition, error estimates of optimal order are obtained for the fully discrete method under reasonable assumptions on temporal and spatial step sizes and the physical data. Finally, we present two numerical examples to illustrate the numerical algorithms developed and to show numerical results that agree with the theory established.
Managing Multicore with OpenMP (Extended Abstract)
Authors: Barbara Chapman
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

High end distributed and distributed shared memory platforms with many thousands of cores will be deployed in the coming years to solve the toughest technical problems. Their individual nodes will be heterogeneous multithreading, multicore systems, capable of executing many threads of control, and with a deep memory hierarchy. For example, the petascale architecture to be put in production at the US National Center for Supercomputing Applications (NCSA) in 2011 is based on the IBM Power7 chip which uses multicore processor technology. Thousands of compute nodes with over 200,000 cores are envisioned. The Roadrunner system that will be deployed at the Los Alamos National Laboratory (LANL) is expected to have heterogneous nodes, with both AMD Opterons and IBM Cells configured, and a similar number of cores.
Internet Usage Status among Chinese College Students
Authors: Yan Li
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

The study was carried out to determine Internet usage status among Chinese college students and how personal differences impact students' online activities. Quantitative research was employed and the findings were descriptive in nature. Results showed that the majority (80%) of participating Zhejiang University (ZJU) students (N=596) currently owned PCs. Averagely, they spent 3.11 hrs per day using computer, within which 2.51 hrs with online activities. ZJU students participated in nine of the fifteen listed online activities frequently. Half of them used study-related websites and browsed online programs frequently. Only 39% used major related websites frequently. Most students did not use English websites or use Internet to communicate with teachers frequently. Few students knew how to make web page. Gender and other five factors had different impact on students' different online activities.
Sorting and Element Distinctness on One-Way Turing Machines
Authors: Holger Petersen
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

For nondeterministic Turing machines with one work-tape and one-way input a lower time bound ¿(m 2¿) on sorting m strings of length ¿ each is shown, which matches the upper bound. For the related Element Distinctness Problem with input of the same format we prove the upper bound O(m 2) if ¿ = O(m/logm), showing this problem to be easier than sorting. The bound O(m 2) also holds for deterministic machines if ¿ = c + logm with constant c. For this problem Szepietowski has shown the bound ¿(m 2logm) on deterministic Turing machines without input tape.