ppxscal/embedding_network huggingface dataset:
Prioritising and Linking Business and IT Goals in the Financial Sector
Authors: Wim Van Grembergen, Steven De Haes, Hilde Van Brempt
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

IT governance and strategic alignment are issues that are high on the agenda in many organisations. To address those challenges, it is important that an organisation has a good view on its business goals and how IT goals and IT processes support the achievement of those goals. This research is aimed at providing guidance in building up such a cascade of business goals, IT goals and IT processes. This research builds on the list of business goals and IT goals, provided in COBIT4.0, and further validates and elaborates this material leveraging the Delphi research method.
Diagnosis of Carpal Tunnel Syndrome from Thermal Images Using Artificial Neural Networks
Authors: M. Palfy, B. Jesensek Papez
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Thermography is an excellent method of examination, useful in the field of medicine for its safety, lack of pain and invasiveness, easy reproducibility and low running costs. As such it represents a possible alternative to more common methods for diagnosis of carpal tunnel syndrome (e.g. electromyography). However, manual analysis of thermal images can be a tedious job, requiring some patience and accuracy. Here we present a software-based intelligent system for diagnosis of carpal tunnel syndrome. Artificial neural networks, known as a well established data mining technique, were used for thermal image analysis. Reliability was tested on 44 images (23 depicting pathological hands and 21 healthy). Results acquired are presented.
Blind maximum likelihood sequence detection
Authors: D. J. Reader
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Maximum a posteriori (MAP) sequence detection for channels with intersymbol interference (ISI) has previously required knowledge of the channel sampled impulse response (SIR). Generally the SIR coefficients are determined via least mean square (LMS) or recursive least squares (RLS) estimation algorithms. For many unguided media channels such as mobile radio and high frequency (HF) radio which exhibit a time-varying SIR, these estimators must be adaptive. Adaptive estimators often fail to track adequately and are a major source of detector deterioration. A novel, blind maximum likelihood sequence detection (BMLSD) formulation without the need for external channel SIR estimation is proposed. A new method for resolving ambiguity in the channel delay is also included. The BMLSD performance is evaluated via simulation.
Scenario Explorer: Interactive Visualization of Use Cases
Authors: Rogardt Heldal, Jenny Samuelsson, Ola Sundin
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

In this paper we will show how to obtain a better comprehension of the behavior of large and complex software systems using visualization and program animation. Use cases are used in the software development industry for the purpose of better understanding of software systems. The problem is that use cases for large and complex software systems are themselves large and complex. We have built a tool called Scenario Explorer to help the user handle this complexity by guiding him or her through the use cases. The user is provided with just enough information to comprehend the behavior of interest. Tools like this are crucial for developers that need to obtain a better comprehension of a whole software system, for example newcomers in a project or managers. Scenario Explorer was built at Ericsson and applied to a subset of a large and complex software system.
Finite-state analysis of SSL 3.0
Authors: John C. Mitchell, Vitaly Shmatikov, Ulrich Stern
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

The Secure Sockets Layer (SSL) protocol is analyzed using a finite-state enumeration tool called Murϕ. The analysis is presented using a sequence of incremental approximations to the SSL 3.0 handshake protocol. Each simplified protocol is "model-checked" using Murϕ, with the next protocol in the sequence obtained by correcting errors that Murϕ finds automatically. This process identifies the main shortcomings in SSL 2.0 that led to the design of SSL 3.0, as well as a few anomalies in the protocol that is used to resume a session in SSL 3.0. In addition to some insight into SSL, this study demonstrates the feasibility of using formal methods to analyze commercial protocols.
A semidefinite optimization approach to the steady-state analysis of queueing systems
Authors: Dimitris Bertsimas, Karthik Natarajan
Venue: Queueing Systems: Theory and Applications (2007)

