ppxscal/embedding_network huggingface dataset:
Efficient Multiclass ROC Approximation by Decomposition via Confusion Matrix Perturbation Analysis
Authors: Thomas C. W. Landgrebe, Robert P. W. Duin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

ROC analysis has become a standard tool in the design and evaluation of 2-class classification problems. It allows for an analysis that incorporates all possible priors, costs, and operating points, which is important in many real problems, where conditions are often nonideal. Extending this to the multiclass case is attractive, conferring the benefits of ROC analysis to a multitude of new problems. Even though ROC analysis does extend theoretically to the multiclass case, the exponential computational complexity as a function of the number of classes is restrictive. In this paper we show that the multiclass ROC can often be simplified considerably because some ROC dimensions are independent of each other. We present an algorithm that analyses interactions between various ROC dimensions, identifying independent classes, and groups of interacting classes, allowing the ROC to be decomposed. The resultant decomposed ROC hypersurface can be interrogated in a similar fashion to the ideal case, allowing for approaches such as cost-sensitive and Neyman-Pearson optimisation, as well as the volume under the ROC. An extensive bouquet of examples and experiments demonstrates the potential of this methodology.
Breaking a Smart Card based Secure Password Authentication Scheme
Authors: Eun-Jun Yoon, Kee-Young Yoo
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Recently, Wang-Chang proposed a password authentication scheme for implementing a remote access network system whose security rests in part on the difficulty of factoring a large number and discrete logarithm problem. This paper presents that Wang-Chang's smart card based password authentication scheme is insecure against two impersonation attacks and the off-line password guessing attack.
Accelerating Real-Time String Searching with Multicore Processors
Authors: Oreste Villa, Daniele Paolo Scarpazza, Fabrizio Petrini
Venue: Computer (2008)

String searching is at the core of tools used to search, filter, and protect data, but this has become increasingly difficult to do in real time as communication speed grows. The authors present an optimization strategy for a popular algorithm that fully exploits the IBM Cell Broadband Engine architecture to perform exact string matching against large dictionaries and also offer various solutions to alleviate memory congestion.
Security Research on WiMAX with Neural Cryptography
Authors: Dong Hu, YuYan Wang
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

The paper gives an overview of the security issue on WiMAX, which is a new and hot research point for telecommunication and computer scientist. In the IEEE 802.11 technology, security was added later while IEEE 802.16 considered the security issues during the design of the protocol. However, security mechanism of the IEEE 802.16 still remains a question. WiMAX is relatively a new technology and does not deployed widely to justify the evidence of threats, risk and vulnerability in real situations. We also discuss how to apply neural cryptography at WiMAX application in the end.
Software, Data and Modelling News: Soil organic carbon content indicators and web mapping applications
Authors: Panos Panagos, Marc Van Liedekerke, Luca Montanarella, Robert J. A. Jones
Venue: Environmental Modelling Software (2008)

Distributing geographic information via the Internet allows interoperability with similar information and real-time integration of data from around the world. The software developed allows the users to exchange, integrate, and analyze data in new ways. Users can combine various environmental indicators (organic carbon content) and information accessed via the Internet with their local data for display, query, and analysis. In order to guarantee interoperability, the developed services are based on international standards, as promoted by the INSPIRE initiative.
The IS Organization of the Future: The IT Talent Challenge
Authors: Jerry Luftman, Rajkumar M. Kempaiah
Venue: Information Systems Management (2007)

Current projections are that the demands for IS workers in the U.S. are on the verge of exceeding the supply, and IS managers are reporting increased concerns for the recruitment and retention of IT staff. The authors argue that industry and universities need to take actions today to address the projected shortfalls, and offer some guidelines for recruiting and retaining IT professionals.
Supporting Acquisition of Basic Skills
Authors: Neville Holmes
Venue: Computer (2008)

Early education needs the computing profession's help.
AntTrust: A Novel Ant Routing Protocol for Wireless Ad-hoc Network Based on Trust between Nodes
Authors: Carlos Aguilar Melchor, Boussad Ait Salem, Philippe Gaborit, Karim Tamine
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

