ppxscal/embedding_network huggingface dataset:
Lazy argument passing in Java RMI
Authors: Christopher Line, K. R. Jayaram, Patrick Eugster
Venue: Proceedings of the 6th international symposium on Principles and practice of programming in Java (2008)

Though often criticized for its inherent synchronization overhead and coupling, the remote method invocation (RMI) paradigm remains one of the most popular abstractions for building distributed applications. Many authors have suggested ways to overcome its drawbacks focusing mostly on the invoker's perspective, for example by multiplexing invocations to replicated server objects, through "future" return values, or even by prohibiting return values altogether. The more global perspective, and in particular the invokee side, has conversely only received little attention. In this paper we take a fresh look at the RMI paradigm, elaborating on argument passing semantics. We identify three lazy ways of passing arguments by value, differing by the moment at which the transfer of the arguments synchronizes with the execution of the method body. We present a preliminary library implementation of our argument passing semantics in Java RMI, and illustrate their individual benefits through examples. We characterize analytically and empirically application scenarios which benefit from lazy argument passing.
Towards Trust Services for Language-Based Virtual Machines for Grid Computing
Authors: Tobias Vejda, Ronald Toegl, Martin Pirker, Thomas Winkler
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

The concept of Trusted Computing (TC) promises a new approach to improve the security of computer systems. The core functionality, based on a hardware component known as Trusted Platform Module (TPM), is integrated into commonly available hardware. Still, only limited software support exists, especially in the context of grid computing. This paper discusses why platform independent virtual machines (VM) with their inherent security features are an ideal environment for trusted applications and services. Based on different TC architectures building a chain-of-trust, a VM can be executed in a secure way. This chain-of-trust can be extended at run-time by considering the identity of the application code and by deriving attestable properties from the VMs configuration. An interface to provide applications with TC services like sealing or remote attestation regardless of the underlying host architecture is discussed.
Incremental Mining with Prelarge Trees
Authors: Chun-Wei Lin, Tzung-Pei Hong, Wen-Hsiang Lu, Been-Chian Chien
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In the past, we proposed a Fast Updated FP-tree (FUFP-tree) structure to efficiently handle new transactions and to make the tree-update process become easy. In this paper, we propose the structure of prelarge trees to incrementally mine association rules based on the concept of pre-large itemsets. Due to the properties of pre-large concepts, the proposed approach does not need to rescan the original database until a number of new transactions have been inserted. Experimental results also show that the proposed approach has a good performance for incrementally handling new transactions.
Programming Languages: An Active Learning Approach
Authors: Kent Lee
Venue:  (2008)

Programming Languages: An Active Learning Approach introduces students to three programming paradigms: object-oriented/imperative languages using C++ and Ruby, functional languages using Standard ML, and logic programming using Prolog. This interactive textbook is intended to be used in and outside of class. Each chapter follows a pattern of presenting a topic followed by a practice exercise or exercises that encourage students to try what they have just read. This textbook is best-suited for students with a 2-3 course introduction to imperative programming. Key Features: Accessible structure guides the student through various programming languages Seamlessly integrated practice exercises Classroom-tested Online support materials Advance Praise for Lees Programming Languages: An Active Learning Approach "The Programming Languages book market is overflowing with books, but none like this. In many ways, it is precisely the book I have been searching for to use in my own programming languages course. One of the main challenges I perpetually face is how to teach students to program in functional and logical languages, but also how to teach them about compilers. This book melds the two approaches very well." -- David Musicant, Carleton College
SmartResource Platform and Semantic Agent Programming Language (S-APL)
Authors: Artem Katasonov, Vagan Terziyan
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

Although the flexibility of agent interactions has many advantages when it comes to engineering a complex system, the downside is that it leads to certain unpredictability of the run-time system. Literature sketches two major directions for search for a solution: social-level characterization of agent systems and ontological approaches to inter-agent coordination. Especially the latter direction is not yet studied much by the scientific community. This paper describes our vision and the present state of the SmartResource Platform. The main distinctive features of the platform are externalization of behavior prescriptions, i.e. agents access them from organizational repositories, and utilization of the RDF-based Semantic Agent Programming Language (S-APL), instead of common Prolog-like languages.
Experiences in Hybrid Learning with eduComponents
Authors: Mario Amelung, Dietmar Rösner
Venue: Proceedings of the 1st international conference on Hybrid Learning and Education (2008)

