ppxscal/embedding_network huggingface dataset:
Atomic Secure Multi-party Multiplication with Low Communication
Authors: Ronald Cramer, Ivan Damgård, Robbert Haan
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir's secret sharing scheme and it can be viewed as a practical variation on one of the central techniques in the foundational results of Ben-Or, Goldwasser, and Wigderson and Chaum, Crépeau, and Damgaard on secure multi-party computation. Rabin's idea is a key ingredient to virtually all practical protocols in threshold cryptography.Given a passive t-adversary in the secure channels model with synchronous communication, for example, secure multiplication of two secret-shared elements from a finite field K based on this idea uses one communication round and has the network exchange O(n 2) field elements, if t = ¿(n) and t < n/2 and if n is the number of players. This is because each of O(n) players must perform Shamir secret sharing as part of the protocol. This paper demonstrates that under a few restrictions much more efficient protocols are possible; even at the level of a single multiplication.We demonstrate a twist on Rabin's idea that enables one-round secure multiplication with just O(n) bandwidth in certain settings, thus reducing it from quadratic to linear. The ideas involved can additionally be employed in the evaluation of arithmetic circuits, where under appropriate circumstances similar efficiency gains can be obtained.
Autonomic Workflow Management in the Grid
Authors: Guangsheng Zhang, Changjun Jiang, Jing Sha, Ping Sun
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The autonomic workflow engine enables workflow to be dynamically specified and adapted using Event-Condition-Action rules.Anew approach to autonomic execution of workflow processes based on matrix-based formulation was adopted that, together with the Petri net marking transition equation, provides a full dynamical description of a workflow system. We have built a workflow that models Traffic-information-grid-based Mobile Navigation Service to illustrate the quality of self-management using DEC through awareness of the computational environment.
A Novel Web Page Analysis Method for Efficient Reasoning of User Preference
Authors: Seunghwa Lee, Minchul Jung, Eunseok Lee
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

The amount of information on the Web is rapidly increasing. Recommender systems can help users selectively filter this information based on their preferences. One way to obtain user preferences is to analyze characteristics of content that is accessed by the user. Unfortunately, web pages may contain elements irrelevant to user interests (e.g., navigation bar, advertisements, and links.). Hence, existing analysis approaches using the TF-IDF method may not be suitable. This paper proposes a novel user preference analysis system that eliminates elements that repeatedly appear in web pages. It extracts user interest keywords in the identified primary content. Also, the system has features that collect the anchor tag, and track the user's search route, in order to identify keywords that are of core interest to the user. This paper compares the proposed system with pure TF-IDF analysis method. The analysis confirms its effectiveness in terms of the accuracy of the analyzed user profiles.
Malware Models for Network and Service Management
Authors: Jérôme François, Radu State, Olivier Festor
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Different kinds of malware like the botnets and the worms are a main threat on Internet for the current and future. Their effectiveness to control systems is proved and we are investigating the malware mechanisms that can be adapted to get an efficient and scalable management plane. Our work consists in modelling malware based network management and assessing its performance.
Collision-Based Power Analysis of Modular Exponentiation Using Chosen-Message Pairs
Authors: Naofumi Homma, Atsushi Miyamoto, Takafumi Aoki, Akashi Satoh, Adi Shamir
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

This paper proposes new chosen-message power-analysis attacks against public-key cryptosystems based on modular exponentiation, which use specific input pairs to generate collisions between squaring operations at different locations in the two power traces. Unlike previous attacks of this kind, the new attacks can be applied to all the standard implementations of the exponentiation process: binary (left-to-right and right-to-left), m-ary, and sliding window methods. The SPA countermeasure of inserting dummy multiplications can also be defeated (in some cases) by using the proposed attacks. The effectiveness of the attacks is demonstrated by actual experiments with hardware and software implementations of RSA on an FPGA and the PowerPC processor, respectively. In addition to the new collision generation methods, a high-accuracy waveform matching technique is introduced to detect the collisions even when the recorded signals are noisy and the clock has some jitter.
A Modern Approach to Intelligent Animation: Theory and Practice, 1 edition
Authors: Yueting Zhuang, Yunhe Pan, Jun Xiao
Venue: Advanced Topics In Science And Technology In China (2008)