A wireless ad-hoc network is a network which does not use any infrastructure such as access points or base station. Instead, the mobile nodes forward packets to each others, allowing communication among nodes outside wireless transmission range. In this dynamic network, each node is considered as a mobile router but in an energy-conserving manner. This fact makes node an active element in the network which is able of the best and of the worst. Actually, a malicious node can easily disrupt the proper functioning of the routing by simply refusing to forward routing message (misbehavior node), inject the wrong routing packets, modifying others, etc. In this paper, we propose a new routing protocol for wireless ad-hoc network based on multi-agent systems and particularly on ant behavior. The novelty of our protocol relies in the fact that, apparently for the first time, a protocol combines at the same time routing on one side and trust level and reputation between nodes on the other side. This combination permits to increase the security of route establishment. More generally, this protocol opens the door to the use of different agents for obtaining different mixed functionalities, routing and trust level in this paper but also other functionalities like key-distribution.
Model-Driven Engineering with Large Models in the Context of Product Line Engineering with IBYKUS AP
Authors: Steffen Skatulla, Detlef Hornbostel, Christian Erfurth, Wilhelm Rossak
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

In software engineering practice models of software systems become more and more important and play a decisive role. Different model-driven approaches are followed by enterprises to achieve more efficient development techniques and higher flexibility. Practice has also shown that models reach a size and complexity that is hard to handle. Over the last years, IBYKUS, a midsized software vendor with focus on product line engineering in the domain of business, administration and governmental processes, has put an effort into the development environment IBYKUS AP which supports Model-Driven Engineering. This paper describes the state of the used techniques on a conceptual level in the first part. The idea of Incremental Modeling and editable Model Views is presented in the second part accompanied with research questions to be tackled in future.
Information flow security of multi-threaded distributed programs
Authors: Riccardo Focardi, Matteo Centenaro
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

We study noninterference in the setting of multi-threaded distributed programs in which threads share local memories and multi-threaded processes communicate over an insecure network using encryption primitives to secure messages. We extend a simple imperative language with cryptographic operations which are modelled as special expressions respecting the Dolev-Yao assumptions. Then, we adapt to our setting the notion of patterns proposed by Abadi and Rogaway for modelling the equivalence of cryptographic expressions. Based on this notion, we naturally obtain a definition of strongly secure programs corresponding to the one proposed by Sabelfeld and Sands for programs without cryptography. This is, to the best of our knowledge, the first definition of noninterference in a multi-threaded distributed setting, with insecure channels and cryptography. We prove compositionality of secure programs and we adapt the type system of Sabelfeld and Sands to our setting, proving its correctness.
Software Development Rhythms: Harmonizing Agile Practices for Synergy
Authors: Kim M. Lui, Keith C. Chan
Venue:  (2008)

An accessible, innovative perspective on using the flexibility of agile practices to increase software quality and profitability When agile approaches in your organization don't work as expected or you feel caught in the choice between agility and discipline, it is time to stop and think about software development rhythms! Agile software development is a popular development process that continues to reshape philosophies on the connections between disciplined processes and agile practices. In Software Development Rhythms, authors Lui and Chan explain how adopting one practice and combining it with another builds upon the flexibility of agile practices to create a type of "synergy" defined as software development rhythms. The authors demonstrate how these rhythms can be harmonized to achieve synergies, making them stronger together than they would be apart. Software Development Rhythms provides programmers with a powerful metaphor for resolving some classic software management controversies and dealing with some common difficulties in agile software management. Software Development Rhythms is divided into two parts and covers: Essentials - provides an introduction to software development rhythms; explores the programmer's unconscious mind at work on software methodology; discusses the characteristics of the iterative cycle and open source software development; and introduces the topic of agile values and agile practices Rhythms - compares plagiarism programming with cut-paste programming; provides an in-depth discussion of different ways to approach collaborative programming; demonstrates how to combine and harmonize these practices so they can be applied to common software management problems such as motivating programmers, discovering solution patterns, managing software teams, and rescuing troubled IT projects; and takes a comprehensive look at Scrum, CMMI, Just-In-Time, Lean Software Development, and Test-Driven Development from a software development rhythm perspective Abundantly illustrated with informative graphics and amusing cartoons, Software Development Rhythms is a comprehensive and thought-provoking introduction to some of the most advanced concepts in current software management. Written in a refreshingly easy-to-read style and filled with interesting anecdotes, simulation exercises, and case studies, Software Development Rhythms is suitable for the practitioner and graduate student alike. It offers readers practical guidance on how to take the themes and concepts presented in this book back to their own projects to harmonize their software practices and release the synergies of their own teams.
Numerical solutions of some nonlinear evolution equations by Chebyshev spectral collocation methods
Authors: A. H. Khater, R. S. Temsah
Venue: International Journal of Computer Mathematics (2007)

