ppxscal/embedding_network huggingface dataset:
A framework for research into business-IT alignment: a cognitive emphasis
Authors: Felix B. Tan, R. Brent Gallupe
Venue: Business strategies for information technology management (2003)

Contemporary empirical research into business-IT alignment is almost entirely behavioral in its focus. It explores the alignment issue by examining the ways in which organisations behave. In contrast, few studies have attempted to investigate the issue from a cognitive perspective. Managerial cognition is an area of growing interest and importance in strategic management. This chapter proposes a framework to guide research into business-IT alignment. It reviews alignment research and also considers some of the cognitive theories and methodologies that may be appropriate for the study of alignment.
A computational framework for the 3D structure determination of viruses with unknown symmetry
Authors: Dan C. Marinescu, Yongchang Ji
Venue: Journal of Parallel and Distributed Computing (2003)

The protein shell of all virus structures resolved to this date exhibit some form of symmetry, most of them are spherical viruses with icosahedral symmetry; the study of viruses whose symmetry is not known, of structures which do not exhibit any symmetry, as well as the study of the genetic material of a virus are considerably more challenging. Increasing the resolution of the structure determination and solving structures with no symmetry represents a quantum leap in virus structure determination based upon electron microscopy. Computing is a major component of the structure determination process. Nowadays it is not feasible to increase the resolution of the structure determination of large macromolecules like viruses or to solve structures with no symmetry without novel parallel algorithms and environments enabling structural biologists to use parallel systems, clusters of workstations, or providing access to grid computing.
Role-based authorization in decentralized health care environments
Authors: Gail-Joon Ahn, Badrinath Mohan
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The formation of a distributed system is based on a collection of distributed components and it requires the ability for components to exchange syntactically well-formed messages. To simplify network programming for such interactions and to realize security services for those components, we need a component-based software architecture that enables software components to communicate directly over a network in a reliable and efficient manner. One of those models is Distributed Component Object Model (DCOM) which is used for interacting with distributed components within the local intranet. In this paper, we overview an aspect of DCOM concerning software architecture and access control. And we describe the concept of role-based access control (RBAC) which began with multi-user and multi-application on-line systems pioneered in the 1970s. Also we investigate how we can enforce the role-based access control as a security provider within the critical environment such as health care industry accessing distributed components legitimately. We demonstrate the feasibility of our approach through a proof-of-concept prototype implementation.
Glue-logic partitioning for floorplans with a rectilinear datapath
Authors: Allen C. H. Wu, Daniel D. Gajski
Venue: Proceedings of the conference on European design automation (1991)

This paper describes a novel glue-logic partitioning algorithm for floorplan generation in a constrainted rectilinear area. This algorithm dissects the layout area into area blocks according to the given module aspect ratio. The algorithm estimates the transistor capacity for each area block, and then uses a seed-based multiway partitioning strategy to assign glue-logic components into area blocks. The algorithm runs iteratively and selects the partition with the minimum total area as the final floorplan. The examples demonstrate the algorithm's suitability for top-down hierarchical physical design.
KPSpotter: a flexible information gain-based keyphrase extraction system
Authors: Min Song, Il-Yeol Song, Xiaohua Hu
Venue: Proceedings of the 5th ACM international workshop on Web information and data management (2003)

To tackle the issue of information overload, we present an Information Gain-based KeyPhrase Extraction System, called KPSpotter. KPSpotter is a flexible web-enabled keyphrase extraction system, capable of processing various formats of input data, including web data, and generating the extraction model as well as the list of keyphrases in XML. In KPSpotter, the following two features were selected for training and extracting keyphrases: 1) TF*IDF and 2) Distance from First Occurrence. Input training and testing collections were processed in three stages: 1) Data Cleaning, 2) Data Tokenizing, and 3) Data Discretizing. To measure the system performance, the keyphrases extracted by KPSpotter are compared with the ones that the authors assigned. Our experiments show that the performance of KPSpotter was evaluated to be equivalent to KEA, a well-known keyphrase extraction system. KPSpotter, however, is differentiated from other extraction systems in the followings: First, KPSpotter employs a new keyphrase extraction technique that combines the Information Gain data mining measure and several Natural Language Processing techniques such as stemming and case-folding. Second, KPSpotter is able to process various types of input data such as XML, HTML, and unstructured text data and generate XML output. Third, the user can provide input data and execute KPSpotter through the Internet. Fourth, for efficiency and performance reason, KPSpotter stores candidate keyphrases and its related information such as frequency and stemmed form into an embedded database management system.
Enriched content: concept, architecture, implementation, and applications
Authors: Ken Perlin
Venue:  (2003)

