ppxscal/embedding_network huggingface dataset:
Gesti&oacute;n del conocimiento estrategia de vinculaci&oacute;n en los centros comunitarios de aprendizaje
Authors: María del Rocío Gómez Díaz, Rodrigo Sandoval Almazán
Venue: Proceedings of the 10th Annual International Conference on Digital Government Research: Social Networks: Making Connections between Citizens, Data and Government (2009)

En el actual contexto la informaci&oacute;n, el aprendizaje y el conocimiento tienen un papel preponderante en el desarrollo socioecon&oacute;mico, por ello es necesario generar estrategias que permitan acercar la informaci&oacute;n a los m&aacute;s desprotegidos. El gobierno mexicano ha creado los centros comunitarios de aprendizaje (CCA) en comunidades de extrema pobreza para que haciendo uso de la tecnolog&iacute;a se logre resolver esta necesidad. Este estudio parte del supuesto de que existen elementos de la gesti&oacute;n del conocimiento en los CCA que no se han aprovechado eficazmente e identifica qu&eacute; mejoras se pueden proponer para impulsar estos centros con mayor beneficio. Para demostrarlo se tom&oacute; el caso del Estado de M&eacute;xico donde se realiz&oacute; una encuesta en l&iacute;nea a dichos centros y de la cual se presentan aqu&iacute; los resultados. El art&iacute;culo se encuentra dividido en cuatro secciones. En la primera, se describen los antecedentes de los CCA; la segunda parte, hace una revisi&oacute;n de literatura de gobierno digital y gesti&oacute;n del conocimiento; en la tercera secci&oacute;n, se presenta la metodolog&iacute;a utilizada y en la cuarta, se muestran los resultados y conclusiones obtenidos y se exploran nuevas l&iacute;neas de investigaci&oacute;n.
Towards engineered architecture evolution
Authors: Sagar Chaki, Andres Diaz-Pace, David Garlan, Arie Gurfinkel, Ipek Ozkaya
Venue: Proceedings of the 2009 ICSE Workshop on Modeling in Software Engineering (2009)

Architecture evolution, a key aspect of software evolution, is typically done in an ad hoc manner, guided only by the competence of the architect performing it. This process lacks the rigor of an engineering discipline. In this paper, we argue that architecture evolution must be engineered — based on rational decisions that are supported by formal models and objective analyses. We believe that evolutions of a restricted form — close-ended evolution, where the starting and ending design points are known a priori — are amenable to being engineered. We discuss some of the key challenges in engineering close-ended evolution. We present a conceptual framework in which an architecture evolutionary trajectory is modeled as a sequence of steps, each captured by an operator. The goal of our framework is to support exploration and objective evaluation of different evolutionary trajectories. We conclude with open research questions in developing this framework.
CAPM Exam Success Series: Bootcamp Manual (with Exam Simulation CD-ROM), 2.0 edition
Authors: Tony Johnson
Venue:  (2009)