Since five years we practice hybrid learning in all our courses by combining classroom lectures and group exercises with Web-based e-learning. In this paper we reflect the experiences with our learning environment and discuss the changes in teaching and learning that resulted from the new approach as well as pedagogical concerns and policy issues.
Thread---Based Analysis of Sequence Diagrams
Authors: Haitao Dan, Robert M. Hierons, Steve Counsell
Venue: Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2007)

Sequence Diagrams (SDs) offer an intuitive and visual way of describing expected behaviour of Object Oriented (OO) software. They focus on modelling the method calls among participants of a software system at runtime. This is an essential difference from its ancestor, basic Message Sequence Charts (bMSCs), which are mainly used to model the exchange of asynchronous messages. Since method calls are regarded as synchronous messages in the Unified Modelling Language (UML) Version 2.0, synchronous messages play a significantly more important role in SDs than in bMSCs. However, the effect of this difference has not been fully explored in previous work on the semantics of SDs. One important aim of this paper is to identify the differences between SDs and bMSCs. We observe that using traditional semantics to interpret SDs may not interpret SDs correct under certain circumstances. Consequently, we propose a new method to interpret SDs which uses thread tags to deal with identified problems.
VOIP on wireless LAN: a comprehensive review
Authors: Sana Munir, Imran Ahmad
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

VoIP requires timely servicing of the voice traffic, which is a challenging task in WLANs, even when using QoS enforcement. The use of Wireless LANs (WLANs) is more and more at present. Voice over IP (VoIP) uses data networks to transmit voice signals. Since both technologies are sufficiently established at the moment, VoIP over WLAN communication is being developed. However the inherent characteristics of each of these two technologies cause specific issues to appear. These issues must be addressed in order to ensure a successful deployment of VoIP over WLANs. This is particularly important when using WLAN technology in the context of emergency situations. A review of the current state of the art in voice communication over wireless networks is done in this paper. The properties of WLANs and VoIP are presented, and then the issues related to the deployment of VoIP over WLAN are analyzed.
Mapping User Accessibility Needs Systematically to Universal Design Principles
Authors: Kyohyun Song, Seongil Lee
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

In a rapidly growing information-oriented society, people with disabilities and older people are faced with serious inconveniences in accessing IT products due to complicated use of technologies and poorly designed interfaces. To solve the problems, it is required for designers and engineers to find out and understand user needs, and then to figure out the functionalities and design characteristics to meet the needs. Figuring out the Engineering Characteristics (EC) of products from user needs for people with disabilities and older people who have problems using main stream products due to limited accessibility would take great efforts and time. We merged two important concepts of product design for people with disabilities and older people, accessibility and universal design, using an engineering design framework of QFD (Quality Function Deployment) to provide engineers and designers with a systematic methodology for universal product design. We adapted a technical report from the ISO/IEC JTC1 Special Working Group on Accessibility (SWG-A), the Information Technology --- Accessibility Considerations for People with Disabilities --- Part 1: User Needs Summary (ISO/IEC PDTR 99999-1), and mapped the detailed user accessibility needs to the guidelines of 7 universal design principles which are widely accepted. We explained how a process model was built for mapping relationship between the guidelines and user accessibility needs, and extracting the critical engineering characteristics for IT product design based on these two models. A model House of Quality(HOQ) was built for such procedures.
Environment Assumptions for Synthesis
Authors: Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

The synthesis problem asks to construct a reactive finite-state system from an ¿-regular specification. Initial specifications are often unrealizable, which means that there is no system that implements the specification. A common reason for unrealizability is that assumptions on the environment of the system are incomplete. We study the problem of correcting an unrealizable specification φ by computing an environment assumption ¿ such that the new specification ¿¿φ is realizable. Our aim is to construct an assumption ¿ that constrains only the environment and is as weak as possible. We present a two-step algorithm for computing assumptions. The algorithm operates on the game graph that is used to answer the realizability question. First, we compute a safety assumption that removes a minimal set of environment edges from the graph. Second, we compute a liveness assumption that puts fairness conditions on some of the remaining environment edges. We show that the problem of finding a minimal set of fair edges is computationally hard, and we use probabilistic games to compute a locally minimal fairness assumption.
Guest-Aware Priority-Based Virtual Machine Scheduling for Highly Consolidated Server
Authors: Dongsung Kim, Hwanju Kim, Myeongjae Jeon, Euiseong Seo, Joonwon Lee
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