Since the debut of the World Wide Web, Web users have been facing the following problems: Extended semantics. When we read or study a digital documents, be it a web-page or not, we often run into contexts in which we have stop to start a search on these context. It causes interruption and costs time. Reverse hyperlink. When we visit a web page, we might be curious about what other hyperlinks point to the visited page. These links would most likely be of related interests. Can we get the &ldquo;real time&rdquo; information about what other pages are pointing to this page? Version control. Many of us have been frustrated and even annoyed when the hyperlink that we follow gives us a &ldquo;404 not found&rdquo; or that the retrieved web-page whose content is entirely different from the one we have bookmarked. Could we also have access to the past versions even if the hyperlink has been removed or the content has been changed? Composition assistant. Writing is not an easy task. We labor to structure a body of text, sort out ideas, find materials, and digest information. We wish there is an automated service that can associate the context we have produced with other contents (on the Web) and bring these web contents to us for reference. In this thesis, we provide an unified framework and architecture, named enriched content, to resolve the above problems. We apply the architecture and show how the enriched content can be used in each application. We demonstrate that this method can be a new way of writing add-on functions for various document applications without having to write individual plug-in for each application or to re-write each application. We also briefly discuss possible future development.
Techniques and Tools for Automated Safety Analysis & Decision Support for Redundancy Allocation in Automotive Systems
Authors: Yiannis Papadopoulos, Christian Grante
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Recent growth in the area of model-based productdevelopment in the automotive industry means that systemmodels in electronic form become increasingly moreavailable as they progressively find more applications inthe course of the development process.Such models,Matlab-Simulink models for example, are currently usedfor simulation, fault injection and source codegeneration.In our work, the utility of such models ispushed further into a hitherto unexplored area that ofsafety and reliability analysis.We propose a design process in which techniques forsemi-automatic safety and reliability analysis of suchmodels are combined with multi-criteria optimisationtechniques to assist the gradual development of designsthat can meet set reliability and safety targets withinpragmatic cost constraints.The proposed process relieson tools to automate some aspects of the design that webelieve could be automated and thus simplified withoutany loss of the creative input brought in the process bydesigners.
Multi-object video rate control
Authors: Nadjib Achir, Guy Pujolle
Venue: Network control and engineering for Qos, security and mobility II (2003)

The ISO MPEG-4 standard enhances the traditional concept of video sequence and proposes a synchronized set of visual objects organized in a flexible way. The video delivery according to this new paradigm results in a challenging new bit-allocation, and rate-control mechanisms, which has to satisfy complex application requirements. In this paper, we propose a rate control mechanism, which optimally selects the sending rate for each object constituting the video scene. This rate allocation is done in agreement with the particularity of the multi-object video coding schemes. Thus, in our proposal, we allocate more bandwidth to the object having the most impact on the video quality. To perform this optimal allocation, we use the dynamic programming approach to select the optimal amount of bandwidth to be allocated to each object. The obtained results show the importance of this consideration in multi-object video delivery. We demonstrate that the video quality can be significantly increased.
A Tool for Injecting SEU-Like Faults into the Configuration Control Mechanism of Xilinx Virtex FPGAs
Authors: M. Alderighi, F. Casini, S. D'Angelo, M. Mancini, A. Marmo, S. Pastore, G. R. Sechi
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

A fault injection tool for Virtex FPGAs based on the fault emulation technique is presented. It allows to inject faults in the configuration control mechanism differently from the tools developed so far, which address only configuration memory cells and user registers. This permits a more realistic and complete study of device behaviour, especially in those applications in which the system operating in a harsh environment undergoes frequent reconfigurations. Injection is performed by modifying the configuration bitstream while this is loaded into the device, without using standard synthesis tools or available commercial software, such as Jbits or similar. This makes our tool independent of the system used for design development and allows a quick fault injection. Moreover, any register of the configuration state machine can be accessed and the effect of SEUs on them analyzed. This analysis is fundamental before performing radiation ground testing of this kind of devices.
The Reconfigurable Streaming Vector Processor (RSVPTM)
Authors: Silviu Ciricescu, Ray Essick, Brian Lucas, Phil May, Kent Moat, Jim Norris, Michael Schuette, Ali Saidi
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