This product is for those taking the CAPM Exam after July 31, 2009. This aligns with the PMBOK Guide Fourth Edition.The CAPM Exam Success Series: Certification Exam Manual is the foundation of the CAPM Exam Success Series (currently used in 43 countries). This is a must have for anyone preparing to take the CAPM Exam. This book is complete with valuable exam preparation information, including Crosswind Must Knows for each exam topic, terms and definitions, formulas, exercises (matching, Earned Value and Network Diagram Analysis) and situational questions translation. It has a complete integrated test of 150 questions, like the real exam in the attached EXAM SIMULATION CD-ROM. As well as, 30 questions with full explanation of the correct and incorrect answers for each topic area. It includes matching and Input /Tools & Techniques/ Outputs (ITTO's) matching exercises to help reinforce PMI terminology and processes used on the exam. Included also are mind maps for every exam knowledge area. The book contains the following: A Proven Roadmap to Prepare for the CAPM Exam Must Knows for Every Exam Topic Contains Over 400 Exam Format Sample Questions and an Additional 150 on the Included Exam Simulation CD-ROM Matching Exercises for Inputs, Tools/Techniques, Outputs and Terminology Mind-maps for Each Knowledge Area Formulas Clearly Explained with Memorization Keys Network Diagramming and Earned Value Exercises
CBR-TM: A new Case-Based Reasoning System for Help-Desk Environments
Authors: Juan Ángel García-Pardo, Stella Heras Barberá, Rafael Ramos-Garijo, Alberto Palomares, Vicente Julián, Miguel Rebollo, Vicent Botti
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

In this paper, a new CBR system for help-desk environments is presented. This CBR system provides intelligent customer support for multiple domains. It is also portable and flexible. The system is implemented as a module of a complete help-desk application to make it as independent as possible of any change in the help-desk system. Each phase of the reasoning cycle is also separated as an independent module, making the CBR system easy to update. The system has been tested in a real call center managed by the Spanish company TISSAT S.A.
Encoding information flow in Aura
Authors: Limin Jia, Steve Zdancewic
Venue: Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security (2009)

Two of the main ways to protect security-sensitive resources in computer systems are to enforce access-control policies and information-flow policies. In this paper, we show how to enforce information-flow policies in Aura, which is a programming language for access control. When augmented with this mechanism for enforcing information-flow polices, Aura can further improve the security of reference monitors that implement access control. We show how to encode security types and lattices of security labels using Aura's existing constructs for authorization logic. We prove a noninterference theorem for this encoding. We also investigate how to use expressive access-control policies specified in authorization logic as the policies for information declassification.
EDI-based and XML-based business-to-business integration: a statistical analysis
Authors: Juha-Miikka Nurmilaakso
Venue: International Journal of Business Information Systems (2009)

This paper analyses six factors that are expected to facilitate Electronic Data Interchange (EDI)-based or Extensible Markup Language (XML)-based Business-to-Business (B2B) integration. Following the Technology-Organisation-Environment (TOE) framework, the paper focuses on one technological factor, four organisational factors and one environmental factor. An e-business framework is a standard for business documents, business processes and messaging interfaces in B2B integration. Six hypotheses on the use of EDI-based or XML-based e-business frameworks are based on the literature. These hypotheses are tested using logistic regression analysis. The data involve 3619 European companies. Large numbers of enterprise information systems and company employees facilitate the use of e-business frameworks. A high volume of sales and educational level of the employees in the company facilitate especially the use of XML-based e-business frameworks. Moreover, if the company primarily has other companies as customers, it is more likely to use an e-business framework. The number of sites in the company has no effects on this use.
Addressing Collaborative Attacks and Defense in Ad Hoc Wireless Networks
Authors: Bharat Bhargava, Ruy de Oliveira, Yu Zhang, Nwokedi C. Idika
Venue: Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems Workshops (2009)

Since ad hoc networks rely on nodes cooperation to establish communication, malicious nodes can compromise the entire network. If they collaborate the devastation is even worse. Collaborative attacks may cause more devastating impacts on wireless environments than single and uncoordinated groups of attacks, as they combine efforts of more than one attacker against the target victim. In this paper, we present the most important forms of attacks,discuss possible collaborations among attackers, show how machine learning techniques and signal processing techniques can be used to detect and defend against collaborative attacks in such environments, and discuss implementation issues.
Wireless Positioning Technologies and Applications
Authors: Alan Bensky
Venue: Technology And Applications (2007)

At last--here's a comprehensive book that puts full details on all short-range wireless-positioning methods at your command for instant access and use. This one-stop resource surveys each technique's theory of operation, advantages and disadvantages, applicability in different domains, implementation procedures, and accuracy to help you select the right technology for any application and ensure the best results possible. Real-life examples together with 161 diagrams help bring all options into sharp focus. After introducing wireless positioning fundamentals along with various personal, commercial, and industrial applications, the book guides you step by step through radio signal time of flight methods, the signal strength method, the angle of arrival system, and the geometric use of distance measurement to determine location. It discusses location awareness applications and implementations using cellular networks. You are brought up to speed on fast-developing techniques involving local area networks (WLANs), personal area networks (WPANs), and radio frequency ID (RFID). Moreover, you find coverage of the distance measurement features in the new IEEE 802.15.4a spec for low rate wireless personal area networks. This practical resource offers detailed guidance on how to implement important technologies, including direct sequence spread spectrum, frequency hopping spread spectrum, and ultrawideband (UWB). The book also explores ways to counteract accuracy impairments caused by noise, multipath and fading, and limitations of antenna directivity and time measurement precision.
Full-wave modeling and analysis of dispersion-engineered materials and plasmon waveguides
Authors: Fernando L. Teixeira
Venue:  (2008)

The main focus of this dissertation is the development of full-wave modeling and the analysis of dispersion-engineered materials and plasmon waveguides. Among dispersion-engineered structures, we in particular focus on slow-wave photonic crystals (PhCs) where the dispersion curve &omega;(k) is approximated as a cubic polynomial, a quartic polynomial, or a linear combination of a quadratic polynomial and a quartic polynomial. We propose and investigate new compact plasmon waveguides operating at optical communication band (&lambda; 0 &sim; 1550 nm). Slow-wave PhCs may consist of periodic arrangements of complex media such as ferromagnetic materials and anisotropic dielectrics. The dispersion curve is tailored by the choice of geometries and materials for each unit cell. We develop finite-difference time-domain (FDTD) algorithms suitable for the analysis of slow-wave PhCs. This will be performed by decoupling the time-marching update equations into two steps, viz. one associated with Maxwell&rsquo;s equations and the other associated with the constitutive relations. The complex-frequency-shifted (CFS)-perfectly matched layer (PML) is employed to minimize spurious reflections from the outer boundary of the computational domain. We further extend the complex-envelope (CE)-alternating-direction-implicit (ADI)-FDTD algorithm to anisotropic media, in order to lift the Courant stability limit with no loss of accuracy. Plasmon structures are based on metallic nanostructures and they are of great interest due to their extraordinary properties such as subwavelength guiding and highly localized field phenomena. By harnessing the extraordinary optical properties of plasmon structures, we propose two types of compact plasmon waveguides operating at optical communication band. The first plasmon waveguide is based on an ordered array of gold nanorings. Electromagnetic fields are guided along this nanoparticle-based plasmon waveguide by near-field coupling between closely spaced nanoparticles. The second plasmon waveguide is based on a surface plasmon (SP)-coplanar waveguide (CPW). The SP-CPW yields compact mode confinement and moderate propagation loss. The analysis and design of these two types of plasmon waveguides will be performed using the 3-D CFS-PML-FDTD algorithm extended for the Drude dispersion model. Further algorithm improvements are described. We propose an efficient time-domain modeling for plasmon structures in the visible spectrum, based on the extension of the ADI-FDTD algorithm to the multispecies Drude-Lorentz dispersion model. We also introduce a novel locally-one-dimensional (LOD)-FDTD algorithm based on an iterative fixed-point correction to reduce the splitting error. Lastly, we investigate numerical artifacts of the CE-ADI-FDTD algorithm and discuss the way to reduce these numerical artifacts.
Survival patients with pulmonary metastases in breast cancer neoplasia
Authors: Man Milena, Cosmina-Ioana Bondor, Ioana Neagoe, Monica Pop, Antigona Trofor, Dana Alexandrescu, Ruxandra Rajnoveanu, Elena Dantes
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

Breast cancer is one of the most frequent neoplasia in women (27% of the total types of cancer). It represents the second cause of death in the USA after pulmonary cancer. We conducted a survey from January 2000 to December 2005 on 120 patients admitted in Cluj-Napoca Oncology Institute and "Leon Daniello" Pneumology Clinical Hospital. We introduced in the study patients diagnosed with breast carcinoma and pulmonary metastases, we analyzed risk factor and evolution of the diseases with survival function calculated since breast cancer diagnosis, and the other calculated since pulmonary metastases. Age of the patients over 60 years (p=0.01), urban areas (p=0.048), smoking (p=0.001), time between the first symptoms and the doctor' presentation (more than 1 year) was significant statistic in both survival (p=0.005 and p=0.003). Good performance status (p=0.03), the stage of the disease at presentation (p=0.004), type of metastasis, good risk class (p=0.0004), response at the treatment (only 5% had complete response) influence the survival calculated from the breast cancer diagnosis (69.15% at 1 year, 17.02% at 5 years, 4.26% at 10 years) and the survival calculated from the moment of pulmonary metastases (32.53% at 1 year, 4.82% at 5 years, 2.41% at 10 years). Mathematics and statistic analysis were very important in evaluation and validation of prognostic factors of disease, because the doctor can choose the best treatment for each patient, can compare the therapeutic strategy in similar situation and can discover precocious recurrence of neoplasia.
Matchings, matroids and submodular functions
Authors: Michel X. Goemans
Venue:  (2008)

This thesis focuses on three fundamental problems in combinatorial optimization: non-bipartite matching, matroid intersection, and submodular function minimization. We develop simple, efficient, randomized algorithms for the first two problems, and prove new lower bounds for the last two problems. For the matching problem, we give an algorithm for constructing perfect or maximum cardinality matchings in non-bipartite graphs. Our algorithm requires O(n&omega;) time in graphs with n vertices, where &omega; < 2.38 is the matrix multiplication exponent. This algorithm achieves the best-known running time for dense graphs, and it resolves an open question of Mucha and Sankowski (2004). For the matroid intersection problem, we give an algorithm for constructing a common base or maximum cardinality independent set for two so-called "linear" matroids. Our algorithm has running time O(nr &omega;&minus;1) for matroids with n elements and rank r. This is the best-known running time of any linear matroid intersection algorithm. We also consider lower bounds on the efficiency of matroid intersection algorithms, a question raised by Welsh (1976). Given two matroids of rank r on n elements, it is known that O( nr1.5) oracle queries suffice to solve matroid intersection. However, no non-trivial lower bounds are known. We make the first progress on this question. We describe a family of instances for which (log 2 3)n &minus; o(n) queries are necessary to solve these instances. This gives a constant factor improvement over the trivial lower bound for a certain range of parameters. Finally, we consider submodular functions, a generalization of matroids. We give three different proofs that &Omega;(n) queries are needed to find a minimizer of a submodular function, and prove that &Omega;( n2/ log n) queries are needed to find all minimizers. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Measuring design complexity: an inherited method perspective
Authors: A. Yadav, R. A. Khan
Venue: ACM SIGSOFT Software Engineering Notes (2009)

Complexity is one of the important attributes of reliability. Higher design complexity increases the probability of error occurrences and decreases reliability of software. Inheritance has been indentified as a key construct to control design complexity. This paper proposes a formula to calculate the overall complexity of design hierarchy caused by inherited methods.
Quantum Oscillator in a Heat Bath
Authors: Pramodh Vallurpalli, Praveen K. Pandey, Bhalachandra L. Tembe
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

In the present article, we use the density matrix evolution method to study the effect of a model solvent on the vibrational spectrum of a diatomic solute particle. The effect of the solvent is considered as a perturbation on the Hamiltonian of the quantum subsystem consisting of a harmonic oscillator. The bath particles are treated classically. The perturbation potential representing the interaction between the solute and the solvent is represented in a bi-exponential form. This provides an effective way to evaluate the required matrix elements needed to compute the evolution of the density matrix. The model calculations indicate that the repulsive parts of the potential dominate causing blue shifts in the vibrational frequencies.
False positive reduction in urinary particle recognition
Authors: Yan Liang, Bin Fang, Jiye Qian, Lin Chen, Chunyan Li, Ying Liu
Venue: Expert Systems with Applications: An International Journal (2009)

The identification of non-cell objects in biological images is not a trivial task largely due to the difficulty in describing their characteristics in recognition systems. In order to better reduce the false positive rate caused by the presence of non-cell particles, we propose a novel approach using a local jet context features scheme combined with a two-tier object classification system. The newly proposed feature scheme, namely local jet context feature, integrates part of global features with the ''local jet'' features. The scheme aims to effectively describe the particle characteristics that are invariant to shift and rotation, and hence help to retain the critical shape information. The proposed two-tier particle classification strategy consists of a pre-recognition stage first and later a further filtering phase. Using the local jet context features coupled with a multi-class SVM classifier, the pre-recognition stage intends to assign the particles to their corresponding classes as many as possible. To further reduce the false positive particles, next a decision tree classifier based on shape-centered features is applied. Our experimental study shows that through the proposed two-tier classification strategy, we are able to achieve 85% of identification accuracy and 80% of F"1 value in urinary particle recognition. The experiment results demonstrate that the proposed local jet context features are capable to discriminate particles in terms of shape and texture characteristics. Overall, the two-tier classification stage is found to be effective in reducing the false positive rate caused by non-cell particles.
Solid Code
Authors: Donis Marshall, John Bruno
Venue:  (2009)

With insights direct from Microsoft s own development teams and across the software-development life cycle learn best practices for writing solid, well-formed, efficient code. Ideal for new to intermediate level developers, but with fresh insights for more experienced programmers, SOLID CODE will help improve your coding techniques at each phase of product development: design, prototyping, implementation, debugging, and testing. This book shares practical, experience-based advice from veteran engineers and developers that you can apply to your own work now, whether using agile or waterfall methods.
A scalable high-voltage output driver for low-voltage CMOS technologies
Authors: Erik J. Mentze, Herbert L. Hess, Kevin Matthew Buck, Tracey G. Windley
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2006)

