ppxscal/embedding_network huggingface dataset:
Agent-based unit testing environment for extreme programming
Authors: Yong-Feng Lin, Ming-Wei Huang, Jason Jen-Yen Chen
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

This paper presents a new approach of using multi-agent system (MAS) to build a software engineering environment to support unit testing process for extreme programming (XP). The MAS reference model by Foundation for Intelligent Physical Agents (FIPA) is extended in this paper. The extended components are: 1) agent roles, 2) storage components, and 3) ontology. The FIPA-complied Java Agent Development framework (JADE) agent platform is used in implementation. The Darpa agent mark-up language (DAML) is used as process data format, including ontology. And, JENA API by Hewlett-Packard (HP) is used to store DAML ontology. Further, examples are given to show feasibility of this approach. The expected benefits of this agent-based approach are to: 1) Improve environment flexibility and reliability, 2) Facilitate XP practices, and 3) Use DAML format that is suitable for agents.
Credit Card Fraud Detection with Artificial Immune System
Authors: Manoel Fernando Gadi, Xidi Wang, Alair Pereira Lago
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

We apply Artificial Immune Systems(AIS) [4] for credit card fraud detection and we compare it to other methods such as Neural Nets(NN) [8] and Bayesian Nets(BN) [2], Naive Bayes(NB) and Decision Trees(DT) [13]. Exhaustive search and Genetic Algorithm(GA) [7] are used to select optimized parameters sets, which minimizes the fraud cost for a credit card database provided by a Brazilian card issuer. The specifics of the fraud database are taken into account, such as skewness of data and different costs associated with false positives and negatives. Tests are done with holdout sample sets, and all executions are run using Weka [18], a publicly available software. Our results are consistent with the early result of Maes in [12] which concludes that BN is better than NN, and this occurred in all our evaluated tests. Although NN is widely used in the market today, the evaluated implementation of NN is among the worse methods for our database. In spite of a poor behavior if used with the default parameters set, AIS has the best performance when parameters optimized by GA are used.
Comparing and Contrasting Micro-payment Models for Content Sharing in P2P Networks
Authors: Xiaoling Dai, Kaylash Chaudhary, John Grundy
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Micro-payment systems have the potential to provide non-intrusive, high-volume and low-cost pay-as-you-use services for a wide variety of web-based applications. We proposed a new model, P2P-NetPay, a micro-payment protocol characterized by off-line processing, suitable for peer-to-peer network service charging. P2P micro-payment systems must provide a secure, highly efficient, flexible, usable and reliable environment, the key issues in P2P micro-payment systems development. Therefore, in order to assist in the design of an efficient micro-payment model suitable for P2P networks, we compare and contrast several existing P2P micro-payment models in this paper and outline a new P2P micro-payment scheme we have been developing that addresses the disadvantages in current schemes.
StateML +: From Graphical State Machine Models to Thread-Safe Ada Code
Authors: Diego Alonso, Cristina Vicente-Chicote, Juan A. Pastor, Bárbara Álvarez
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

This paper presents the StateML + tool aimed at designing state-machines and automatically generating thread-safe and multi-tasking modular Ada code from them, following a Model-Driven Engineering approach. The StateML + meta-model is an extension of a previous version, and now it offers improved modeling capabilities, which include regions and macro-state definition. In this paper, a case study regarding the design of a robotic system will be used to demonstrate the benefits of the proposed approach.
ModHel'X: A Component-Oriented Approach to Multi-Formalism Modeling
Authors: Cécile Hardebolle, Frédéric Boulanger
Venue: Models in Software Engineering: Workshops and Symposia at MoDELS 2007, Nashville, TN, USA, September 30 - October 5, 2007, Reports and Revised Selected Papers (2008)

We present ModHel'X, an approach to multi-formalism modeling which addresses two important issues in this field: (a) providing support for the specification of the semantics of a modeling formalism, and (b) allowing the specification of the interactions between parts of a model described using different modeling formalisms. ModHel'X is based on the concept of Model of Computation and focuses on the execution of models, considered as the computation of one possible behavior of the model. The structural elements of a modeling language are described by specializing the meta-model of ModHel'X whereas its semantics, i.e. the corresponding model of computation, is described by specializing the predefined stages of a generic execution model. Using the same mechanisms, designers can specify the semantic adaptation that is suitable at each interface between heterogeneous parts of their model. Finally, ModHel'X comes with an execution engine which is able to interpret heterogeneous models for simulation.
An RSA-Based (t,n) Threshold Proxy Signature Scheme without Any Trusted Combiner
Authors: Pei-Yih Ting, Xiao-Wei Huang
Venue: Proceedings of the 11th international conference on Information Security (2008)

