ppxscal/embedding_network huggingface dataset:
A knowledge-based framework for extracting components in agile systems development
Authors: Vijayan Sugumaran, Mohan Tanniru, Veda C. Storey
Venue: Information Technology and Management (2008)

Considerable strides have been made in the use of components in software development. Many proprietary enterprise resource planning (ERP) software environments use modular components to develop and customize "best practices" to meet a specific organizational need. In agile application development, many developers and users are asked to design systems in a short period of time. These applications may use components that are embedded in software repositories. The challenge then is how to select the right software components (data and procedures) to meet an application requirement. Although experienced developers may select and customize components to meet the needs of an application, such expertise may not be available to other applications. This paper presents a knowledge-based framework to select and customize software components and demonstrates its value in deriving quality specifications, even when the developers are relatively inexperienced.
A modular approach to language engineering using XML and inexpensive robots
Authors: Li Xu
Venue: Journal of Computing Sciences in Colleges (2008)

Language engineering --- the theory and practice of compiler and language processor design, has long been recognized as a core subject in Computer Science curricula. However, due to the scope and depth of the included topics, the limited time constraint, and the lack of suitable target system, educators often find it difficult to engage students and teach language engineering courses effectively. This paper presents a new modular approach to language engineering using XML and inexpensive robots. We teach language engineering in the context of the popular, inexpensive Scribbler robot, and use XML to externalize the compiler intermediate representation. The inexpensive robot device provides an affordable, yet realistic system platform to explore a broad set of compiler topics; the XML-based intermediate representation divides the compiler components into self-contained, independent modules; combined together, these two techniques give instructors a highly flexible and powerful framework to design course materials and teach language engineering subjects. We have designed the Chirp-Scribbler language to program the Scribbler robots. The Chirp-Scribbler compiler consists of lexer, parser, semantic verifier, code generator, and uses XML as shared intermediate representation. Each of the components can be built as a separate module and integrated to create the complete compiler. We describe the design of Chirp-Scribbler language, the XML-based module structure of Chirp-Scribbler compiler, integration with robots and supporting tools, and our teaching practice of using them to teach language translation basics in an undergraduate programming course.
Protecting IPTV against packet loss: Techniques and trade-offs
Authors: Natalie Degrande, Danny De Vleeschauwer, Koen Laevens
Venue: Bell Labs Technical Journal (2008)

Packet loss ratios that are harmless to the quality of data and Voice over Internet Protocol (VoIP) services may still seriously jeopardize that of Internet Protocol television (IPTV) services. In digital subscriber line (DSL)-based access networks, the last mile in particular suffers from packet loss, but other parts of the network may do so too. While on the last mile link, the packet loss is due to bit errors, in other parts of the network it is caused by buffers overflowing or the network experiencing (short) outages due to link or node failures. To retrieve lost packets, the application layer (AL) can use either a forward error correction (FEC) or a retransmission scheme. These schemes, when properly tuned, increase the quality of an IPTV service to an adequate level, at the expense of some overhead bit rate, extra latency, and possibly an increase in channel change time. This paper compares the performance of FEC schemes based on Reed-Solomon (RS) codes with that of retransmission schemes, all tuned to conform to the same maximum overhead bit rate allowed on the last mile link and on the feeder link, and their possible impact on the channel change time. We take into account two kinds of loss processes that can occur: isolated packet losses and burst packet losses. In almost all scenarios, retransmission outperforms FEC. &copy; 2008 Alcatel-Lucent.
A note on identifying generalized diagonally dominant matrices
Authors: Ke Wang, Chuanhua You
Venue: International Journal of Computer Mathematics (2007)

A successive method of descending degree has been presented by Guo, Liu and Jia in 2002 to judge whether or not a matrix is a generalized diagonally dominant matrix. In this paper, an alternative approach and comments on one of their examples are provided. Numerical examples are given to illustrate the algorithm processing.
Computational science as a twenty-first century discipline in the liberal arts
Authors: Joseph Brian Adams
Venue: Journal of Computing Sciences in Colleges (2008)

Computer science as a liberal arts discipline has a presence in most college curriculums. But as the field matures, more practitioners are recognizing a need for a more diverse approach to computational thinking. This paper presents a proposal for creating an interdisciplinary computational science major within the liberal arts.
ON DATA STRUCTURES FOR ASSOCIATION RULE DISCOVERY
Authors: Xiaowei Yan, Shichao Zhang, Chengqi Zhang
Venue: Applied Artificial Intelligence (2007)