The need to process multimedia data places largecomputational demands on portable/embedded devices.These multimedia functions share commoncharacteristics: they are computationally intensive anddata-streaming, performing the same operation(s) onmany data elements.The Reconfigurable StreamingVector Processor (RSVPTM) is a vector coprocessorarchitecture that accelerates streaming data operations.Programming the RSVP architecture involves describingthe shape and location of vector streams in memory anddescribing computations as data-flow graphs.Thesedescriptions are intuitive and independent of each other,making the RSVP architecture easy to program.They arealso machine independent, allowing binary-compatibleimplementations with varying cost-performance tradeoffs.This paper presents the RSVP architecture andprogramming model, a programming case study, and ourfirst implementation.Our results show significantspeedups on streaming data functions.Speedups forkernels and applications range from 2 to over 20 timesthat of an ARM9 host processor alone.
Investigating the frequency dependence elements of CMOS RFIC interconnects for physical modeling
Authors: B. H. Ong, C. B. Sia, K. S. Yeo, J. G. Ma, M. A. Do, E. P. Li
Venue: Proceedings of the 2004 international workshop on System level interconnect prediction (2004)

Various structures of on-wafer interconnect for CMOS RFICs fabricated by using 0.18um CMOS are investigated experimentally. The measured S-parameters in terms of the dimensions and frequencies are presented in the paper. Frequency dependence elements of interconnect is extracted from the measurement. A scalable physical model is derived and quantified using measurement results for straight top-metal interconnect.
JINI/J2EE Bridge for Large-scale IP Phone Services
Authors: Jia Yu, Jan Newmarch, Michael Geisler
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Current IP phone architectures which bring phoneservices to a distributed open environment are relativelystatic and do not scale well. An IP phone environmentshould be more dynamic. Using Jini to be middleware forIP phone services will make the IP phone environmentmore portable, easier to deploy and straightforward toextend. However, many global applications with complexbusiness logic and potentially thousands of concurrentusers are developed on J2EE compliant platforms. On theone hand, J2EE is a framework to support large-scalesystems while Jini is for small to medium-scaleapplications. On the other hand, J2EE provides acentralized service whereas Jini offers loosely-coupledfederations with dynamic administration. In this paper,we propose an architecture called JINI/J2EE bridge formarrying these two technologies, and allowing J2EEapplications to be accessed by Jini.
Understanding usability in mobile commerce
Authors: Viswanath Venkatesh, V. Ramesh, Anne P. Massey
Venue: Communications of the ACM (2003)

Ramifications for wireless design: 'e' &ne; 'm'.
Enhancing Techniques for Efficient Topic Hierarchy Integration
Authors: Jyh-Jong Tsay, Hsuan-Yu Chen, Chi-Feng Chang, Ching-Han Lin
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper, we study the problem of integrating documentsfrom different sources into a comprehensive topic hierarchy.Our objective is to develop efficient techniques thatimprove the accuracy of traditional categorization methodsby incorporating categorization information providedby data sources into categorization process. Notice thatin the World-Wide Web, categorization information is oftenavailable from information sources. We present severalenhancing techniques that use categorization informationto enhance traditional methods such as naive Bayes andsupport vector machines. Experiment on collections fromOpenfind and Yam, and Google and Yahoo!, well-knownpopular web sites in Taiwan and USA, respectively, showsthat our techniques significantly improve the classificationaccuracy from, for example, 55% to 66% for Naive Bayes,and from 57% to 67% for SVM for the data set collectedfrom Yam and Openfind.
Multi-objective optimization in area coverage problems for cellular communication networks: evaluation of an elitist evolutionary strategy
Authors: Larry Raisanen, Roger M. Whitaker
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Cellular wireless networks transmit signals from base stations, over an area commonly referred to a as a cell, to provide local area coverage to subscribers. As the power of transmission is restricted, multiple cells are required to provide wide area coverage. When operators set up or expand a network, multiple potential sites are normally available. A subset of these potential sites must be chosen to form the network subject to multiple, competing objectives. In this paper, we investigate the application of a simple, steady state evolutionary algorithm to choose the best sites for optimizing the objectives. This approach generates a Pareto set of cell plans, which removes the need for a cellular network designer to rank, or weight objectives a priori, as in many proposed meta-heuristic optimization approaches. The problem specification, algorithm performance, and quality of results are delineated.
On the topology of simplicial complexes related to 3-connected and Hamiltonian graphs
Authors: Jakob Jonsson
Venue: Journal of Combinatorial Theory Series A (2003)