In this paper we propose and analyze a new RSA-based proxy signature scheme and its corresponding (t,n) threshold scheme. Unlike numerous previous research works, the threshold proxy scheme does not require any trusted combiner and is thus a truly practical approach. The security of both schemes is based on a weaker version of the RSA assumption. Both schemes are unforgeable and especially the threshold proxy scheme inherits the merit of its predecessor - Shoup's RSA threshold scheme - and thus is secure under a multi-party computation setup with active adversaries.
A Power Supply Selector for Energy- and Area-Efficient Local Dynamic Voltage Scaling
Authors: Sylvain Miermont, Pascal Vivet, Marc Renaudin
Venue: Proceedings of the 17th international workshop on Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation (2007)

In systems-on-chip, dynamic voltage scaling allows energy savings. If only one global voltage is scaled down, the voltage cannot be lower than the voltage required by the most constrained functional unit to meet its timing constraints. Fine-grained dynamic voltage scaling allows better energy savings since each functional unit has its own independent clock and voltage, making the chip globally asynchronous and locally synchronous.In this paper we propose a local dynamic voltage scaling architecture, adapted to globally asynchronous and locally synchronous systems, based on a technique called Vdd-hopping. Compared to traditional power converters, the proposed power supply selector is small and power-efficient, with no needs for large passives or costly technological options. This design has been validated in a STMicroelectronics CMOS 65nm low-power technology.
Using brain imaging to extract the structure of complex events at the rational time band
Authors: John R. Anderson, Yulin Qin
Venue: Journal of Cognitive Neuroscience (2008)

A functional magnetic resonance imaging (fMRI) study was performed in which participants performed a complex series of mental calculations that spanned about 2 min. An Adaptive Control of Thought---Rational (ACT-R) model [Anderson, J. R. How can the human mind occur in the physical universe? New York: Oxford University Press, 2007] was developed that successfully fit the distribution of latencies. This model generated predictions for the fMRI signal in six brain regions that have been associated with modules in the ACT-R theory. The model's predictions were confirmed for a fusiform region that reflects the visual module, for a prefrontal region that reflects the retrieval module, and for an anterior cingulate region that reflects the goal module. In addition, the only significant deviations to the motor region that reflects the manual module were anticipatory hand movements. In contrast, the predictions were relatively poor for a parietal region that reflects an imaginal module and for a caudate region that reflects the procedural module. Possible explanations of these poor fits are discussed. In addition, exploratory analyses were performed to find regions that might correspond to the predictions of the modules.
Augmenting Internet-Based Card Not Present Transactions with Trusted Computing (Extended Abstract)
Authors: Shane Balfe, Kenneth G. Paterson
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

We demonstrate how Trusted Computing technology can be used to enhance the security of Internet-based Card Not Present (CNP) transactions. We focus on exploiting features of Trusted Computing as it is being deployed today, relying only on the presence of client-side Trusted Platform Modules. We discuss the threats to CNP transactions that remain even with our enhancements in place, focussing in particular on the threat of malware, and how it can be ameliorated.
Proceedings of the 2nd workshop on System-level virtualization for high performance computing
Venue: European Conference on Computer Systems (2008)

System-level virtualization has been a research topic in operating systems since the 70's but regained popularity during the past few years because of the availability of efficient solution such as Xen and the implementation of hardware support in commodity processors (e.g., Intel-VT, AMD-V). Currently, the majority of system-level virtualization projects is guided by the server consolidation market. As a result, these virtualization solutions may not be suitable for high performance computing (HPC) which is typically based on large-scale systems. However, there is significant interest in exploiting virtual machines (VMs) within HPC for a number of other reasons. By virtualizing the machine, one is able to run a variety of operating systems and environments as needed by the applications. Virtualization allows users to isolate workloads, improving security and reliability. It is also possible to support non-native environments and/or legacy operating environments through virtualization. In addition, it is possible to balance work loads, use migration techniques to relocate applications from failing machines, and isolate faulty systems for repair. This workshop aims to foster discussion on challenges for the implementation of a system-level virtualization solution for HPC, but also to present latest trends on the subject. We also think that system-level virtualization has become an important research topic in operating systems.
Interactivity dimension: media, contents, and user perception
Authors: Sang Hee Kweon, Eun Joung Cho, Eun Mee Kim
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