The use of virtualization is rapidly expanding from server consolidation to various computing systems including PC, multimedia set-top box and gaming console. However, different from the server environment, timeliness response for the external input is an essential property for the user-interactive applications. To provide timeliness scheduling of virtual machine this paper presents a priority-based scheduling scheme for virtual machine monitors. The suggested scheduling scheme selects the next task to be scheduled based on the task priorities and the I/O usage stats of the virtual machines. The suggested algorithm was implemented and evaluated on Xen virtual machine monitor. The results showed that the average response time to I/O events is improved by 5~22% for highly consolidated environment.
Automatic Translation in Two Phases: Recognition and Interpretation
Authors: Osvaldo Cairó, Silvia Guardati
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper presents an approach to automatic translation in two steps. The first one is recognition (syntactic) and the last one is interpretation (semantic). In the recognition phase, we use volatile grammars. They represent an innovation to logic-based grammars. For the interpretation phase, we use componential analysis and the laws of integrity. Componential analysis defines the sense of the lexical parts. The rules of integrity, on the other hand, are in charge of refining, improving and optimizing translation. We applied this framework for general analysis of romance languages and for the automatic translation of texts from Spanish into other neo-Latin languages and vice versa.
Indonesian-English Transitive Translation for Cross-Language Information Retrieval
Authors: Mirna Adriani, Herika Hayurani, Syandra Sari
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This is a report on our evaluation of using some language resources for the Indonesian-English bilingual task of the 2007 Cross-Language Evaluation Forum (CLEF). We chose to translate an Indonesian query set into English using machine translation, transitive translation, and parallel corpus-based techniques. We also made an attempt to improve the retrieval effectiveness using a query expansion technique. The result shows that the best retrieval performance was achieved by combining the machine translation technique and the query expansion technique.
Power and Fault Analysis Resistance in Hardware through Dynamic Reconfiguration
Authors: Nele Mentens, Benedikt Gierlichs, Ingrid Verbauwhede
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

Dynamically reconfigurable systems are known to have many advantages such as area and power reduction. The drawbacks of these systems are the reconfiguration delay and the overhead needed to provide reconfigurability. We show that dynamic reconfiguration can also improve the resistance of cryptographic systems against physical attacks. First, we demonstrate how dynamic reconfiguration can realize a range of countermeasures which are standard for software implementations and that were practically not portable to hardware so far. Second, we introduce a new class of countermeasure that, to the best of our knowledge, has not been considered so far. This type of countermeasure provides increased resistance, in particular against fault attacks, by randomly changing the physical location of functional blocks on the chip area at run-time. Third, we show how fault detection can be provided on certain devices with negligible area-overhead. The partial bitstreams can be read back from the reconfigurable areas and compared to a reference version at run-time and inside the device. For each countermeasure, we propose a prototype architecture and evaluate the cost and security level it provides. All proposed countermeasures do not change the device's input-output behavior, thus they are transparent to upper-level protocols. Moreover, they can be implemented jointly and complemented by other countermeasures on algorithm-, circuit-, and gate-level.
Simulation for bulk synchronous parallel superstep task assignment in desktop grids characterised by gaussian parameter distributions
Authors: Edscott Wilson García, Guillermo Morales-Luna
Venue: Multiagent and Grid Systems (2008)

Modern load distribution schemes for parallel task assignment often refer to parallel computers with shared memory or dedicated clusters with local address spaces. For parallel computing performed on dedicated clusters, the communication topology between processors can be considered static. On dealing with the execution of parallel programs on desktop grids, the previous assumption will lead to inexact parameter determination for network cost due to the actual network topology being determined not only by the hardware characteristics but also by the instantaneous bandwidth availability for the processes to communicate. The dynamic bandwidth depends not only on location, time and date, but also on the habits and behaviour of the individual users of the computers that conform the grid environment and will lead to an inconstant network topology. This paper presents a novel simulator design which takes these factors into consideration for the BSP parallel computer model. The simulator is used as a performance evaluation tool for several case studies to point out variations in performance obtained from different task assignment strategies as the size of the desktop grid increases and the number of parallel threads changes.
Pro Drupal Development, Second Edition, 2 edition
Authors: John K. VanDyk, Dries Buytaert
Venue:  (2008)

