ppxscal/embedding_network huggingface dataset:
Recommending Terms for Glossaries: A Computer-Based Approach
Authors: Eric Knauss, Sebastian Meyer, Kurt Schneider
Venue: Proceedings of the 2008 First International Workshop on Managing Requirements Knowledge (2008)

Glossaries in Software Requirements Specifications (SRS) aim at establishing a common ground of definitions. However, ambiguous terms as due to tacit knowledge are seldom captured in glossaries. In addition, even if they are captured, they are seldom read, because potential readers are convinced that they already know how the term is defined. Such misunderstandings introduce high risks in projects - especially because they are so hard to detect. Therefore, a trigger is needed to start a discussion about these potentially dangerous terms. In this paper we show how context aware Requirements Engineering tools can heuristically detect these terms and point out the risk attached. We introduce two simple, yet powerful heuristics: Occurence counting detects important terms, comparison with old glossaries detects terms that others found worth defining in a glossary. Thus, we make use of glossaries from past projects to suggest possible terms of interest for current projects. Our approach was implemented and applied to six software projects. Based on these experiences we show the effectivity of our heuristics and how they could be used by learning organizations to reduce such ambiguity risks in their specific domain.
Post-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning
Authors: Michael R. Hines, Kartik Gopalan
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

We present the design, implementation, and evaluation of post-copy based live migration for virtual machines (VMs) across a Gigabit LAN. Live migration is an indispensable feature in today's virtualization technologies. Post-copy migration defers the transfer of a VM's memory contents until after its processor state has been sent to the target host. This deferral is in contrast to the traditional pre-copy approach, which first copies the memory state over multiple iterations followed by a final transfer of the processor state. The post-copy strategy can provide a "win-win" by reducing total migration time closer to its equivalent time achieved by non-live VM migration. This is done while maintaining the liveness benefits of the pre-copy approach. We compare post-copy extensively against the traditional pre-copy approach on top of the Xen Hypervisor. Using a range of VM workloads we show improvements in several migration metrics including pages transferred, total migration time and network overhead. We facilitate the use of post-copy with adaptive pre-paging in order to eliminate all duplicate page transmissions. Our implementation is able to reduce the number of network-bound page faults to within 21% of the VM's working set for large workloads. Finally, we eliminate the transfer of free memory pages in both migration schemes through a dynamic self-ballooning (DSB) mechanism. DSB periodically releases free pages in a guest VM back to the hypervisor and significantly speeds up migration with negligible performance degradation.
Graphic Symbol Recognition Using Auto Associative Neural Network Model
Authors: Mahesh Kumar Gellaboina, Vijendran G. Venkoparao
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

Symbol recognition is a well-known problem in the field of graphics. A symbol can be defined as a structure within document that has a particular meaning in the context of the application. Due to their representational power, graph structures are usually used to represent line drawings images.An accurate vectorization constitutes a first approach to solve this goal. But vectorization only gives the segments constituting the document and their geometrical attributes.Interpreting a document such as P&ID (Process & Instrumentation)diagram requires an additional stage viz. recognition of symbols in terms of its shape. Usually a P&ID diagram contain several types of elements, symbols and structural connectivity. For those symbols that can be defined by a prototype pattern, we propose an iterative learning strategy based on Hopfield model to learn the symbols, for subsequent recognition in the P&ID diagram. In a typical shape recognition problem one has to account for transformation invariance. Here the transformation invariance is circumvented by using an iterative learning approach which can learn symbols with high degree of correlation.
Nodes Deployment Mechanism Based on Energy Efficiency in Wireless Sensor Networks
Authors: Rui-Hua Zhang, Zhi-Ping Jia, Xin-Shun Xu
Venue: International Journal of Distributed Sensor Networks (2009)