Chebyshev spectral collocation methods (known as El-Gendi methods-as described by El-Gendi in 1969 and Mihaila and Mihaila in 2002) are presented to deal with some nonlinear evolution equations including the Korteweg-de Vries (KdV), the modified KdV, the mixed KdV and modified KdV, and the generalized fifth-order KdV equations, which include as special cases some well-known equations. The problem is reduced to a system of ordinary differential equations that are solved by combinations of backward differential formulas and appropriate explicit schemes (implicit-explicit BDF methods-as described by Akrivis and Smyrlis in 2004). Good numerical results have been obtained and compared with the exact solutions.
Complex event processing in enterprise information systems based on RFID
Authors: C. Zang, Y. Fan
Venue: Enterprise Information Systems (2007)

Enterprises have to be increasingly agile and responsive to address the challenges posed by the fast moving market. With the software architecture evolving into service-oriented architecture (SOA), and the adoption of radio frequency identification (RFID), event processing can fit well in enterprise information systems in terms of facilitation of event aggregation into high level actionable information, and event response to improve the responsiveness. To make it more applicable, the architecture of event processing in enterprise information systems is proposed; event meta model and context serve as the solid basis for event processing; the rules, operators and keys of complex event processing are defined. Especially, workflow model is firstly used to extract complex event pattern. We have implemented the event processing mechanism in enterprise information systems based on RFID, including the architecture, data structures, optimization strategies and algorithm. The performance evaluations show that the method is effective in terms of scalability and the capability of event processing. Complex event processing can improve operational performance and discover more actionable information, which is justified by application. Finally, lessons learned from the application are presented.
Tissue-level failure accumulation in vertebral cancellous bone: A theoretical model
Authors: Noa Slomka, Idit Diamant, Amit Gefen
Venue: Technology and Health Care (2008)

Vertebral compression fractures are a potentially severe injury, which is characteristic to osteoporotic elderly. Despite being a significant healthcare problem, the etiology of compression fractures is not fully understood, and there are no biomechanical models in the literature that describe the development of these fractures based on cancellous bone failure accumulation. The objective of this study was therefore to develop a computational model of tissue-level failure accumulation in vertebral cancellous bone, which eventually leads to compression fractures. The model predicts the accumulated percentage of broken trabeculae &delta; in a vertebral region of interest (ROI) over 60 years, by employing Euler's theory for elastic buckling. The accumulated failure &delta; is calculated as function of the daily activity characteristics and rate of annual bone loss (RABL) with aging. An RABL of unity represents the normal bone loss attributed to aging per se, whereas RABL>1 is assumed to represent pathological bone metabolism such as osteoporosis. Simulations were conducted for a range of RABLs, to determine the effect of changes in bone metabolism on the accumulation of bone failure. Results showed that bone failure rapidly increased with RABL. Generally, trabecular failure was shown to become more severe for RABL>4. Total failure was exhibited at RABL=7.5 for the central ROI, and at RABL=8.5 for the sub-endplate ROI. We concluded that vertebral compression fractures advance monotonically between the age of 50-55 years and 70 years, and may accelerate thereafter if RABL is high (&sim;8). Additionally, the model identified weight lifting as the action that most dramatically accelerated the destruction of osteoporotic spinal cancellous bone. The present biomechanical model is useful for understanding the etiology of compression fractures, and potentially, depending on further experimental characterization of RABL, for considering the effects of medications that influence bone metabolism on patient prognosis.
Device Middleware for Heterogeneous Access to Java Services
Authors: Andre Elia Assad, Nelson Souto Rosa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The mobile phone environment is today highly concerned about security threats of buggy, malicious or viruses’ code that an end user could download and crash the phone. To prevent this, mobile phones applications operates a virtual sandbox that runs each application in a tightly constrained environment separated from each other. This work proposes a Device Middleware, namely D-Mid, which leverages an existent device framework to provide an agonistic application model that supports heterogeneous access to the middleware with a minimal impact on performance. Besides mobile devices are likely to have scarce resources, such as memory and CPU clock, so D-Mid provides an inversion of control mechanism that targets a minimal execution environment.
Interpolation of sparse rational functions without knowing bounds on exponents
Authors: D. Y. Grigoriev
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The authors present the first algorithm for the (black box) interpolation of t-sparse, n-variate, rational functions without knowing bounds on exponents of their sparse representation, with the number of queries independent of exponents. In fact, the algorithm uses O(nt/sup t/) queries to the black box, and it can be implemented for a fixed t in a polynomially bounded storage (or polynomial parallel time).
XArch: archiving scientific and reference data
Authors: Heiko Müller, Peter Buneman, Ioannis Koltsidas
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for maintaining, populating, and querying archives of hierarchical data. XArch is based on a nested merge approach that efficiently stores multiple versions of hierarchical data in a compact archive. By merging elements into one data structure, any specific version is retrievable from the archive in a single pass over the data and efficient tracking of object history is possible. XArch implements this approach and extends it in two important ways. First, in order to merge large hierarchical data sets, elements need to be sorted according to their key values. We developed an efficient algorithm for sorting hierarchical data in secondary storage and modified the nested merge algorithm accordingly. Second, we designed and implemented a declarative query language that enables one both to view data from particular versions and to track the history of objects. We demonstrate this using both molecular biology and demographic reference data as examples.
Wyner-Ziv coding of video with unsupervised motion vector learning
Authors: David Varodayan, David Chen, Markus Flierl, Bernd Girod
Venue: Image Communication (2008)

