ppxscal/embedding_network huggingface dataset:
Research on Agile Project Management with Scrum Method
Authors: Zhi-gen Hu, Quan Yuan, Xi Zhang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Agile software developments are hotspots of software development field in foreign countries.Especially, Scrum will help us to manage the project more efficiently because it is an adaptive process.Scrum method is an iterative incremental process of Software development commonly used with Agile Software Development. According to the characteristics of agile environment and Scrum, an example is given to elaborate how to manage the project with Scrum agile management in this article.
Optimal Purchasing Portfolio for Power Supplier with Options and Interruptible Load Based on Conditional Value-at-Risk
Authors: Ruiqing Wang, Xinfeng Xiao, Weijun Dong
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Power suppliers are faced with the trade-off between benefit and risk when they purchase energy from several sub-markets under electricity market environments. With conditional value-at-risk (CVaR) as a measuring index for market risk, a purchasing model for power suppliers among the wholesale, forward, options and interruptible load (IL) markets, is proposed, in which the objective function is to maximize the portfolio expected revenues. The model can be solved by an improved genetic algorithm, and the impacts of options and IL on purchasing portfolio are analyzed. The results of numerical examples show that options and IL can effectively lower portfolio loss, and the strike price of options, the IL compensation price and the risk evaded mentalities of suppliers have substantially effect on the portfolio allocation. As a consistency risk measurement tool, CVaR can be better applied in risk management of electricity markets.
Recognizing creative thinking in graphical e-discussions using artificial intelligence graph-matching techniques
Authors: Rupert Wegerif, Bruce M. McLaren, Marian Chamrada, Oliver Scheuer, Nasser Mansour, Jan Miksátko
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Many approaches to analyzing online argumentation focus on explicit reasoning and overlook the creative emergence of new ideas. The value of a dialogic analytic framework including creative emergence was tested through applying it to the coding and analysis of undergraduate synchronous e-discussions using a graphical interface within the EU funded project ARGUNAUT. Qualitative analysis found that critical reasoning functioned to 'deepen' the graph through unpacking assumptions whilst creative emergence of new perspectives produced 'widening' moves. This distinction between deepening and widening was successfully used as the basis for an artificial intelligence (AI) graph-matching algorithm. Given examples of deepening and widening from real e-discussions, the AI algorithm was able to successfully find other occurrences of such moves within new e-discussions. This supports our claim to distinguish between these two aspects of shared thinking and has the potential to provide awareness indicators as a support for e-moderation.
KIRMES
Authors: Sebastian J. Schultheiss, Wolfgang Busch, Jan U. Lohmann, Oliver Kohlbacher, Gunnar Rätsch
Venue: Bioinformatics (2009)

Motivation: Understanding transcriptional regulation is one of the main challenges in computational biology. An important problem is the identification of transcription factor (TF) binding sites in promoter regions of potential TF target genes. It is typically approached by position weight matrix-based motif identification algorithms using Gibbs sampling, or heuristics to extend seed oligos. Such algorithms succeed in identifying single, relatively well-conserved binding sites, but tend to fail when it comes to the identification of combinations of several degenerate binding sites, as those often found in cis-regulatory modules. Results: We propose a new algorithm that combines the benefits of existing motif finding with the ones of support vector machines (SVMs) to find degenerate motifs in order to improve the modeling of regulatory modules. In experiments on microarray data from Arabidopsis thaliana, we were able to show that the newly developed strategy significantly improves the recognition of TF targets. Availability: The python source code (open source-licensed under GPL), the data for the experiments and a Galaxy-based web service are available at http://www.fml.mpg.de/raetsch/suppl/kirmes/ Contact: sebi@tuebingen.mpg.de Supplementary information:Supplementary data are available at Bioinformatics online.
Optimal base station placement in wireless sensor networks
Authors: Yi Shi, Y. Thomas Hou
Venue: ACM Transactions on Sensor Networks (TOSN) (2009)