A monolithic implementation of series connected MOSFETs for high-voltage switching applications is presented. Using a single low-voltage control signal to trigger the bottom MOSFET in the series stack, a voltage division across parasitic and inserted capacitances in the circuit is used to turn on the entire stack of devices. This voltage division both statically and dynamically safeguards the individual MOSFETs over the entire switching period. Because the output voltage is balanced across each device in the stack for the entire switching period, stress to the oxide and hot-carrier degradation are minimized, even in the event of transient over voltages. This circuit, termed the Stacked MOSFET, is n × scalable, allowing for the on-die control of voltages that are n × the fabrication processes rated operating voltage. The governing equations for this circuit are derived and reliable operation is demonstrated through simulation and experimental implementation in a 0.35-µm SOI CMOS process. The realized prototype is shown to handle 2 × the nominal process operating voltage at a switching frequency of 20 MHz with an input-to-output delay of only 5.5 ns.
Development of a Webots Simulator for the Lauron IV Robot
Authors: Julio Pacheco, Francesc Benito
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

This article describes the work accomplished to get a Webots simulator for the Lauron IV robot and how we have solved the difficulties encountered during the project. The evolution of the simulator (and of the different prototypes aimed at obtaining one that ressembles the real robot) incorporating characteristics on it, allow us to work “indistinctly” so much in the real robot as in the simulator. This way, experiences and results can be interchanged between them. In order to be able to develop our study with the Lauron IV, we should do a “physical” use of the robot with the advantages and disadvantages that it implies (refilling of batteries, starting tests, sensor re-calibration, piece wear, etc). Then, we had the idea of developing a project that consisted in developing two applications; the first application was the one that used the Lauron IV robot (the application that moves the robot physically) and the another one was the simulation of the robot able to control the physical robot movements without depending on it.