This research explores interactivity dimension in the portal media (such as Yahoo, Naver, Daum, Paran, and Nate). The research is designed to measure user's perception of interactivity in the portal site at the three levels including 1) media 2) contents, 3) perception of HCI and CMC. This research also seeks the associated variables relationship among those variables through SEM (structural equation model). The 587 data was collected and was analyzed to test the hypotheses. The results shows that the dimension of the media side's interactivity affected to the content's side's interactivity. The content side's interactivity affected the user's perception of portal media level either HCI and CMC media.
Skeleton Based 3D Model Morphing Using Barycentric Map
Authors: Kosuke Kaneko, Yoshihiro Okada
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

This paper proposes a skeleton based 3D model morphing system using Barycentric map. Although there have been many 3D model morphing systems, even it is still laborious to perform the 3D model morphing because it needs many manual operations. The most important task for the morphing is the vertex correspondence between two base models. When the vertex numbers and geometric topologies of two models are different, its 3D model morphing is difficult. For overcoming this problem, the proposed system automatically determines the vertex correspondence based on skeletons of two models. The overview of proposed processes is as follows: first of all, the user segments each of two models manually. Then the system generates bones of the each model based on the above segmentation. Next, the system defines the hierarchy of generated bones to generate the skeleton of the each model and then determines the correspondence between two bones of the two models based on the hierarchical structures of their skeletons. Finally, the system defines vertex correspondences between the two models using Barycentric mapping. Then the 3D model morphing between the two models will become possible. These processes except the first segmentation step are automatic.
Open Knowledge
Authors: Dave Robertson, Fausto Giunchiglia, Frank Harmelen, Maurizio Marchese, Marta Sabou, Marco Schorlemmer, Nigel Shadbolt, Ronnie Siebes, Carles Sierra, Chris Walton, Srinandan Dasmahapatra, Dave Dupplaw, Paul Lewis, Mikalai Yatskevich, Spyros Kotoulas, Adrian Perreau De Pinninck, Antonis Loizou
Venue: Languages, Methodologies and Development Tools for Multi-Agent Systems: First International Workshop, LADS 2007, Durham, UK, September 4-6, 2007. Revised Selected Papers (2008)

The drive to extend the Web by taking advantage of automated symbolic reasoning (the so-called Semantic Web) has been dominated by a traditional model of knowledge sharing, in which the focus is on task-independent standardisation of knowledge. It appears to be difficult, in practice, to standardise in this way because the way in which we represent knowledge is strongly influenced by the ways in which we expect to use it. We present a form of knowledge sharing that is based not on direct sharing of "true" statements about the world but, instead, is based on sharing descriptions of interactions. By making interaction specifications the currency of knowledge sharing we gain a context to interpreting knowledge that can be transmitted between peers, in a manner analogous to the use of electronic institutions in multi-agent systems. The narrower notion of semantic commitment we thus obtain requires peers only to commit to meanings of terms for the purposes and duration of the interactions in which they appear. This lightweight semantics allows networks of interaction to be formed between peers using comparatively simple means of tackling the perennial issues of query routing, service composition and ontology matching. A basic version of the system described in this paper has been built (via the OpenKnowledge project); all its components use established methods; many of these have been deployed in substantial applications; and we summarise a simple means of integration using the interaction specification language itself.
Cross-layer multiuser resource allocation for video communication over OFDM networks
Authors: Hojin Ha, Changhoon Yim, Young Yong Kim
Venue: Computer Communications (2008)

In this paper, we propose a resource allocation algorithm to transmit multiple video bitstreams over multiuser orthogonal frequency division multiplex (OFDM) networks. The proposed algorithm explores a low-complexity rate-distortion function and diversity of multiuser OFDM systems subject to constraints on delay and limited system resources. A set of relative importance is imposed in resource allocation to assure that each user can achieve the required data rate and the quality of service. We first present a simple and effective rate-distortion function including a temporal error propagation effect and relative importance. Then we propose the cross-layer multiuser resource allocation algorithm that consists of subcarrier assignment and power allocation for minimizing the overall video distortion. The proposed subcarrier assignment algorithm utilizes the subgradient method adopting a shadow price mechanism by assuming equal power distribution for each user. Based on the result of subcarrier assignment, the power allocation algorithm maximizes the sum of distortion reduction while the relative importance for each user is maintained. In simulation results, the proposed resource allocation algorithm outperforms the time division multiple access (TDMA) and the previous resource allocation algorithm maximizing the sum capacity in terms of the worst received video quality among users. The proposed algorithm achieves PSNR gain by 1.0-3.0dB, compared to the previous resource allocation algorithm considering rate-distortion function. It is shown that the proposed resource allocation algorithm distributes the video distortion among users more fairly with relative importance compared to the previous algorithms.
Fountain codes and their application to broadcasting in underwater networks: performance modeling and relevant tradeoffs
Authors: Paolo Casari, Michele Rossi, Michele Zorzi
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