Systematically we study data structures used to implement the algorithms of association rule mining, including hash tree, itemset tree, and FP-tree (frequent pattern tree). Further, we present a generalized FP-tree in an applied context. This assists in better understanding existing association-rule-mining strategies. In addition, we discuss and analyze experimentally the generalized k-FP-tree, and demonstrate that the generalized FP-tree reduces the computation costs significantly. This study will be useful to many association analysis tasks where one must provide really interesting rules and develop efficient algorithms for identifying association rules.
Security of Ad-hoc and Sensor Networks: Book Edition of Journal of Computer Security
Authors: Peng Ning, Wenliang Du
Venue:  (2007)

Ad hoc and sensor networks present unique challenges in the area of security given their lack of a secure infrastructure, dynamic topology and severe resource restraints. The research presented in the six articles comprising this volume cover a variety of topics including trust establishment in Mobile Ad-Hoc Networks (MANETs), security of vehicular ad-hoc networks, secure aggregation in sensor networks, detecting misbehaviors in ad-hoc networks, secure group communication, and distributed signature protocols for ad-hoc networks. "Ad-hoc and sensor networks will become increasingly more important, especially in the areas of military defense and disaster recovery," said Dr. Ning, co-editor. "Security is a big concern in these networks, so researchers are working on developing security systems that provide multiple lines of defense, including detection of physical attacks and compromised nodes." Examples of ad-hoc and sensor networks that are currently being developed are vehicular networks that allow the transmission of traffic information, networks that allow tanks and fighter jets to communicate directly on the battlefield and sensor networks that use multiple sensor nodes to monitor an environment.
Super-fine ink-jet printing: toward the minimal manufacturing system
Authors: Kazuhiro Murata, Junichi Matsumoto, Akira Tezuka, Yorishige Matsuba, Hiroshi Yokoyama
Venue: Microsystem Technologies (2005)

We have developed an ink-jet system which allows arrangements of dots with a submicron minimum size. Using an ultra-fine silver paste, we achieved the direct print of metallic wires of only a few micrometers in width without any pre-patterning treatment of the substrate, hydrophobic/hydrophilic patterning, bank patterning etc. We also propose an application, such as direct printing of ultra-fine redistribution wiring for a build-up board and/or package. Since all of these processes can be carried out at atmospheric pressure on the desktop without special treatment of the substrate. The direct fabrication process using ink-jet printing can be expected to be a powerful tool for both nanotechnology research and applications such as micro electronics, etc.
Policy expression and checking in XACML, WS-Policies, and the jABC
Authors: Martin Karusseit, Tiziana Margaria, Holger Willebrandt
Venue: Proceedings of the 2008 workshop on Testing, analysis, and verification of web services and applications (2008)

Web-based access to sensitive and confidential data is realized today via different approaches, using a variety of methods to specify and combine access control policies. In an optic of change management and evolution, a structured and flexible model is needed to handle dynamicity, particularly when handling rights in systems with many users which hold different roles. Furthermore the validation of security constraints is an important key to warrant the reliability of control mechanisms. This paper compares the temporal logic-based approach for modeling access control used by the jABC framework with two popular XML-based description languages (XACML and WS-Policy), which are quasi-standards for policy expression in Web applications. Its usage is illustrated here on the example of the web-based Online Conference Service (OCS). The respective functionalities are described and examined in consideration of their ability to validate and enforce the needed policies.
Ubiquitous Service Regulation Based on Dynamic Rules
Authors: José Viterbo F., Markus Endler, Jean-Pierre Briot
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