Base station location has a significant impact on network lifetime performance for a sensor network. For a multihop sensor network, this problem is particularly challenging due to its coupling with data routing. This article presents an approximation algorithm that can guarantee (1 &minus; &epsiv;)-optimal network lifetime performance for base station placement problem with any desired error bound &epsiv; > 0. The proposed (1 &minus; &epsiv;)-optimal approximation algorithm is based on several novel techniques that makes it possible to reduce an infinite search space to a finite-element search space for base station location. The first technique used in this reduction is to discretize cost parameter (associated with energy consumption) with performance guarantee. Subsequently, the continuous search space can be broken up into a finite number of subareas. The second technique is to exploit the cost property of each subarea and represent it by a novel notion called fictitious cost point, each with guaranteed cost bounds. We give a proof that the proposed base station placement algorithm is (1&minus; &epsiv;)-optimal. This approximation algorithm is simpler and faster than a state-of-the-art algorithm and represents the best known result to the base station placement problem.
Effects of AJAX Technology on the Usability of Blogs
Authors: Sumonta Kasemvilas, Daniel Firpo
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

AJAX can enhance Web applications by updating a part of the Web page instead of the whole page. This change of technology relates to a usability issue. We used WordPress 2.3 to create two versions of blogs: non-AJAX and AJAX. Then we conducted an experiment by giving a task scenario to eight participants. We collected performance data by recording users' mouse movements during the experiment and collected preference data by providing a questionnaire after the tasks. Finally, we conducted post-experiment interviews to gather participants' experiences. The quantitative results show that AJAX did not improve users' performances the first time they used it, while qualitative interviews demonstrate participants' satisfaction with AJAX blogs.
Wearable ECG Monitoring System Using Conductive Fabrics and Active Electrodes
Authors: Su Ho Lee, Seok Myung Jung, Chung Ki Lee, Kee Sam Jeong, Gilsoo Cho, Sun K. Yoo
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

The aim of this paper is to develop nonintrusive type ECG monitoring system based on active electrode with conductive fabric. Our developed electrode can measure ECG signal without the electrolyte gel or the adhesives causing skin trouble. For the stable measurement of ECG signal, the buffer amplifier with high input impedance and the noise bypassing shield with conductive fabric were developed. This system involves real-time ECG signal monitoring, and wireless communication using the Zigbee protocol. We show experimental results for developing wearable ECG monitoring system and demonstrate how it can be applied to the design of nonintrusive electrode with conductive fabric.
Asymptotic distribution of circularity coefficients estimate of complex random variables
Authors: Jean Pierre Delmas, Habti Abeida
Venue: Signal Processing (2009)

In this correspondence we mainly consider the asymptotic distribution of the estimator of circularity coefficients of scalar and multidimensional complex random variables. A particular attention is paid to rectilinear RV. After deriving new properties of the circularity coefficients, the maximum likelihood estimate of the circularity coefficients in the Gaussian case and asymptotic distribution of this estimate for arbitrary distributions are given. Finally, an illustrative example is presented in order to strengthen the obtained theoretical results.
Issues on Mechatronic Devices Aiming to Test Neuroprothesis
Authors: Marian S. Poboroniuc, Ciprian M. Stefan, Gheorghe Livint, Danut C. Irimia
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

This paper presents three robotic structures and the software components aiming to emulate the human body motion. A neuroprosthesis is supposed to provide the control over the muscles of a disabled person during a rehabilitation process. The control method developed under Matlab®&Simulink® implements the mathematical model of the human body, the modeled muscles being electrically stimulated and the resulted motion is shown by controlling a humanoid-like robotic structure. The main feature of the proposed humanoid-like robotic structures is to support the training, development, implementation and testing of user defined control algorithms for a neuroprosthesis.
Security Analysis of the PACE Key-Agreement Protocol
Authors: Jens Bender, Marc Fischlin, Dennis Kügler
Venue: Proceedings of the 12th International Conference on Information Security (2009)

We analyze the Password Authenticated Connection Establishment (PACE) protocol for authenticated key agreement, recently proposed by the German Federal Office for Information Security (BSI) for the deployment in machine readable travel documents. We show that the PACE protocol is secure in the real-or-random sense of Abdalla, Fouque and Pointcheval, under a number-theoretic assumption related to the Diffie-Hellman problem and assuming random oracles and ideal ciphers.
Fisher Information Determines Capacity of ε-Secure Steganography
Authors: Tomáš Filler, Jessica Fridrich
Venue: Information Hiding: 11th International Workshop, IH 2009, Darmstadt, Germany, June 8-10, 2009, Revised Selected Papers (2009)