In wireless sensor networks, devices are required to self-organize themselves into a network without previously established infrastructure. Because the device is battery-powered, one of the most important design criteria for this type of network is energy efficiency. Based on two linear traffic models and an extension of energy model of the radio, we consider different multi-hop scenarios to compute the energy and energy efficiency of the whole network. Through analyzing these results, we present two valid deployment mechanisms for sensor nodes. The first deployment mechanism is that nodes are deployed with equidistant spacing. Under this topology, we compute energy per payload bit, energy efficiency, and the total energy consumed by individual nodes, and the whole network. Simulation results show that a single-hop strategy is more efficient than a multi-hop one, especially for low path loss exponents, when the total distance is less than the feasible range of the radio. The receive and startup energy overhead, in addition to the energy drain increase at nodes close to the sink, makes multi-hop an inefficient technique. If overheads can be reduced with new transceiver technologies, multi-hop becomes more attractive. We derive the optimum value for one-hop spacing for the first mechanism, and present the formula to calculate the optimal value with the different application parameters. It is independent of the physical network topology, the number of transmission sources, and the total transmission distance. It only depends on the propagation environment and the device parameters. This mechanism can minimize the energy consumption of the whole network. The first deployment mechanism can achieve minimized energy consumption for the multi-hop scenario where each node transmits a data frame to the sink. However, it brings up a question of energy consumption disproportion between nodes. It is because those nodes close to the sink will relay larger amounts of data packets and their energy consumption will be more. In my intuition, node spacing is chosen shorter to consume less energy for the node closer to the sink. This strategy can balance energy consumption between nodes. So another deployment mechanism is that nodes are deployed with optimal spacing. We present the formula to calculate the optimal spacing. This mechanism can balance every node's energy consumption, thus prolonging the whole network's lifetime. Simulation results show that two deployment mechanisms are good and useful with energy efficiency in wireless sensor networks.
Finite Time Synchronization of Sprott Circuits with Uncertain Parameters
Authors: Xia Xiao-dong, Yang Wan-li, Zheng Su-wen
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper deals with the finite-time chaos synchronization of a class of piecewise linear chaotic systems known as Sprott circuits. Based on the finite-time stability theory, a control law is proposed to realize finite-time chaos synchronization for Sprott circuits with uncertain parameters. This controller renders the closed loop system robust with respect to bounded disturbances and parametric variations. The numerical simulation results demonstrate the validity and feasibility of the proposed controller.
Automated control of multiple virtualized resources
Authors: Pradeep Padala, Kai-Yuan Hou, Kang G. Shin, Xiaoyun Zhu, Mustafa Uysal, Zhikui Wang, Sharad Singhal, Arif Merchant
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

Virtualized data centers enable sharing of resources among hosted applications. However, it is difficult to satisfy service-level objectives(SLOs) of applications on shared infrastructure, as application workloads and resource consumption patterns change over time. In this paper, we present AutoControl, a resource control system that automatically adapts to dynamic workload changes to achieve application SLOs. AutoControl is a combination of an online model estimator and a novel multi-input, multi-output (MIMO) resource controller. The model estimator captures the complex relationship between application performance and resource allocations, while the MIMO controller allocates the right amount of multiple virtualized resources to achieve application SLOs. Our experimental evaluation with RUBiS and TPC-W benchmarks along with production-trace-driven workloads indicates that AutoControl can detect and mitigate CPU and disk I/O bottlenecks that occur over time and across multiple nodes by allocating each resource accordingly. We also show that AutoControl can be used to provide service differentiation according to the application priorities during resource contention.
Optimizing the Control Hierarchy of an ECC Coprocessor Design on an FPGA Based SoC Platform
Authors: Xu Guo, Patrick Schaumont
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