Ubiquitous computing systems can be regarded as open systems where heterogeneous and previously unknown entities may spontaneously interact, due to intrinsic mobility of users and their devices. In this highly dynamic and heterogeneous scenario, applications must be capable of accessing the appropriate instances of the required services in each visited network or region. Some services, however, must be made available only to users and applications that fulfill some conditions. In ubiquitous systems the interaction between client and server applications happens in a physical space, involving human and artificial agents that act under social and administrative rules. We propose the integration of context-awareness with a social regulation approach to control the interaction of users and their applications in such environments. This has the advantage that access policies and rights can be defined and monitored independently of the applications for the ubiquitous system.
On the Security of an Identity-Based Aggregate Signature Scheme
Authors: Wun-She Yap, Swee-Huay Heng, Bok-Min Goi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In ACISP 2006, Paterson and Schuldt proposed a provably secure identity-based signature scheme. Not long after that, the same authors claimed that their proposed scheme above also allows a form of aggregation in which the multiple signatures from the different signers on a single message can be aggregated into a single signature with a more efficient representation than the original set of signatures. The proposed identity-based signature scheme is provably secure in the standard model. In this paper, weshow that the Paterson and Schuldt identity-based signature scheme does not support aggregation since the resulting identity-based aggregate signature scheme is vulnerable to both the insider and outsider attacks.
The power of team exploration: two robots can learn unlabeled directed graphs
Authors: M. A. Bender
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new type of homing sequence for two robots which helps the robots recognize certain previously-seen nodes. We then present an algorithm in which the robots learn the graph and the homing sequence simultaneously by wandering actively through the graph. Unlike most previous learning results using homing sequences, our algorithm does not require a teacher to provide counterexamples. Furthermore, the algorithm can use efficiently any additional information available that distinguishes nodes. We also present an algorithm in which the robots learn by taking random walks. The rate at which a random walk converges to the stationary distribution is characterized by the conductance of the graph. Our random-walk algorithm learns in expected time polynomial in n and in the inverse of the conductance and is more efficient than the homing-sequence algorithm for high-conductance graphs.
A story-centered, learn-by-doing approach to software engineering education
Authors: Ray Bareiss, Martin Griss
Venue: ACM SIGCSE Bulletin (2008)

Carnegie Mellon's West Coast Campus offers an MS in Software Engineering, with technical and development management tracks, targeted at working software professionals in Silicon Valley. We believe the program to be unique in that it is entirely team-based and project-centered. Students learn by doing as they are coached just in time by faculty in the context of authentic projects, and they are evaluated based on what they produce. Student satisfaction is high: 92% believe that the program has given them a competitive advantage with respect to their professional peers, and their promotion and salary histories bear out this belief.
An Application-Oriented Framework for Wireless Sensor Network Key Establishment
Authors: Keith M. Martin, Maura Paterson
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

The term wireless sensor network is applied broadly to a range of significantly different networking environments. On the other hand there exists a substantial body of research on key establishment in wireless sensor networks, much of which does not pay heed to the variety of different application requirements. We set out a simple framework for classifying wireless sensor networks in terms of those properties that directly influence key distribution requirements. We fit a number of existing schemes within this framework and use this process to identify areas which require further attention from key management architects.
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
Authors: F. Alvarez, J. Bolte, J. Munier
Venue: Foundations of Computational Mathematics (2008)

We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for theexistence and local uniqueness of the solution, and for the local convergence of a Riemannian version of Newton's method. Our approach relies on Kantorovich's majorant principle: under suitable conditions, we construct an auxiliary scalar equation &#x03c6;(r) = 0 which dominates the original equation X(p) = 0 in the sense that the Riemannian-Newton method for the latter inherits several features of the real Newton method applied to the former. The majorant &#x03c6; is derived from an adequate radial parametrization of a Lipschitz-type continuity property of the covariant derivative of X, a technique inspired by the previous work of Zabrejko and Nguen on Newton's method in Banach spaces. We show how different specializations of the main result recover Riemannian versions of Kantorovich's theorem and Smale's &#x03b1;-theorem, and, at least partially, the Euclidean self-concordant theory of Nesterov and Nemirovskii. In the specific case of analytic vector fields, we improve recent developments inthis area by Dedieu et al. (IMA J. Numer. Anal., Vol. 23, 2003, pp. 395-419). Some Riemannian techniques used here were previously introduced by Ferreira and Svaiter (J. Complexity, Vol. 18, 2002, pp. 304-329) in the context of Kantorovich's theorem for vector fields with Lipschitz continuous covariant derivatives.
Nature Reserve Selection Problem: A Tight Approximation Algorithm
Authors: Magnus Bordewich, Charles Semple
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set of regions to conserve so that the phylogenetic diversity of the set of species contained within those regions is maximized. Recently, it was shown in a paper by Moulton {\\em et al.} that this problem is NP-hard. In this paper, we establish a tight polynomial-time approximation algorithm for the Nature Reserve Section Problem. Furthermore, we resolve a question on the computational complexity of a related problem left open in Moulton {\\em et al.}
Copy coalescing by graph recoloring
Authors: Sebastian Hack, Gerhard Goos
Venue: ACM SIGPLAN Notices (2008)