Most practical stegosystems for digital media work by applying a mutually independent embedding operation to each element of the cover. For such stegosystems, the Fisher information w.r.t. the change rate is a perfect security descriptor equivalent to KL divergence between cover and stego images. Under the assumption of Markov covers, we derive a closed-form expression for the Fisher information and show how it can be used for comparing stegosystems and optimizing their performance. In particular, using an analytic cover model fit to experimental data obtained from a large number of natural images, we prove that the ±1 embedding operation is asymptotically optimal among all mutually independent embedding operations that modify cover elements by at most 1.
Message Protocols for Provisioning and Usage of Computing Services
Authors: Nikolay Borissov, Simon Caton, Omer Rana, Aharon Levine
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

The commercial availability of computational resources enable consumers to scale their applications on-demand. However, it is necessary for both consumers and providers of computational resources to express their technical and economic preferences using common language protocols. Ultimately, this requires clear, flexible and pragmatic communication protocols and policies for the expression of bids and resulting generation of service level agreements (SLAs). Further standardization efforts in such description languages will foster the specification of common interfaces and matching rules for establishing SLAs. Grid middleware are not compatible with market-orientated resource provisioning. We aim to reduce this gap by defining extensions to a standardized specification such as JSDL. Furthermore, we present a methodology for matchmaking consumer bids and provider offers and map the additional economic attributes into a SLA. We demonstrate the usage of the message protocols in an application scenario.
Research on Prediction Model of Natural Gas Consumption Based on Grey Modeling Optimized by Genetic Algorithm
Authors: Yan Xie, Mu Li
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Natural gas consumption is an important index to reflect living and spending levels of residents. Carries on the prediction to it, to ensure network capacity, carry out the optimization of network scheduling, equipment maintenance and so on, is of great significance. In this paper it introduces grey modelling method optimized by genetic algorithm. The grey prediction model of natural gas consumption is given. An example is given to verify the model and contrast the actual consumption. The result indicates that the method predicting natural gas consumption is simple and accurate, that the model has good adaptability and accuracy, and that the method is important to optimize the operation and united dispatch management of the transmission and distribution pipeline network.
Semi-supervised lexicon mining from parenthetical expressions in monolingual web pages
Authors: Xianchao Wu, Naoaki Okazaki, Jun'ichi Tsujii
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

This paper presents a semi-supervised learning framework for mining Chinese-English lexicons from large amount of Chinese Web pages. The issue is motivated by the observation that many Chinese neologisms are accompanied by their English translations in the form of parenthesis. We classify parenthetical translations into bilingual abbreviations, transliterations, and translations. A frequency-based term recognition approach is applied for extracting bilingual abbreviations. A self-training algorithm is proposed for mining transliteration and translation lexicons. In which, we employ available lexicons in terms of morpheme levels, i.e., phoneme correspondences in transliteration and grapheme (e.g., suffix, stem, and prefix) correspondences in translation. The experimental results verified the effectiveness of our approaches.
Semi-supervised polarity lexicon induction
Authors: Delip Rao, Deepak Ravichandran
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We present an extensive study on the problem of detecting polarity of words. We consider the polarity of a word to be either positive or negative. For example, words such as good, beautiful, and wonderful are considered as positive words; whereas words such as bad, ugly, and sad are considered negative words. We treat polarity detection as a semi-supervised label propagation problem in a graph. In the graph, each node represents a word whose polarity is to be determined. Each weighted edge encodes a relation that exists between two words. Each node (word) can have two labels: positive or negative. We study this framework in two different resource availability scenarios using WordNet and OpenOffice thesaurus when WordNet is not available. We report our results on three different languages: English, French, and Hindi. Our results indicate that label propagation improves significantly over the baseline and other semi-supervised learning methods like Mincuts and Randomized Mincuts for this task.
On Second-Order Fault Analysis Resistance for CRT-RSA Implementations
Authors: Emmanuelle Dottax, Christophe Giraud, Matthieu Rivain, Yannick Sierra
Venue: Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks (2009)

