ppxscal/embedding_network huggingface dataset:
COBIT and Its Utilization: A Framework from the Literature
Authors: Gail Ridley, Judy Young, Peter Carroll
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

The Control Objectives for Information and Related Technology (COBIT) is a "trusted" openstandard [15: p.33] that is being used increasingly by a diverse range of organizations throughout the world. COBIT is arguably the most appropriate control framework to help an organization ensure alignment between use of Information Technology (IT) and its business goals, as it places emphasis on the business need that is satisfied by each control objective [3]. This paper reports on the use of a simple classification of the published literature on COBIT, to highlight some of the features of that literature.
On merging structured documents with move operation
Authors: Nobutaka Suzuki, Yorichiro Sato, Michiyoshi Hayase
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

We consider merging structured documents, which is to transform given two distinct documents into isomorphic ones. Such merging is essential to synchronizing several copies of a document concurrently edited by several clients. Two documents, treated as ordered trees, are merged by applying a merge script consisting of add, del, upd, and move operations to the documents. We prove that the corresponding decision problem to finding an optimum merge script is NP-complete. Then, we show a sufficient condition under which an optimum merge script can be found in polynomial time.
The Performance of Runtime Data Cache Prefetching in a Dynamic Optimization System
Authors: Jiwei Lu, Howard Chen
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Traditional software controlled data cache prefetching isoften ineffective due to the lack of runtime cache miss andmiss address information. To overcome this limitation, weimplement runtime data cache prefetching in the dynamicoptimization system ADORE (ADaptive Object code RE-optimization).Its performance has been compared withstatic software prefetching on the SPEC2000 benchmarksuite. Runtime cache prefetching shows better performance.On an Itanium 2 based Linux workstation, it can increaseperformance by more than 20% over static prefetching onsome benchmarks. For benchmarks that do not benefit fromprefetching, the runtime optimization system adds only 1%-2%overhead. We have also collected cache miss profiles toguide static data cache prefetching in the ORC® compiler.With that information the compiler can effectively avoidgenerating prefetches for loops that hit well in the datacache.
A Timeout-Based Message Ordering Protocol for a Lightweight Software Implementation of TMR Systems
Authors: Paul D. Ezhilchelvan, Francisco V. Brasileiro, Neil A. Speirs
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--Replicated processing with majority voting is a well-known method for achieving reliability and availability. Triple Modular Redundant (TMR) processing is the most commonly used version of that method. Replicated processing requires that the replicas reach agreement on the order in which input requests are to be processed. Almost all synchronous and deterministic ordering protocols published in the literature are time-based in the sense that they require replicas' clocks to be kept synchronized within some known bound. We present a protocol for TMR systems that is based on timeouts and does not require clocks to be kept in bounded synchronism. Our design efforts focus on keeping the ordering delays small, without an unnecessary increase in message overhead. Consequently, we are able to show that no symmetric protocol that works only with unsynchronized clocks can provide a smaller worst-case delay. We also demonstrate through analysis and experiments that our protocol is faster than a time-based one of identical message complexity in certain situations which can prevail in many application settings.
Segmentation natural speech using fractal dimension
Authors: F. Martinez, A. Guillamon, J. J. Martinez
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Speech signals can be considered as being generated by mechanical systems with inherently nonlinear dynamics. The purpose of this paper is to present an automatic segmentation method based on nonlinear dynamics with low computational cost. The fractal dimension is a measure of signal complexity that can characterize different voiced and unvoiced. The segmentation process is carried out in two stages: estimation of the fractal dimension using the method suggested by Katz [1] and detection of the stationarity of the fractal dimension by means of the value of the variance parameter computed over the smooth fractal dimension signal. Using this combination of techniques, a quick and automatic segmentation is obtained. Our experiments have been computed over recorder signals from a speech Spanish database (AHUMADA).
Recognition of hand-printed characters based on structural description and inductive logic programming
Authors: Adnan Amin
Venue: Pattern Recognition Letters (2003)

Character recognition systems can contribute tremendously to the advancement of the automation process and can improve the interaction between man and machine in many applications, including office automation, cheque verification and a large variety of banking, business and data entry applications. The main theme of this paper is the automatic recognition of hand-printed Arabic characters using machine learning. Conventional methods have relied on hand-constructed dictionaries which are tedious to construct and difficult to make tolerant to variation in writing styles. The advantages of machine learning are that it can generalize over the large degree of variation between writing styles and recognition rules can be constructed by example.The system was tested on a sample of handwritten characters from several individuals whose writing ranged from acceptable to poor in quality and the average correct recognitions rate obtained using cross-validation was 86.65%.
A User Perspective of Quality of Service in m-Commerce
Authors: Gheorghita Ghinea, Marios C. Angelides
Venue: Multimedia Tools and Applications (2004)