Part of the new series, Advanced Topics in Science and Technology in China, this book discusses concepts, theory, and core technologies of intelligent theory and human animation, including video based human animation, and intelligent technology of motion data management and reusing. It introduces systems developed to demonstrate the technologies of video based animation. Each chapter is independent. Lively pictures and demos will be presented to make the theory and technologies more understandable. For researchers, this is a reference book and an update on the current status of human animation. For professionals, this is a guide for application development using human animation technologies. Yueting Zhuang received his PhD in Computer Science from Zhejiang University (1998). From 1997 to 1998, he was a visiting scholar at Beckman Institute, U. of Illinois, Urbana-Champaign. Now he is a full professor of the College of Computer Science at Zhejiang University. His research area is intelligent animation, multimedia technologies. Yunhe Pan was the President of Zhejiang University from 1995 to 2006. Now he is the Vice-President of the Chinese Academy of Engineering. His current research area includes intelligent human animation, digital library, and other related topics.
Design of Security Mechanism for Electronic Document Repository System
Authors: SangYeob Na, SeungDae Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The management and deposit of paper document costs are increased gradually. Specially, it is too expensive to safekeeping paper document in the warehouse. Also paper based document system is exposed in several security problems. Therefore, demands of transformation process from paper document into electronic ones are quietly needed. Electronic document repository system is one of the best solutions for solving paper based document system issues. Electronic document repository system can reduce overall costs and provides some advantages in comparison with paper based document system. But, electronic document repository system has no formal methodology for guarantee safeties. Therefore, we suggest a security mechanism for establish electronic document repository system. Suggested security methodology can help for design of more secure electronic document repository system.
Improving Localization in Geosensor Networks through Use of Sensor Measurement Data
Authors: Frank Reichenbach, Alexander Born, Edward Nash, Christoph Strehlow, Dirk Timmermann, Ralf Bill
Venue: Proceedings of the 5th international conference on Geographic Information Science (2008)

The determination of a precise position in geosensor networks requires the use of measurements which are inherently inaccurate while minimizing the required computations. The imprecise positions produced using these inaccurate measurements mean that available methods for measurement of distances or angles are unsuitable for use in most applications. In this paper we present a new approach, the Anomaly Correction in Localization (ACL) algorithm, whereby classical trilateration is combined with the measurements of physical parameters at the sensor nodes to improve the precision of the localization.Simulation results show that for localization using triangulation of distance measurements with a standard deviation of 10% then the improvement in precision of the estimated location when using ACL is up to 30%. For a standard deviation in the measurements of 5% then an improvement in positioning precision of ca. 12% was achieved.
American sign language vocabulary: computer aided instruction for non-signers
Authors: Valerie Henderson-Summet, Kimberly Weaver, Tracy L. Westeyn, Thad E. Starner
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

In this paper we present the results of a study designed to evaluate the computer-based methods of learning American Sign Language (ASL). We describe a method including an initial instruction session along with receptive and generative language tests which were administered after a week-long retention interval. We show a strong correlations (r=.62, r=.57) between the initial session's instruction and the receptive and generative levels of vocabulary signing. Based on the results of our experiment, we establish a baseline for further exploration of ASL vocabulary acquisition and identify further paths for language based instruction.
Based on Expand RBAC Grid Collaborative Design System Access Control Model
Authors: Xuebin Chen, Guolin Duan, Jin Cai
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The access control is the multitudinous computer security solution one kind, also is the most direct-viewing most natural one kind of plan, but based on role access control (RBAC) is the most influential high-level access control model, however, as a result of the grid cross organization, the tendency, isomerism characteristic, established the access control in the grid coordination design system also to need to carry on the expansion to RBAC, this article has made the simple introduction to RBAC, and has analyzed it under the grid environment insufficiency, gave one kind based on to expand RBAC the grid coordination design system access control model, in did not reduce the Autonomous Domain in the safety control efficiency situation, could realize the virtual organization. The fine grain is authorized and guarantees the Autonomous Domain the security policy not to destroy. And the confirmation has been carried on under the experimental grid environment.
MPI Must Evolve or Die
Authors: Al Geist
Venue: Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2008)