Our aim in this paper is to study the performance of broadcasting algorithms for underwater acoustic sensor networks (UWASNs). The targeted scenario is very simple; we consider a source (the initiator of the broadcast transmission) and a number of nodes randomly placed within a given geographical area. For an efficient broadcast transmission we advocate the use of a hybrid ARQ scheme, where Fountain Codes (FC) are exploited to enhance the efficiency of the data dissemination process in the face of poor and possibly unknown channel conditions. FC codes, being rateless, are in fact able to adapt to diverse error rates and correct packet losses on the fly through the transmission of additional redundancy packets. The main contribution of this paper is a mathematical model to characterize the performance of fountain codes as applied to broadcasting in underwater networks. Our analysis allows us to find performance metrics such as transmission delay, reliability (e.g., percentage of covered users) and power consumption. Relevant tradeoffs are highlighted and quantified; in particular the implications of transmission power on covered distance, rate and delay are discussed. Even though we do not propose a practical broadcasting protocol here, the results and tradeoffs we obtain are essential to a proper design of practical schemes.
From Frame to Framless Stereotactic Operation--Clinical Application of 2011 Cases
Authors: Zeng-Min Tian, Wang-Sheng Lu, Quan-Jun Zhao, Xin Yu, Shu-Bin Qi, Rui Wang
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

Stereotactic operations were performed with the frameless stereotactic instrument (named as CAS-R-2) manufactured by ourselves rather than traditional stereotactic frame. The aim of this study was to assess the clinical usefulness, accuracy and safety of the frameless stereotactic instrument. We retrospectively reviewed 2011 patients aged between 0.2 to 89 years (with mean of 30.7 years) with CT/MRI image-guided frameless stereotactic surgery between January 1997 to April 2007. The accuracy of position and improvement of symptom was observed. The surgical procedures were successful. All targets were pointed accurately in just one go during the operation. Follow-up being performed 3 to 48 months (averaged 24 months) after the operation, the total effective rate was 93.3% without serious surgery-related complications. Compared with the traditional frame stereotactic operations, this method has some advantages, such as releasing the patient's pain, convenient to the doctors, extending the range of indications and increasing the safety and effectiveness of the operations.
Operating experience with the Los Alamos 701
Authors: Willard G. Bouricius
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

The need for large scale calculations has grown exponentially with time at Los Alamos. In the fall of 1950 we had one Card Programmed Calculator, we now have six. About a year and a half ago, the Los Alamos Maniac was put into operation. And still we needed more calculations, so a 701 calculator was ordered to help fill that need. Our 701 was delivered last April and placed under the administrative control of a group called T-1, within the Theoretical Division.
Top-Down Hierarchical Ensembles of Classifiers for Predicting G-Protein-Coupled-Receptor Functions
Authors: Eduardo P. Costa, Ana C. Lorena, André C. Carvalho, Alex A. Freitas
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

Despite the recent advances in Molecular Biology, the function of a large amount of proteins is still unknown. An approach that can be used in the prediction of a protein function consists of searching against secondary databases, also known as signature databases. Different strategies can be applied to use protein signatures in the prediction of function of proteins. A sophisticated approach consists of inducing a classification model for this prediction. This paper applies five hierarchical classification methods based on the standard Top-Down approach and one hierarchical classification method based on a new approach named Top-Down Ensembles - based on the hierarchical combination of classifiers - to three different protein functional classification datasets that employ protein signatures. The algorithm based on the Top-Down Ensembles approach presented slightly better results than the other algorithms, indicating that combinations of classifiers can improve the performance of hierarchical classification models.
Towards a Method for the Evaluation of Reference Architectures: Experiences from a Case
Authors: Samuil Angelov, Jos J. Trienekens, Paul Grefen
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

Reference architectures provide major guidelines for the structure of a class of information systems. Because of their fundamental role, reference architectures have to be of high quality. Before accepting a reference architecture, it has to go through a rigorous evaluation process. A number of methods exist for the evaluation of software architectures. In this paper, we analyze the main differences between concrete software architectures and reference architectures. We discuss the effects of these differences on the evaluation of reference architectures and show that existing methods cannot be directly applied for the evaluation of reference architectures. For the evaluation of a reference architecture for e-contracting systems, we used the Architecture Tradeoff Analysis Method with a number of adaptations and extensions. We present our approach and share our experiences from this evaluation process. Based on the analysis and our experiences gained, we present our vision for a method for the evaluation of reference architectures.