Using techniques from Robin Forman's discrete Morse theory, we obtain information about the homology and homotopy type of some graph complexes. Specifically, we prove that the simplicial complex Δn3 of not 3-connected graphs on n vertices is homotopy equivalent to a wedge of (n - 3). (n - 2)!/2 spheres of dimension 2n - 4, thereby verifying a conjecture by Babson, Björner, Linusson, Shareshian, and Welker. We also determine a basis for the corresponding nonzero homology group in the CW complex of 3-connected graphs. In addition, we show that the complex Γn of non-Hamiltonian graphs on n vertices is homotopy equivalent to a wedge of two complexes, one of the complexes being the complex Δn2 of not 2- connected graphs on n vertices. The homotopy type of Δn2 has been determined, independently, by the five authors listed above and by Turchin. While Γn and Δn2 are homotopy equivalent for small values on n, they are nonequivalent for n = 10.
Energy Aware Routing Protocol for Mobile and Wireless Ad hoc Networks
Authors: Azzedine Boukerche, Harold Owens,  II
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

MANET has resource limitations due to the nature ofthe network.Limitations are due to dynamic topology,memory and bandwidth constraints, and finite energysupply.To improve the QoS of the mobile client, wehave made modifications to both DSR and TORA algorithmsto make them energy aware ad hoc routingprotocols.Our algorithms forward the route requestpackets based on the distance between then nodes, theenergy level of the sending node and the receiving node.Our algorithms decrease network delay, increase networkthroughput and increase the number of data packetsreceived at the destination while decreasing the per packet energy consumption by 20%, thereby increasingthe network's lfie span.
SymOntoX: A Web-Ontology Tool for eBusiness Domains
Authors: M. Missikoff, F. Taglino
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Ontologies are emerging as a key solution to allow different applications to exchange information in a cooperative business environment. From the technology point of view, the growth of the Internet and the web has favoured the exchange of information and documents among people, but unfortunately the same is not true when information is exchanged among software applications. To tackle the latter problem, ontology-based approches are among the most promising ones. This is one of the reasons of the momentum that ontologies, and consequently Ontology Management Systems (OMSs), are witnessing. An OMS represents a powerful tool to create common and shareable knowledge repositories concerning a given application domain. The goal of this work is to present SymOntoX, a web-based OMS conceived for the ebusiness domain. It is an open source software system supporting collaborative and distributed ontology authoring activities.
Genetic Programming-Based Decision Trees for Software Quality Classification
Authors: Taghi M. Khoshgoftaar, Yi Liu, Naeem Seliya
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

The knowledge of the likely problematic areas of a software system is very useful for improving its overall quality. Based on such information, a more focussed software testing and inspection plan can be devised. Decision trees are attractive for a software quality classification problem which predicts the quality of program modules in terms of risk-based classes.They provide a comprehensible classification model which can be directly interpreted by observing thetree-structure. A simultaneous optimization of the classification accuracy and the size of the decision tree is a difficult problem, and very few studies have addressed the issue. This paper presents an automated and simplified genetic programming (gp) based decision tree modeling technique for the software quality classification problem. Genetic programming is ideally suited for problems that require optimization of multiple criteria. The proposed technique is based on multi-objective optimization using strongly typed GP.In the context of an industrial high-assurance software system, two fitness functions are used for the optimization problem: one for minimizing the average weighted cost of misclassification, and one for controlling the size of the decision tree. The classification performances of the GP-based decision trees are compared with those based on standard GP, i.e., S-expression tree. It is shown that the GP-based decision tree technique yielded better classification models. As compared to other decision tree-based methods, such as C4.5, GP-based decision trees are more flexible and can allow optimization of performance objectives other than accuracy. Moreover, it provides a practical solution for building models in the presence of conflicting objectives, which is commonly observed in software development practice
Iterative blocking artifact reduction using a minimum mean square error filter in wavelet domain
Authors: Ick Hoon Jang, Nam Chul Kim, Hyun Joo So
Venue: Signal Processing (2003)

We propose an iterative algorithm for reducing the blocking artifact in block transform-coded images by using a minimum mean square error (MMSE) filter in wavelet domain. An image is considered to be a set of one-dimensional (1-D) horizontal and vertical signals and a 1-D wavelet transform (WT) is utilized in which the mother wavelet is the first-order derivative of a Gaussian-like function. Using an MMSE filter in the wavelet domain the blocking artifact is reduced by removing the component that causes the variance at the block boundary position in the first-scale wavelet domain to be abnormally high compared to those at the other positions and the variances at the positions near the block boundary position in the second-scale wavelet domain to be somewhat high. This filter minimizes the mean square error (MSE) between the ideal blocking component-free signal and the restored signal in the neighborhood of block boundaries in the wavelet domain. The filter also uses local variance in the wavelet domain for pixel adaptive processing. The filtering and the projection onto a convex set of quantization constraint are performed alternately and iteratively. Experimental results show the proposed method yields not only a PSNR improvement of about 0.5-1.07 dB, but also a subjective quality that is nearly free of the blocking artifact and edge blur.