Distributed source coding theory has long promised a new method of encoding video that is much lower in complexity than conventional methods. In the distributed framework, the decoder is tasked with exploiting the redundancy of the video signal. Among the difficulties in realizing a practical codec has been the problem of motion estimation at the decoder. In this paper, we propose a technique for unsupervised learning of forward motion vectors during the decoding of a frame with reference to its previous reconstructed frame. The technique, described for both pixel-domain and transform-domain coding, is an instance of the expectation maximization algorithm. The performance of our transform-domain motion learning video codec improves as GOP size grows. It is better than using motion-compensated temporal interpolation by 0.5dB when GOP size is 2, and by even more when GOP size is larger. It performs within about 0.25dB of a codec that knows the motion vectors through an oracle, but is hundreds of orders of magnitude less complex than a corresponding brute-force decoder motion search approach would be.
Patterns of innovation in service industries
Authors: I. Miles
Venue: IBM Systems Journal (2008)

The diversity of service activities means that service innovations and innovation processes take various forms. In this paper, we use input/output and other data to depict how service industries vary in such areas as products, markets, work organization, and technological characteristics-most being very distinctive from primary industries (i.e., extractive industries such as agriculture, fisheries, forestry, mining, petroleum, quarrying, and the like) and secondary industries (i.e., manufacturing, construction, and utilities). Innovation survey data indicates that some service organizations behave very much like high-technology manufacturing. This is especially true of technology-based, knowledge-intensive business services (T-KIBS). Distinctive innovation patterns are displayed by KIBS based more on professional knowledge and by large network-based service firms, while many smaller service firms conform to a supplier-driven pattern. Only a small segment of service innovation conforms to the typical manufacturing-based model, in which innovation is largely organized and led by formal research and development (R&D) departments and production engineering. Project management and on-the-job innovation are common ways of organizing service innovation. Innovation policy and management have to be much more than R&D policy and R&D management: This is recognized by some national governments and in some business schools, but the full implications of a service-dominant logic are still rarely found.
Privacy Preserving Collaborative Social Network
Authors: Gary Blosser, Justin Zhan
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

There are many kinds of social networks in existence. To our best knowledge, there is no effort on how to construct a social network jointly from different parties. Thus, there is a need for a proper protocol to both make a collaborative social network feasible between different parties and ensure privacy. We propose a series of protocols to create and interact with a privacy preserving collaborative social networks and evaluate their potential. The protocols are implemented, tested and evaluated.
Efficient d-multigrid preconditioners for sparse-grid solution of high-dimensional partial differential equations
Authors: H. Bin Zubair, C. C. W. Leentvaar, C. W. Oosterlee
Venue: International Journal of Computer Mathematics (2007)

Fast and efficient solution techniques are developed for high-dimensional parabolic partial differential equations (PDEs). In this paper we present a robust solver based on the Krylov subspace method Bi-CGSTAB combined with a powerful, and efficient, multigrid preconditioner. Instead of developing the perfect multigrid method, as a stand-alone solver for a single problem discretized on a certain grid, we aim for a method that converges well for a wide class of discrete problems arising from discretization on various anisotropic grids. This is exactly what we encounter during a sparse grid computation of a high-dimensional problem. Different multigrid components are discussed and presented with operator construction formulae. An option-pricing application is focused and presented with results computed with this method.