In an m-commerce setting, the underlying communication system will have to provide a Quality of Service (QoS) in the presence of two competing factors&mdash;network bandwidth and, as the pressure to add value to the business-to-consumer (B2C) shopping experience by integrating multimedia applications grows, increasing data sizes. In this paper, developments in the area of QoS-dependent multimedia perceptual quality are reviewed and are integrated with recent work focusing on QoS for e-commerce. Based on previously identified user perceptual tolerance to varying multimedia QoS, we show that enhancing the m-commerce B2C user experience with multimedia, far from being an idealised scenario, is in fact feasible if perceptual considerations are employed.
The monotone theory for the PAC-model
Authors: Nader H. Bshouty
Venue: Information and Computation (2003)

In this paper we extend the Monotone Theory to the PAC-learning Model with membership queries. Using this extention we show that a DNF formula that has at least one "1/poly-heavy" clause in one of its CNF representation (a clause that is not satisfied with probability 1/poly(n, s) where n is the number of variables and s is the number of terms in f) with respect to a distribution D is weakly learnable under this distribution. So DNF that are not weakly learnable under the distribution D do not have any "1/poly-heavy" clauses in any of their CNF representations.A DNF f is called τ-CDNF if there is τ' > τ and a CNF representation of f that contains poly(n,s) clauses that τ'-approximates f according to a distribution D. We show that the class of all τ-CDNF is weakly (τ + ε)- PAC-learnable with membership queries under the distribution D.We then show how to change our algorithm to a parallel algorithm that runs in polylogarithmic time with a polynomial number of processors. In particular, decision trees are (strongly) PAC-learnable with membership queries under any distribution in parallel in polylogarithmic time with a polynomial number of processors. Finally, we show that no efficient parallel exact learning algorithm exists for decision trees.
Towards the real time solution of strike force asset allocation problems
Authors: V. C. Li, G. L. Curry, E. A. Boyd
Venue: Computers and Operations Research (2004)

The strike force asset allocation problem consists of grouping strike force assets into packages and assigning these packages to targets and defensive assets in a way that maximizes the strike force potential. Integer programming formulations are developed, semi-real and random problems are built up, and computational results via the CPLEX MIP Solver are presented.
Pedestrian navigation aids: information requirements and design implications
Authors: Andrew J. May, Tracy Ross, Steven H. Bayer, Mikko J. Tarkiainen
Venue: Personal and Ubiquitous Computing (2003)

Recent years have seen an increased interest in navigational services for pedestrians. To ensure that these services are successful, it is necessary to understand the information requirements of pedestrians when navigating, and in particular, what information they need and how it is used. A requirements study was undertaken to identify these information requirements within an urban navigation context. Results show that landmarks were by far the most predominant navigation cue, that distance information and street names were infrequently used, and that information is used to enable navigation decisions, but also to enhance the pedestrian&rsquo;s confidence and trust. The implications for the design of pedestrian navigation aids are highlighted.
Web usability and age: how design changes can improve performance
Authors: Ann Chadwick-Dias, Michelle McNulty, Tom Tullis
Venue: Issue 73-74 (June-September 2002) (2002)

We conducted two usability studies that included a total of 49 participants ranging in age from 20 to 82. The goal of Study 1 was to learn whether there were differences in how older adults interact with the Web and whether changes in text size would affect performance. Users completed tasks on a prototype employee/retiree benefits site using various text sizes. We learned that older users (55 years or older) had significantly more difficulty using the Web site than younger users. Text size did not significantly affect performance in any age group. In Study 2 new participants performed the same tasks on a version of the site that was redesigned to address the usability problems encountered by older users in Study 1. The goal was to learn whether we could redesign the prototype to improve the performance of older adults. Performance improved significantly for both older and younger users.
Institutional decision-making to select patient care devices: identifying venues to promote patient safety
Authors: Alla Keselman, Vimla L. Patel, Todd R. Johnson, Jiajie Zhang
Venue: Journal of Biomedical Informatics (2003)