Register allocation is always a trade-off between live-range splitting and coalescing. Live-range splitting generally leads to less spilling at the cost of inserting shuffle code. Coalescing removes shuffle code while potentially raising the register demand and causing spilling. Recent research showed that the live-range splitting of the SSA form's Æ-functions leads to chordal interference graphs. This improves upon two long-standing inconveniences of graph coloring register allocation: First, chordal graphs are optimally colorable in quadratic time. Second, the number of colors needed to color the graph is equal to the maximal register pressure in the program. However, the inserted shuffle code incurred by the Æ-functions can slow down the program severely. Hence, to make such an approach work in practice, a coalescing technique is needed that removes most of the shuffle code without causing further spilling. In this paper, we present a coalescing technique designed for, but not limited to, SSA-form register allocation. We exploit that a valid coloring can be easily obtained by an SSA-based register allocator. This initial coloring is then improved by recoloring the interference graph and assigning shuffle-code related nodes the same color. Thereby, we always keep the coloring of the graph valid. Hence, the coalescing is safe, i. e. no spill code will be caused by coalescing. Comparing to iterated register coalescing, the state of the art in safe coalescing, our method is able to remove 22.5% of the costs and 44.3% of the copies iterated coalescing left over. The best solution possible, found by a colaescer using integer linear programming (ILP), was 35.9% of the costs and 51.9% of the copies iterated coalescing left over. The runtime of programs compiled with our heuristic matches that of the programs compiled with the ILP technique.
Application of support vector machines on prediction of repeat visitation
Authors: Rong-Chang Chen, Hsin-Lan Lin
Venue: Proceedings of the 5th WSEAS International Conference on Computational Intelligence, Man-Machine Systems and Cybernetics (2006)

Since the tourism earnings became a major part of foreign exchange in many countries, the tourism market has become much more competitive. In addition, tourism has been highly valued recently all over the world, and consequently, tourism market has been developed very fast. After quick development, it gradually becomes a saturated marketplace. Previous studies indicated that maintaining existing customers costs less than exploring new customers. Repeat visitors can not only reduce the cost but gain the long-term profits for the destinations. Thus, a method that can accurately predict repeat visitation intention is greatly needed. In this paper, we apply Support Vector Machines (SVM) to predict the repeat visitation. To evaluate the effectiveness of SVM, data are collected from tourists who visited Sun Moon Lake, which is the most famous destination in Taiwan and is the only place in Taiwan among the 50 best places to visit in China. Factor analysis (FA) is also employed to reduce variables and combined FA/SVM results are compared with those predicted from SVM only. The experimental results show that SVM can provide high accuracy rates than FA/SVM. Also, some SVM ensemble techniques can give higher true negative rates.
Utilizing vector space models for user modeling within e-learning environments
Authors: Eleni Mangina, John Kilbride
Venue: Computers Education (2008)

User modeling has been found to enhance the effectiveness and/or usability of software systems through the representation of certain properties of a particular user. This paper presents the research and the results of the development of a user modeling system for the implementation of student models within e-learning environments, utilizing vector space models. The central challenge has been to exploit the possibilities of IUI research on user models without compromising the performance of the overall system. The research described in this paper has aimed to augment the user interface of an existing e-learning environment with relevant aspects from the domain of intelligent user interfaces, through developing a student modeling component.
Code design for multihop wireless relay networks
Authors: Frédé;rique Oggier, Babak Hassibi
Venue: EURASIP Journal on Advances in Signal Processing (2008)

We consider a wireless relay network, where a transmitter node communicates with a receiver node with the help of relay nodes. Most coding strategies considered so far assume that the relay nodes are used for one hop. We address the problem of code design when relay nodes may be used for more than one hop. We consider as a protocol a more elaborated version of amplify-and-forward, called distributed space-time coding, where the relay nodes multiply their received signal with a unitary matrix, in such a way that the receiver senses a space-time code. We first show that in this scenario, as expected, the so-called full-diversity condition holds, namely, the codebook of distributed space-time codewords has to be designed such that the difference of any two distinct codewords is full rank. We then compute the diversity of the channel, and show that it is given by the minimum number of relay nodes among the hops. We finally give a systematic way of building fully diverse codebooks and provide simulation results for their performance.
A Content-Centric Development Process Model
Authors: Pablo Moreno-Ger, Iván Martínez-Ortiz, José Luis Sierra, Baltasar Fernández-Manjón
Venue: Computer (2008)

Working from the belief that when content is king, content experts should lead, a storyboard-driven approach provides a sound methodology for developing educational games that helps ensure that no good storyboard becomes a bad game.