Since their publication in 1996, Fault Attacks have been widely studied from both theoretical and practical points of view and most of cryptographic systems have been shown vulnerable to this kind of attacks. Until recently, most of the theoretical fault attacks and countermeasures used a fault model which assumes that the attacker is able to disturb the execution of a cryptographic algorithm only once. However, this approach seems too restrictive since the publication in 2007 of the successful experiment of an attack based on the injection of two faults, namely a second-order fault attack. Amongst the few papers dealing with second-order fault analysis, three countermeasures were published at WISTP'07 and FDTC'07 to protect the RSA cryptosystem using the CRT mode. In this paper, we analyse the security of these countermeasures with respect to the second-order fault model considered by their authors. We show that these countermeasures are not intrinsically resistant and we propose a new method allowing us to implement a CRT-RSA that resists to this kind of second-order fault attack.
The Recursive Dual-Net and Its Applications
Authors: Yamin Li, Shietung Peng, Wanming Chu
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel computers. The RDN is generated by recursively applying dual-construction on a base-network. Given a regular and symmetric graph of size n and node-degree d, the dual-construction generates a regular and symmetric graph of size 2n 2 and node-degree d + 1. The RDN has many interesting properties including low node-degree and small diameter. For example, we can construct an RDN connecting more than 3-million nodes with only 6 links per node and a diameter of 22. We investigate the topological properties of the RDN and compare it to other networks including 3D torus, WK-recursive network, hypercube, cube-connected-cycle, and dual-cube. We also describe an efficient routing algorithm for RDN.
Referring Phenomena in a Multimedia Context and their Computational Treatment
Venue: ACL Workshops (1997)

A growing number of research projects has started to investigate the use of referring expressions in multimedia systems. On the one hand, the use of multiple media has led to new problems, such as a proper treatment of cross-media references. On the other hand, it has turned out that many concepts already known from natural language processing, such as cohesion, take on an extended meaning in multimedia discourse. For example, a proper treatment of referring expressions in a multimedia discourse requires an explicit representation of the syntax and semantics of the graphical discourse. As theories of NL reference become more sophisticated, it is quite natural to investigate whether these theories also encompass other media, such as graphics and pointing gestures. Several research projects have already started to transfer theories to the broader context of multimedia discourse. Examples of models that have been used for multimedia applications are Grosz and Sidner's theory of discourse structure, the centering model developed by Joshi and colleagues and Appelt's and Kronfeld's model of referring. However, there are researchers who doubt that linguistic phenomena, such as anaphora, also exist in multimedia dialogue. The reason they give is that there are no graphical devices for distinguishing between a reference-specifying and a predication-specifying part since objects and their properties are hardly separable once depicted.
Who is who and what is what: experiments in cross-document co-reference
Authors: Alex Baron, Marjorie Freedman
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

This paper describes a language-independent, scalable system for both challenges of cross-document co-reference: name variation and entity disambiguation. We provide system results from the ACE 2008 evaluation in both English and Arabic. Our English system's accuracy is 8.4% relative better than an exact match baseline (and 14.2% relative better over entities mentioned in more than one document). Unlike previous evaluations, ACE 2008 evaluated both name variation and entity disambiguation over naturally occurring named mentions. An information extraction engine finds document entities in text. We describe how our architecture designed for the 10K document ACE task is scalable to an even larger corpus. Our cross-document approach uses the names of entities to find an initial set of document entities that could refer to the same real world entity and then uses an agglomerative clustering algorithm to disambiguate the potentially co-referent document entities. We analyze how different aspects of our system affect performance using ablation studies over the English evaluation set. In addition to evaluating cross-document co-reference performance, we used the results of the cross-document system to improve the accuracy of within-document extraction, and measured the impact in the ACE 2008 within-document evaluation.
Real Computable Manifolds and Homotopy Groups
Authors: Wesley Calvert, Russell Miller
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

Using the model of real computability developed by Blum, Cucker, Shub, and Smale, we investigate the difficulty of determining the answers to several basic topological questions about manifolds. We state definitions of real-computable manifold and of real-computable paths in such manifolds, and show that, while BSS machines cannot in general decide such questions as nullhomotopy and simple connectedness for such structures, there are nevertheless real-computable presentations of paths and homotopy equivalence classes under which such computations are possible.
An Area-Efficient LDPC Decoder Architecture and Implementation for CMMB Systems
Authors: Kai Zhang, Xinming Huang, Zhongfeng Wang
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

This paper presents an area-efficient LDPC decoder architecture for the China Multimedia Mobile Broadcasting (CMMB) standard. Several techniques are adopted to reduce memory size, including the min-sum algorithm (MSA), optimal bit-width quantization of the iterative messages and reduced complexity for the interconnect network. The decoder for the rate-1/2 9216-bit code is implemented using the 90nm 1.0V CMOS technology. It achieves the decoding throughput of 48Mbps at 5 iterations when operating at 60MHz and the power dissipation is only 34mW.