Many medical errors that involve drug infusion devices are related to classic interface problems. Although manufacturers are becoming increasingly aware of human factors design considerations, many devices that are currently on the market are still sub-optimal for human use. This places significant responsibility for device selection on institutional purchasing groups. Theories of naturalistic decision-making point to many potential strengths and pitfalls of group decision-making processes that may affect the final outcome. This paper describes a retrospective analysis of decision-making process for infusion pump selection in a large hospital and focuses on factors related to patient safety. Through a series of detailed interviews and a study of relevant documentation we characterized the nature of the decision-making, patterns of communication, and the roles of different participants. Findings show that although the process involves a number of different professional groups and committees, the information flow among them is restricted. This results in inadequate representation of critical device usability considerations in the decision-making process. While all participants view device safety as an important consideration in the selection process, administrators (who are the final decision-makers) tend to equate safety with technical accuracy and reliability, paying less attention to the role of human factors in safe device use. Findings suggest that collaborative communication technology and automated evidence-based guidelines could provide support to institutional decision-making, ensuring that the process is efficient, effective, and ultimately safe for the patients.
Integrating the end user into infrastructure systems: a customer centric approach to the design and function of intelligent transportation systems
Authors: Thomas A. Horan
Venue: Information management: support systems & multimedia technology (2003)

This chapter analyzes the role of users in enacting Intelligent Transportation Systems (ITS) functions and services. Preliminary evidence from recent demonstrations and market research studies is reviewed with a focus on the role of travelers in producing and using information about traffic conditions and traveler options. The potential for systems development is then considered with specific regard to alternative mode travel, flexible travel, emergency, and commercial services. Based on these findings, several directions and recommendations are made for creating the next generation of ITS systems that enhance user-based elements. Several areas for research and development are recommended, including integrating a wider range of market segments into ITS systems planning, developing a better understanding of how users drive complex systems, and creating new institutional partnerships for delivering innovative services.
Robust sketched symbol fragmentation using templates
Authors: Heloise Hse, Michael Shilman, A. Richard Newton
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applications in intelligent interfaces for digital ink capture and manipulation, as well as higher-level symbolic and structural analyses. It is our intuitive belief that the most robust fragmentations closely match a user's natural perception of the ink, thus leading to more effective recognition and useful user feedback. We present two optimal fragmentation algorithms that fragment common geometries into a basis set of line segments and elliptical arcs. The first algorithm uses an explicit template in which the order and types of bases are specified. The other only requires the number of fragments of each basis type. For the set of symbols under test, both algorithms achieved 100% fragmentation accuracy rate for symbols with line bases, ›99% accuracy for symbols with elliptical bases, and ›90% accuracy for symbols with mixed line and elliptical bases.
A Mixed-Mode Analog Neural Network Using Current-Steering Synapses
Authors: Johannes Schemmel, Steffen Hohmann, Karlheinz Meier, Felix Schürmann
Venue: Analog Integrated Circuits and Signal Processing (2004)

A hardware neural network is presented that combines digital signalling with analog computing. This allows a high amount of parallelism in the synapse operation while maintaining signal integrity and high transmission speed throughout the system. The presented mixed-mode implementation achieves a synapse density of 4 k per mm2 in 0.35 &mu;m CMOS. The current-mode operation of the analog core combined with differential neuron inputs reaches an analog precision sufficient for 10 bit parity while running at a speed of 0.8 Teraconnections per second.
Eliminating noisy information in Web pages for data mining
Authors: Lan Yi, Bing Liu, Xiaoli Li
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notices, and advertisements (for business purposes and for easy user access). We call these blocks that are not the main content blocks of the page the noisy blocks. We show that the information contained in these noisy blocks can seriously harm Web data mining. Eliminating these noises is thus of great importance. In this paper, we propose a noise elimination technique based on the following observation: In a given Web site, noisy blocks usually share some common contents and presentation styles, while the main content blocks of the pages are often diverse in their actual contents and/or presentation styles. Based on this observation, we propose a tree structure, called Style Tree, to capture the common presentation styles and the actual contents of the pages in a given Web site. By sampling the pages of the site, a Style Tree can be built for the site, which we call the Site Style Tree (SST). We then introduce an information based measure to determine which parts of the SST represent noises and which parts represent the main contents of the site. The SST is employed to detect and eliminate noises in any Web page of the site by mapping this page to the SST. The proposed technique is evaluated with two data mining tasks, Web page clustering and classification. Experimental results show that our noise elimination technique is able to improve the mining results significantly.
New knowledge management systems: the implications for data discovery, collection development, and the changing role of the librarian
Authors: David Stern
Venue: Journal of the American Society for Information Science and Technology (2003)

The papers presented at the 2002 Tri-Society Symposium on Chemical Information highlight questions we should consider as we develop new paradigms for information storage and retrieval systems. These new knowledge management systems will require novel approaches for data discovery, collection development, and the changing role of the librarian. This introductory essay discusses new and challenging integrated tools for data manipulation, the confusing and embryonic differential pricing and package deals for journal materials, and the changing role of the librarian in this rapidly transforming industry.
Generalised coinduction
Authors: Falk Bartels
Venue: Mathematical Structures in Computer Science (2003)