Computing the steady-state distribution in Markov chains for general distributions and general state space is a computationally challenging problem. In this paper, we consider the steady-state stochastic model $\boldsymbol {W}\stackrel{d}{=}g(\boldsymbol {W},\boldsymbol {X})$ where the equality is in distribution. Given partial distributional information on the random variables X, we want to estimate information on the distribution of the steady-state vector W. Such models naturally occur in queueing systems, where the goal is to find bounds on moments of the waiting time under moment information on the service and interarrival times. In this paper, we propose an approach based on semidefinite optimization to find such bounds. We show that the classical Kingman's and Daley's bounds for the expected waiting time in a GI/GI/1 queue are special cases of the proposed approach. We also report computational results in the queueing context that indicate the method is promising.
Lagrein: Visualizing User Requirements and Development Effort
Authors: Andrejs Jermakovics, Marco Scotto, Alberto Sillitti, Giancarlo Succi
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The development of a software project often requires more time and effort than originally expected. However, at end of a project, it is hard to determine which components required more time or were more complex than what was originally planned. In addition, project managers are interested to know what could have happened if some requirements were dropped or if they were implemented in different time sequencing. Lagrein is a tool that supports managers and developers in answering such kind of questions.
On retiming of multirate DSP algorithms
Authors: V. Zivojnovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The retiming of DSP algorithms exhibiting multirate behavior is treated. Using the non-ordinary marked graph model and the reachability theory, we provide a new condition for valid retiming of multirate graphs. We show that for a graph with n nodes the reachability condition can be split into the reachability condition for the topologically-equivalent unit-rate graph (all rates set to one), and (n/sup 2/-n)/2 rate-dependent conditions. Using this property a class of equivalent graphs of reduced complexity is introduced which are equivalent in terms of retiming. Additionally, the circuit-based necessary condition for valid retiming of multirate graphs is extended for the sufficient part.
Using queue structures to improve job reliability
Authors: Thomas J. Hacker, Zdzislaw Meglicki
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Many high performance computing systems today exploit the availability and remarkable performance characteristics of stand alone server systems and the impressive price / performance ratio of commodity components. Small scale HPC systems, in the range from 16 to 64 processors, have enjoyed significant popularity and are an indispensable tool for the research community. Scaling up to hundreds and thousands of processors, however, has exposed operational issues, which include system availability and reliability. In this paper, we explore the impact of individual component reliability rates on the overall reliability of an HPC system. We derive a mathematical model for determining the failure rate of the system, the probability of failure of a job running on a subset of the system, and show how to design a reasonable queue structure to provide a reliable system over abroad job mix. We also explore the impact of reliability and queue structure on checkpoint intervals and recovery. Our results demonstrate that it is possible to design a reliable high performance computing system with very good operational reliability characteristics from a collection of moderately reliable components.
Innovative instructional mentoring through partnerships across the curriculum
Authors: J. A. Stuart
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

The authors summarize the motivation, implementation process and findings for instructional mentoring for a junior level core class in industrial and systems engineering.
Understanding faulty behavior of a peristaltic micropump
Authors: M. Knight, B. Kaminska, J. House
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The effects of process parameters, specifically those related to silicon wet etch and metal deposition, on the performance of the microheaters in a peristaltic microfluidic pump are presented. The thermal resistance of the microheaters is strongly dependent upon the relative thermal isolation, which impacts maximum pumping speed (from a few Hertz to kilo-Hertz). Thermal isolation is shown to not be an issue in the pump design given the spacing of the neighboring microheaters.
Coordinating microscopic robots in viscous fluids
Authors: Tad Hogg
Venue: Autonomous Agents and Multi-Agent Systems (2007)

Multiagent control provides strategies for aggregating microscopic robots ("nanorobots") in fluid environments relevant for medical applications. Unlike larger robots, viscous forces and Brownian motion dominate the behavior. Examples range from modified microorganisms (programmable bacteria) to future robots using ongoing developments in molecular computation, sensors and motors. We evaluate controls for locating a cell-sized area emitting a chemical into a moving fluid with parameters corresponding to chemicals released in response to injury or infection in small blood vessels. These control methods are passive Brownian motion, following the chemical concentration gradient, and cooperative behaviors in which some robots use acoustic signals to guide others to the chemical source. Control performance is evaluated using diffusion equations to describe the robot motions and control state transitions. The quantitative results show these control techniques are feasible approaches to the task with trade-offs among fabrication difficulty, response speed, false positive detection rate and energy use. Controlled aggregation at chemically distinctive locations could be useful for sensitive diagnosis, selective changes to biological tissues and forming structures using previous proposals for multiagent control of modular robots.
New Systolic Arrays for Matrix Multiplication
Authors: Sau-Gee Chen, Jiann-Cherng Lee, Chieh-Chih Li
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