Widely praised for its indepth coverage of Drupal internals, bestselling Pro Drupal Development has been completely updated for Drupal 6 in this latest edition, and there are even more tricks of the trade to help you further yourself as a professional Drupal developer. Assuming you already know how to install and bring a standard installation online, John K. VanDyk gives you everything else you need to customize your Drupal installation however you see fit. Pro Drupal Development, Second Edition delves deep into Drupal internals, showing you how to take full advantage of its powerful architecture. What youll learn Find out how to create your own modules, develop your own themes, and produce your own filters. Learn the inner workings of each key part of Drupal, including user management, sessions, the node system, caching, and the various APIs available to you. Discover how to optimize your Drupal installation to perform well under highload situations. Gain the knowledge needed to secure your Drupal installation and other best practice techniques. Learn to integrate Ajax into and internationalize your Drupal web site. Who is this book for? Web developers maintaining and creating sites with Drupal. It is assumed that you already know the basics of Drupal and are able to install and bring up a basic installation. This book takes you deeper into the internals of Drupal and teaches how to tweak and modify it in order to create that perfect web site. Simply put, if you are working with Drupal, you need Pro Drupal Development, Second Edition. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
A Debugger for Parallel Haskell Dialects
Authors: Alberto Encina, Ismael Rodríguez, Fernando Rubio
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

Due to its high-level nature, parallel functional languages provide some advantages for the programmer. Unfortunately, the functional programming community has not paid much attention to some important practical problems, like debugging parallel programs. In this paper we introduce the first debugger that works with any parallel extension of the functional language Haskell, the de facto standard in the (lazy evaluation) functional programming community. The debugger is implemented as an independent library. Thus, it can be used with any Haskell compiler. Moreover, the debugger can be used to analyze how much speculative work has been done in any program.
Extending the Z-Width of a Haptic Device Using Acceleration Feedback
Authors: Naser Yasrebi, Daniela Constantinescu
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper proposes a nonlinear controller to extend the Z-width of a haptic device. A time-domain passivity analysis of the Z-width diagram leads to the new haptic controller, which employs acceleration feedback. The passivity condition for one degree of freedom (1DOF) haptic interaction with a virtual wall via the proposed controller is derived using passivity theory in the frequency domain. The perfomance of the proposed controller is validated experimentally on a PHANTOM Omni haptic device. The experiments illustrate that the new controller considerably extends the Z-witdh of the haptic interface.
Fast electrostatic force calculation on parallel computer clusters
Authors: Amirali Kia, Daejoong Kim, Eric Darve
Venue: Journal of Computational Physics (2008)

The fast multipole method (FMM) and smooth particle mesh Ewald (SPME) are well known fast algorithms to evaluate long range electrostatic interactions in molecular dynamics and other fields. FMM is a multi-scale method which reduces the computation cost by approximating the potential due to a group of particles at a large distance using few multipole functions. This algorithm scales like O(N) for N particles. SPME algorithm is an O(NlnN) method which is based on an interpolation of the Fourier space part of the Ewald sum and evaluating the resulting convolutions using fast Fourier transform (FFT). Those algorithms suffer from relatively poor efficiency on large parallel machines especially for mid-size problems around hundreds of thousands of atoms. A variation of the FMM, called PWA, based on plane wave expansions is presented in this paper. A new parallelization strategy for PWA, which takes advantage of the specific form of this expansion, is described. Its parallel efficiency is compared with SPME through detail time measurements on two different computer clusters.
Identification of Interface Residues Involved in Protein-Protein Interactions Using Naïve Bayes Classifier
Authors: Chishe Wang, Jiaxing Cheng, Shoubao Su, Dongzhe Xu
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

The identification of interface residues involved in protein-protein interactions(PPIs) has broad application in rational drug design and metabolic etc. Here a Naïve Bayes classifier for PPIs prediction with features including protein sequence profile and residue accessible surface area was proposed. This method adequately used the character of Naïve Bayes classifier which assumed independence of the attributes given the class. Our test results on a diversity dataset made up of only hetero-complex proteins achieved 68.1% overall accuracy with a correlation coefficient of 0.201, 40.2% specificity and 49.9% sensitivity in identify interface residues as estimated by leave-one-out cross-validation. This result indicated that the method performed substantially better than chance (zero correlation). Examination of the predictions in the context of 3-dimensional structures of proteins demonstrated the effectiveness of this method in identifying protein-protein sites.