We introduce the $\lambda-coiteration$ schema for a distributive law $\lambda$ of a functor $\Functor{T}$ over a functor $\Functor{F}$. Parameterised by $\Functor{T}$ and $\lambda$ it generalises the basic coiteration schema uniquely characterising functions into a final $\Functor{F}$-coalgebra. Furthermore, the same parameters are used to generalise the categorical notion of a bisimulation to that of a $\lambda-bisimulation$, while still giving rise to a proof technique for bisimilarity. We first present a theorem showing the validity of the resulting definition and proof principles for categories with countable coproducts.Our approach gives a unifying categorical presentation and justification of several extensions of the basic coinduction schemata that have been treated separately before, and some only for specific types of system. As examples, the duals of primitive recursion and course-of-value iteration, which are known extensions of coiteration, arise as instances of our framework.Moreover, we derive schemata involving auxiliary operators definable with GSOS-style specifications such as addition of streams, regular operators on languages, or parallel and sequential composition of processes. The argument is based on a variation of the theory in the setting of monads and copointed functors. The schemata justify guarded recursive definitions and an up-to-context proof technique for operators of the type mentioned. The latter can ease bisimilarity proofs considerably.
Sharpening of Comb Filter by Multiple Use of the Same Filter
Authors: Raúl Ochoa Valiente, Gordana Jovanovic-Dolecek
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

This paper presents an extension of themethod proposed by Wilson et al. for sharpeningcomb filters. The method is based on the use of anAmplitude Change Function (ACF) to decreasepassband droop and increase alias rejection ofcomb filter. Our proposal is to use a set of ACF'sin order to obtain more flexibility in the combfilter performances.
Scalable TCP: improving performance in highspeed wide area networks
Authors: Tom Kelly
Venue: ACM SIGCOMM Computer Communication Review (2003)

TCP congestion control can perform badly in highspeed wide area networks because of its slow response with large congestion windows. The challenge for any alternative protocol is to better utilize networks with high bandwidth-delay products in a simple and robust manner without interacting badly with existing traffic. Scalable TCP is a simple sender-side alteration to the TCP congestion window update algorithm. It offers a robust mechanism to improve performance in highspeed wide area networks using traditional TCP receivers. Scalable TCP is designed to be incrementally deployable and behaves identically to traditional TCP stacks when small windows are sufficient. The performance of the scheme is evaluated through experimental results gathered using a Scalable TCP implementation for the Linux operating system and a gigabit transatlantic network. The preliminary results gathered suggest that the deployment of Scalable TCP would have negligible impact on existing network traffic at the same time as improving bulk transfer performance in highspeed wide area networks.
Energy Management for Commercial Servers
Authors: Charles Lefurgy, Karthick Rajamani, Freeman Rawson, Wes Felter, Michael Kistler, Tom W. Keller
Venue: Computer (2003)

Servers--high-end, multiprocessor systems running commercial workloads--have typically included extensive cooling systems and resided in custom-built rooms for high-powerdelivery. Recently, as transistor density and demand for computing resources have rapidly increased, even these highend systems face energy-use constraints.Commercial-server energy management now focuses on conserving power in the memory and microprocessor subsystems. Because their workloads are typically structured as multiple application programs, system-wide approaches are more applicable to multiprocessor environments in commercial servers thantechniques that primarily apply to single-application environments, such as those based on compiler optimizations.
Low Energy Switch Block For FPGAs
Authors: Rohini Krishnan, Jose Pinedade Gyvez
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We propose a new energy efficient method of designingswitch blocks inside FPGAs using novel variations of the Dual ThresholdCMOS (DTMOS) based switches instead of the conventional NMOSpass transistor or tri-state buffer based switches. By intelligently sharingthe extra transistor needed for using DTMOS based switches, the areaoverhead is kept to a minimum. Sleep transistors are used to reducesub-threshold leakage. Using our new, novel design, we obtain a 16%improvement in the power-delay product during the active mode perswitch and a factor of 20 improvement in the stand-by mode, overconventional approaches. Extensive simulation results over benchmarkcircuits in CMOS 0.13µ are presented to illustrate the superiority of theproposed techniques. Since the proposed techniques target the switchesand multiplexers which are present in large numbers on FPGAs, theoverall improvement in the power-delay product is significant for anapplication implemented on a FPGA having the proposed features.