Multicore and hybrid architecture designs dominate the landscape for systems that are 1 to 20 petaflops peak performance. As such the MPI software must evolve to effectively use these types of architectures or it will die just like the vector programming models died. While applications may continue to use MPI, it is not business as usual in how communication libraries are being changed to effectively exploit the new petascale systems. This talk presents some key research in petascale communication libraries going on in the "Harness" project, which is the follow-on to the PVM research project.The talk will cover a number of areas being explored, including hierarchical algorithm designs, hybrid algorithm designs, dynamic algorithm selection, and fault tolerance inside next generation message passing libraries. Hierarchical algorithm designs seek to consolidate information at different levels of the architecture to reduce the number of messages and contention on the interconnect. Natural places for such consolidation include the socket level, the node level, the cabinet level, and multiple-cabinet level. Hybrid algorithm designs use different algorithms at different levels of the architecture, for example, an ALL_GATHER may use a shared memory algorithm across the node and a message passing algorithm between nodes, in order to better exploit the different data movement capabilities. An adaptive communication library may dynamically select from a set of collective communication algorithms based on the number of nodes being sent to, where they are located in the system, the size of the message being sent, and the physical topology of the computer.This talk will also describe how ORNL's Leadership computing facility (LCF) has been proactive in getting science teams to adopt the latest communication and IO techniques. This includes assigning computational science liaisons to each science team. The liaison has knowledge of both the systems and the science, providing a bridge to improved communication patterns. The LCF also has a Cray Center of Excellence and a SUN Lustre Center of Excellence on site. These centers provide Cray and SUN engineers who work directly with the science teams to improve the MPI and MPI-IO performance of their applications.Finally this talk will take a peek at exascale architectures and the need for new approaches to software development that integrates arcitecture design and algorithm development to facilitate the synergistic evolution of both.
A Novel Way of Incorporating Large-Scale Knowledge into MRF Prior Model
Authors: Yang Chen, Wufan Chen, Pengcheng Shi, Yanqiu Feng, Qianjin Feng, Qingqi Wang, Zhiyong Huang
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Based on Markov Random Fields (MRF) theory, Bayesian methods have been accepted as an effective solution to overcome the ill-posed problems of image restoration and reconstruction. Traditionally, the knowledge in most of prior models is from a simply weighted differences between the pixel intensities within a small local neighborhood, so it can only provide limited prior information for regularization. Exploring the ways of incorporating more large-scale knowledge into prior model, this paper proposes an effective approach to incorporate large-scale image knowledge into MRF prior model. And a novel nonlocal prior is put forward. Relevant experiments in emission tomography prove that the proposed MRF nonlocal prior is capable of imposing more effective regularization on original reconstructions.
Semantic Bookmarking and Search in the Earth Observation Domain
Authors: Francesca Fallucchi, Maria Teresa Pazienza, Noemi Scarpato, Armando Stellato, Luigi Fusco, Veronica Guidetti
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

This paper describes the experience of introducing a service for semantic bookmarking and search in the Earth Observation (EO) domain. To perform the work reported such a service has been integrated and customized in the framework of the DILIGENT project which concluded in 2007. The service proposed is a web browser ontology based extension: at the application layer the interaction between DILIGENT end-users and this service takes place from within the DILIGENT web portal. The service described allows end users to capture and annotate on-demand the information stored in the DILIGENT infrastructure and to organize it according to the user's representation of the specific ontological domain. The effort spent meets today end users' requirements in the EO application domain, applying an innovative solution to make specific actors keep track of the information of interest in a personalized and easy way. End users are able to store, access and play only with the information of interest and under their own (ontological) perspective.
A New Approach to Division of Attribute Space for SVR Based Classification Rule Extraction
Authors: Dexian Zhang, Ailing Duan, Yanfeng Fan, Ziqiang Wang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

SVM based rule extraction has become an important preprocessing technique for data mining, pattern classification, and so on. There are two key problems required to be solved in the classification rule extraction based on SVMs, i.e. the attribute importance ranking and the discretization to continuous attributes. In the paper, firstly, a new measure for determining the importance level of the attributes based on the trained SVR (Support vector re-gression) classifiers is proposed. Based on this new measure, a new approach for the division to continuous attribute space based on support vectors is pre-sented. A new approach for classification rule extraction from trained SVR classifiers is given. The performance of the new approach is demonstrated by several computing cases. The experimental results prove that the proposed ap-proach proposed can improve the validity of the extracted classification rules remarkably compared with other constructing rule approaches, especially for complicated classification problems.
The effectiveness of software metrics in identifying error-prone classes in post-release software evolution process
Authors: Raed Shatnawi, Wei Li
Venue: Journal of Systems and Software (2008)