In this paper, three new systolic arrays for matrix multiplication are proposed. The first systolic array has the minimum number of 3n-2 clock cycles in completing a matrix multiplication among the known structures, with n^2 processors elements (PE's). It is achieved by applying a new input data flow and deposition scheme. The second array is derived by combining the data flow technique with the simple Blahut's matrix multiplication algorithm. Not only the second array has the least amount of processing time of3n-2 clock cycles, it has the least area complexity of about n^2 /2 PE's. By further modifying its input data flow patterns, the third array is obtained. Its processing time is further reduced to 2.5n-2 clock cycles. The proposed architectures exhibit better performances than the known structures, according to several standard performance measures.
Trading capacity for performance in a disk array
Authors: Xiang Yu, Benjamin Gum, Yuqun Chen, Randolph Y. Wang, Kai Li, Arvind Krishnamurthy, Thomas E. Anderson
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

A variety of performance-enhancing techniques, such as striping, mirroring, and rotational data replication, exist in the disk array literature. Given a fixed budget of disks, one must intelligently choose what combination of these techniques to employ. In this paper, we present a way of designing disk arrays that can flexibly and systematically reduce seek and rotational delay in a balanced manner. We give analytical models that can guide an array designer towards optimal configurations by considering both disk and workload characteristics. We have implemented a prototype disk array that incorporates the configuration models. In the process, we have also developed a robust disk head position prediction mechanism without any hardware support. The resulting prototype demonstrates the effectiveness of the configuration models.
Segmentation and object-based classification for the extraction of the building class from LIDAR DEMs
Authors: George Miliaresis, Nikolaos Kokkas
Venue: Computers Geosciences (2007)

A new method is presented for the extraction of a class for buildings from light detection and ranging (LIDAR) digital elevation models (DEMs) on the basis of geomorphometric segmentation principles. First, seed cells and region growing criteria are specified. Then an object partition framework is defined on the basis of region growing segmentation. Size filtering is applied to objects and connected components labelling identifies background and foreground objects that are parametrically represented on the basis of elevation and slope. K-means classification reveals a set of clusters. The interpretation of the spatial distribution of clusters assisted by the interpretation of cluster centroids, allows for the identification of the building class, as well as building sub-classes with different geomorphometric characteristics.
An Interactive Statistical Image Segmentation and Visualization System
Authors: Adam Kapelner, Peter P. Lee, Susan Holmes
Venue: Proceedings of the International Conference on Medical Information Visualisation - BioMedical Visualisation (2007)

Supervised learning can be used to segment / identify regions of interest in images making use of color and morphological information. A novel object identification algorithm was developed in Java to locate immune and cancer cells in images of immunohistochemically-stained lymph node tissue from the recent Kohrt study[1] and also shows promise in other domains. Our method leans heavily on the use of color and the relative homogeneity of object appearance. As is often the case in segmentation, an algorithm specifically tailored to the application works better than using broader methods that work passably well on any problem. Our main innovation is interactive feature extraction from color images. We also enable the user to improve the classification with an interactive visualization system. This is then coupled with the statistical learning algorithms and intensive interaction with the user over many classification-correction iterations, resulting in a highly accurate and user-friendly solution. The system ultimately provides the locations of every cell in the entire tissue. This data can be analyzed using standard statistical methods such as spatial analyses or robust clustering. This data is invaluable in the study of multidimensional relationships between cell populations and tumor structure.
Automated generic operating system installation and maintenance
Authors: Joel D. Martin, Aaron D. Brooks
Venue: Proceedings of the 3rd conference on Large Installation System Administration of Windows NT - Volume 3 (2000)

Microsoft Windows NT deployment and maintenance is one of the most time consuming tasks for systems administrators. The primary motivation for the JACAL project is to streamline this process by creating a set of free and open tools and guidelines for automating the installation and maintenance of one or more operating systems in large computing environments. It is well known that Windows NT workstations have subtle and potentially serious problems when they are duplicated from a disk image. These problems leave IT administrators with the task of manually setting up NT workstations or cobbling together a number of different automation methods which, in the end, still require the administrators to manually fill in the parts which the various automation tools leave out. Most large scale installation and maintenance tools do not provide solutions that solve the problem completely from boot to a completed build with minimal administrator intervention. The JACAL project was developed at Taylor University's Computing and System Sciences Department. Our lab and classroom environment consists of 40 workstations that dual-boot Windows NT and Linux. We also have 5 dedicated Linux workstations, 12 dedicated NT workstations, and 7 faculty workstations. Each Windows NT setup has nearly 80 applications that are available to every user. Nearly 1 GB of application data is installed to the local hard drive and over 7 GB of application data is served to the workstations from the application server. Manual installation of these applications takes 25+ hours on a single machine. JACAL allows us to fully rebuild a workstation in under 2 hours with only a few minutes of administrator intervention.
Rapid Prototyping of Intrusion Detection Systems
Authors: Fabrice Kordon, Jean-Baptiste Voron
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

Designing security softwares that evolve as quickly as threats is a truthful challenge. In addition, current software becomes increasingly more complex and difficult to handle even for security experts. Intrusion Detection Softwares (IDS) represent a solution that can alleviate these concerns. This paper proposes a framework to automatically build an effective online IDS which can check if the program's expected behavior is entirely respected during the execution. The proposed framework extracts relevant information from the program's source code to build a dedicated IDS. We use the GCC compiler to produce the structure of our behavior's model and ensure the IDS is correct. Thanks to Petri nets, our framework allows program offline monitoring and simplifies the online monitoring development.
The discrete versus continuous controversy in physics
Authors: Annick Lesne
Venue: Mathematical Structures in Computer Science (2007)

This paper presents a sample of the deep and multiple interplay between discrete and continuous behaviours and the corresponding modellings in physics. The aim of this overview is to show that discrete and continuous features coexist in any natural phenomenon, depending on the scales of observation. Accordingly, different models, either discrete or continuous in time, space, phase space or conjugate space can be considered. Some caveats about their limits of validity and their interrelationships (discretisation and continuous limits) are pointed out. Difficulties and gaps arising from the singular nature of continuous limits and from the information loss accompanying discretisation are discussed.
Evaluating the impact of typical images for visual query formulation on search efficacy
Authors: Brian J. Reithel
Venue:  (2005)

Whether we're corporate employees or consumers, we do not always find what we're looking for when searching databases. Search phrases are often at low levels of abstraction (like office chair, as opposed to higher levels of abstraction like chair or furniture). Most user queries are formulated with text in which users generally enter two-word phrases and expect to receive a cluster of results meeting their needs. However, multimedia databases (like ebay.com or amazon.com) offer the opportunity to formulate queries with images that, in turn, represent clusters of search results. Though much is known about categorization at high levels of abstraction, very little research has been done in the area of using images to represent categories at low levels of abstraction.Following categorization of 60 images of objects (office chairs ) through a multiple pile-sort technique, visual query interfaces utilizing hierarchies of typical and atypical images to represent clusters of the office chairs at low levels of abstraction were created. Using a search task, this dissertation examines the effect of typical images on search time and argues that as similarity increases, the effect of typicality on search efficacy is lessened. A 2 (typicality: typical vs. atypical) x 2 (similarity: similar vs. dissimilar) shows that typical images facilitate faster searching compared to atypical images, but that this effect is reduced, and even reversed, when these objects are very similar to each other. Implications for information systems, such as search engines, and marketing are discussed.
Safety, software architecture and MIL-STD-1760
Authors: Matthew John Squair
Venue: Proceedings of the eleventh Australian workshop on Safety critical systems and software - Volume 69 (2007)

Integrating modern aircraft stores, particularly weapons, creates a complex system of systems challenge. The traditional approach to such integrations was for each to be a stand-alone program. For each program a unique interface would usually be implemented, usually also with a set of unique problems, such as the missile 'ghosting' problems experienced during the F-16 to AMRAAM integration (Ward 1993). In response to the problems of such an approach MIL-STD-1760 an Interface Standard for Aircraft to Store Electrical Interconnection System was released by the US DoD to standardise aircraft/store interfaces. This paper discusses the advantages and limitations of the architectural techniques of MIL-STD-1760. A hierarchical method for integrating the use of the standard into a safety case is also described.
Behavior Analysis-Based Learning Framework for Host Level Intrusion Detection
Authors: Haiyan Qiao, Jianfeng Peng, Chuan Feng, Jerzy W. Rozenblit
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Machine learning has great utility within the context of network intrusion detection systems. In this paper, a behavior analysis-based learning framework for host level network intrusion detection is proposed, consisting of two parts, anomaly detection and alert verification. The anomaly detection module processes unlabeled data using a clustering algorithm to detect abnormal behaviors. The alert verification module adopts a novel rule learning based mechanism which analyzes the change of system behavior caused by an intrusion to determine whether an attack succeeded and therefore lower the number of false alarms. In this framework, the host behavior is not represented by a single user or program activity; instead, it is represented by a set of factors, called behavior set, so that the host behavior can be described more accurately and completely.