Most hardware/software codesigns of Elliptic Curve Cryptography only have one central control unit, typically a 32 bit or 8 bit processor core. With the ability of integrating several soft processor cores into one FPGA fabric, we can have a hierarchy of controllers in one SoC design. Compared to the previous codesigns trying to optimize the communication overhead between the central control unit and coprocessor over bus by using different bus protocols (e.g. OPB, PLB and FSL) or advanced techniques (e.g. DMA), our approach prevents overhead in bus transactions by introducing a local 8 bit microcontroller, PicoBlaze, in the coprocessor. As a result, the performance of the ECC coprocessor can be almost independent of the selection of bus protocols. To further accelerate the Uni-PicoBlaze based ECC SoC design, a Dual-PicoBlaze based architecture is proposed, which can achieve the maximum instruction rate of 1 instruction/cycle to the ECC datapath. Using design space exploration of a large number of system configurations of different architectures discussed in this paper, our proposed Dual-PicoBlaze based design also shows best trade-off between area and speed.
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Authors: Dezun Dong, Yunhao Liu, Xiangke Liao
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grained, fail to accurately locate boundaries, especially when small holes exist. To address this issue, we propose a fine-grained boundary recognition approach using connectivity information only. This algorithm accurately discovers inner and outer boundary cycles without using location information. To the best of our knowledge, this is the first design being able to determinately locate all hole boundaries no matter how small the holes are. Also, this distributed algorithm does not rely on high node density. We formally prove the correctness of our design, and evaluate its effectiveness through extensive simulations.
Multi-objective planning for workflow execution on Grids
Authors: Jia Yu, Michael Kirley, Rajkumar Buyya
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Utility Grids create an infrastructure for enabling users to consume services transparently over a global network. When optimizing workflow execution on utility Grids, we need to consider multiple Quality of Service (QoS) parameters including service prices and execution time. These optimization objectives may be in conflict. In this paper, we have proposed a workflow execution planning approach using multi-objective evolutionary algorithms (MOEAs). Our goal was to generate a set of trade-off scheduling solutions according to the users QoS requirements. The alternative trade-off solutions offer more flexibility to users when estimating their QoS requirements of workflow executions. Simulation results show that MOEAs are able to find a range of compromise solutions in a short computational time.
Equalizer programming guide: version 1.0 for equalizer 0.4
Authors: Stefan Eilemann
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Equalizer provides a framework for the development of parallel real-time 3D graphics applications using OpenGL. Equalizer-based applications can run from a single shared-memory system with one or multiple graphics cards up to large-scale graphics clusters. This Programming Guide introduces the programming interface, often using the Equalizer eqPly demo example as a guideline. Equalizer is the next step in the evolution of generic parallel programming interfaces for OpenGL-based visualization applications. Existing solutions, such as OpenGL Multipipe SDK, Cavelib and VRJuggler, only implement a subset of the core parallel and distributed rendering concepts similar to Equalizer. In other areas, e.g., tracking device support, they provide more functionality. In order to adapt an application to Equalizer, the programmer structures the source code so that the OpenGL rendering can be executed in parallel, potentially using multiple processes for cluster-based execution. Equalizer provides the domain-specific parallel rendering know-how and abstracts configuration, multi-threading, synchronization, windowing and event handling. It is similar to GLUT, but providing parallel and distributed execution, scalable rendering features and fully customizable event handling.
Data processing project management: a practical approach for publishing a project expectations document
Authors: Lois Zells
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

With the mounting demand for proficient personnel and the parallel increase in salaries, management is seeking ways to improve productivity in order to realize a higher return on their investment dollars. Knowing what to do, when to do it, and how to do it prevents costly retries. Given any kind of a project and 2 to N participants, there will be 2 to N views of the project. Furthermore, there are always dozens of subtle nuances floating like little puffs of smoke over every enterprise, and they are often not in agreement. It is necessary to crystallize the assumptions that each participant "understands" to be the accepted expectations, resolve the conflicts, and disseminate this information to the community. This paper reflects a practical method for transforming facts and conflicts into an approved development approach and publishing the results in what will be called a Project Expectations Document.
Using Data Mining Algorithms in Web Performance Prediction
Authors: Leszek Borzemski, Marta Kliber, Ziemowit Nowak
Venue: Cybernetics and Systems (2009)

This paper presents the application of data mining algorithms to the prediction of Web performance. Our domain-driven data mining uses historic HTTP transactions data reflecting Web performance as perceived by the end-users located in the Internet domain of Wroclaw University of Technology, Wroclaw, Poland. The predictive modeling features of two general data mining systems, Microsoft SQL Server and IBM Intelligent Miner, are compared. The neural networks, decision tree, time series, and transform regression models are evaluated. It is shown that the data mining algorithms return quite accurate prediction results. The best results are achieved using the IBM's transform regression algorithm.
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
Authors: Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
Venue: Theoretical Computer Science (2009)

This paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the length of the longest common substring of two given SLP-compressed strings, and the other is to compute all palindromes of a given SLP-compressed string. In order to solve these problems efficiently (in polynomial time w.r.t. the compressed size) decompression is never feasible, since the decompressed size can be exponentially large. We develop combinatorial algorithms that solve these problems in O(n4logn) time with O(n3) space, and in O(n4) time with O(n2) space, respectively, where n is the size of the input SLP-compressed strings.
Decision support systems: a practical application---branch office structure
Authors: John R. Wetmiller
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

As the decade of the 1980s approaches, it is generally agreed that computer companies will stress not technology, but rather customer service functions as a means to differentiate themselves from one another. Consequently, the need to understand the customer's service requirements and to plan for them is tantamount. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Data Fusion at Different Levels
Authors: Marcos Faundez-Zanuy
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