Many empirical studies have found that software metrics can predict class error proneness and the prediction can be used to accurately group error-prone classes. Recent empirical studies have used open source systems. These studies, however, focused on the relationship between software metrics and class error proneness during the development phase of software projects. Whether software metrics can still predict class error proneness in a system's post-release evolution is still a question to be answered. This study examined three releases of the Eclipse project and found that although some metrics can still predict class error proneness in three error-severity categories, the accuracy of the prediction decreased from release to release. Furthermore, we found that the prediction cannot be used to build a metrics model to identify error-prone classes with acceptable accuracy. These findings suggest that as a system evolves, the use of some commonly used metrics to identify which classes are more prone to errors becomes increasingly difficult and we should seek alternative methods (to the metric-prediction models) to locate error-prone classes if we want high accuracy.
Ontologies for competence description in multi-agent systems
Authors: Alexandru Cicortas, Victoria Iordan, Antoanela Naaji
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

The paper reviews the ontology and competence concepts. The relations between the ontologies and the competence components are shortly analyzed. A sample of similar work TenCompetence is also presented. The proposed model has not a strong connection with the e-Learning but intend to give a multi-agent system that allows describing, representing find and compare the competences. This paper is partially supported by the project PN II 91-047/2007.
Integrated security architecture for wireless mesh networks
Authors: Dharma P. Agrawal
Venue:  (2008)

Wireless Mesh Networks (WMNs) have revolutionized provisioning of economical and broadband wireless internet service to the whole community of users. The self-configurable and self-healing ability of WMNs has encouraged their rapid proliferation, as adding a mesh router (MR) is as simple as plugging and turning on. The plug-and-play architecture of WMN, however paves way to malicious intruders. An attacker can raise several security concerns, like rogue routers, selfishness, and denial-of-service attacks. Unfortunately, current thrust of research in WMNs, is primarily focused on developing multi-path routing protocols; and security is very much in its infancy.Owing to the hierarchical architecture of WMNs, security issues are multi-dimensional. As mesh routers form the backbone of the network, it is critical to secure them from various attacks. In this dissertation we develop integrated security architecture to protect the mesh backbone. It is important to provide an end-to-end security for mesh clients and hence we design a novel authentication protocol for mutually authenticating mesh clients and mesh routers.The aim of this dissertation is to explore various issues that affect the performance and security of WMNs. We first examine the threat of an active attack like Denial of service attack on MRs and design a cache based throttle mechanism to control it. Next, we develop a MAC identifier based trace table to determine the precise source of a DoS attacker. We then evaluate the vulnerability of WMNs to passive attacks, like selfishness and propose an adaptive mechanism to penalize selfish MRs that discretely drop other&rsquo;s packets. In order to handle route disruption attacks like malicious route discovery, we design an intelligent Intrusion Detection System. Through extensive simulations, we evaluate effectiveness of our proposed solutions in mitigating these attacks. Finally, we design a light weight authentication protocol for mesh clients using inexpensive hash operations that enables authentication of important control messages and also performs auto-refresh of authentication tokens.
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
Authors: Moti Yung, Yunlei Zhao
Venue: Proceedings of the 26th annual international conference on Advances in Cryptology (2007)

We present a generic construction for constant-round concurrsound resettable zero-knowledge (rZK-CS) arguments for $\mathcal{NP}$ in the bare public-key (BPK) model under any (sub-exponentially strong) one-way function (OWF), which is a traditional assumption in this area. The generic construction in turn allows round-optimal implementation for $\mathcal{NP}$ still under general assumptions, and can be converted into a highly practical instantiation (under specific number-theoretic assumptions) for any language admitting Σ-protocols. Further, the rZK-CS arguments developed in this work also satisfy a weak (black-box) concurrent knowledge-extractability property as proofs of knowledge, in which case some super-polynomial-time assumption is intrinsic.