This paper summarizes the main characteristics of data fusion at different levels (sensor, features, scores and decisions). Although it is presented in the framework of biometric applications it is general for all the pattern recognition applications because this presentation is focused in the main blocks of a general pattern recognition system. Thus, the application in mind will imply a different sensor, feature extractor, classifier and decision maker but data fusion will be performed in a similar way.
Drivers and Challenges of Wireless Solutions in Future Healthcare
Authors: Esko Alasaarela, Ravi Nemana, Steven DeMello
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

What do IT-oriented healthcare professionals believe to be the most attractive and credible wireless applications in healthcare? What do they think about the challenges? These questions were presented to 70 randomly selected participants at the HIMSS08 conference in February 2008 at Orlando, Florida, USA. The questions were formulated in a one-page query form and the data was uploaded into the ZEF-analysis tool (zefsolutions.com/en). Results show that on average the most attractive and credible application is wireless alarming and calling help. The second and third are mobile access to patient health records and vital signs monitoring. The results also show that process change challenges are remarkably more difficult than technical challenges. The process change from the doctors’ point of view is particularly severe. Among technical challenges usability of the mobile user interface is seen the most difficult. Security of patient data is not considered to be among the most severe challenges.
Locally application of cascade generalization for classification problems
Authors: S. Kotsiantis
Venue: Intelligent Decision Technologies (2008)

Numerous machine learning problems involve an investigation of relationships between features in heterogeneous datasets, where different classifier can be more appropriate for different regions. We propose a technique of localized cascade generalization of weak classifiers. This technique identifies local regions having similar characteristics and then uses the cascade generalization of local experts to describe the relationship between the data characteristics and the target class. We performed a comparison with other well known combining methods using weak classifiers as base-learners, on standard benchmark datasets and the proposed technique was more accurate.
Theory and Design of CNC Systems, 1st edition
Authors: Suk-Hwan Suh, Seong-Kyoon Kang, Dae-Hyuk Chung, Ian Stroud
Venue: Springer Series In Advanced Manufacturing (2008)

Computer Numerical Control (CNC) controllers are high value-added products counting for over 30% of the price of machine tools. The development of CNC technology depends on the integration of technologies from many different industries, and requires strategic long-term support. Theory and Design of CNC Systems covers the elements of control, the design of control systems, and modern open-architecture control systems. Topics covered include Numerical Control Kernel (NCK) design of CNC, Programmable Logic Control (PLC), and the Man-Machine Interface (MMI), as well as the major modules for the development of conversational programming methods. The concepts and primary elements of STEP-NC are also introduced. A collaboration of several authors with considerable experience in CNC development, education, and research, this highly focused textbook on the principles and development technologies of CNC controllers can also be used as a guide for those working on CNC development in industry.
Structural effects of R&D collaboration network on knowledge diffusion performance
Authors: Hyukjoon Kim, Yongtae Park
Venue: Expert Systems with Applications: An International Journal (2009)

With the advent of knowledge-based economy, the process and structure of knowledge diffusion mechanism in R&D collaboration networks have become more complex and dynamic. However, regardless of the complexity and importance of these R&D collaboration networks, previous empirical analyses have focused mainly on statics, which cannot be a sufficient basis to thoroughly explore knowledge diffusion in the R&D collaboration network. Furthermore, there has been little research done on the relationship between knowledge diffusion and the structure of an R&D collaboration network. Hence, this paper modeled knowledge diffusion based on social network analysis. It also investigated the impact of network structure on the performance of knowledge diffusion, focusing on average knowledge stock and knowledge variance. The results confirm that the small-world network is the most efficient and equitable structure toward effective knowledge diffusion.
What makes CS teachers change?: factors influencing CS teachers' adoption of curriculum innovations
Authors: Lijun Ni
Venue: ACM SIGCSE Bulletin (2009)

Computer Science (CS) education researchers hope their research has real impact on teaching practices. Developers of innovative curricula and tools for CS education want teachers to adopt their new approaches. What convinces a CS teacher to change and adopt something new--or not? This paper explores factors that influence CS teachers' adoption and change. We studied our workshop participants to determine factors influencing their decision on whether to adopt a new CS curriculum. The results from our study indicate that multiple factors, some surprising, influence CS teachers' adoption. Our findings suggest that teacher excitement in a new approach drives adoption, while more organizational or social issues inhibit adoption.