ppxscal/embedding_network huggingface dataset:
Ontology-based Semantic Integration Scheme for Medical Image Grid
Authors: Hai Jin, Aobing Sun, Ran Zheng, Ruhan He, Qin Zhang
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Ontology is becoming a key for grid platform to support the composition of heterogeneous resources by means of processing resource description and enactment. MedImGrid (Medical Image Grid) aims to archive, access, and analyze medical data from distributed healthcare information systems to adapt to the development of healthcare information infrastructure. But the heterogeneities of those systems, especially the semantic gulfs, hamper their interoperations in grid environment. In this paper, we propose an OSIS (Ontology-based Semantic Integration Scheme) for MedImGrid, which adopts a hybrid method to build MedImGrid ontologies and unifies its information exchange model with HL7 (Health Level 7) v3 protocol. The MedImGrid ontologies share the same vocabulary to simplify the knowledge discovery and semantic transformation within distributed environment. The rule-based ontology mapping components are also designed to support semantic operations of MedImGrid. We test the performances of our scheme with simulation experiments to evaluate the feasibility of our approach.
WindowBox: a simple security model for the connected desktop
Authors: Dirk Balfanz, Daniel R. Simon
Venue: Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4 (2000)

Breaches in computer security do not just exploit bugs in applications; they are often also the result of mismanaged protection mechanisms. The tools available to protect sensitive resources and networks are tedious to use, non-intuitive, and often require expert knowledge. As a result, many PC and workstation users end up administering their system security poorly, creating serious security vulnerabilities. This paper presents a new security model, WindowBox, which presents the user with a model in which the workstation is divided into multiple desktops. Each desktop is sealed off from the others, giving users a means to confine the possibly dangerous results of their actions. We have implemented our security model on Windows 2000, leveraging the existing desktop metaphor, the ability to switch between multiple desktops, and specific kernel security mechanisms.
Risk Themes Discovered through Architecture Evaluations
Authors: Len Bass, Robert Nord, William Wood, David Zubrow
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

The output of 18 software architecture evaluations are analyzed to find patterns in the risk themes identified in the evaluations. The major results are: - A categorization of risk themes - The observation that twice as many risk themes are risks of "omission" as are risks of "commission". - A failure to find a relationship between the business and mission goals of a system and the risk themes from an evaluation of that system. - A failure to find a relationship between the domain of a system being evaluated and the risk themes associated with the development of that system. The results of this investigation have application to practitioners by suggesting activities on which developers should put greater focus. They also have application to researchers by suggesting further areas of investigation.
A New Network Topology Evolution Generator Based on Traffic Increase and Distribution Model
Authors: Xiangqian Chen, Kia Makki, Kang Yen, Niki Pissinou
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Following traffic increase near to network backbone capacity in a domain network, the evolution of backbone topology takes place. In this paper, three main types of evolution methods: link upgrading only method (upgrade link capacity only), node upgrading method (add nodes and links with the same link capacity), and the combinations of previous two are explored. To shunt the saturated traffic efficiently, we propose several node upgrading generators - Adapting Traffic Evolution Topology gEnerators (ATETEs). ATETEs consider traffic distribution and node burden conditions and select the congested link as the main shunting object. The difference among ATETEs lies that they have diverse strategies to choose a node in the congested link as the second shunting aim. Simulation shows that: the type of ATETEs which picks the burdened node in the saturated link as another shunting object has the most effective shunting result. Compare with most of current topology generators such as [BRITE] in [1] which consider little about traffic increase distribution, ATETEs are more efficient to satisfy traffic increase.
Using Classifiers to Solve Warehouse Location Problems
Authors: Kurt DeMaagd, Scott Moore
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We present a new technique for finding solutions to facility location problems. Traditional techniques are usually sensitive to small details of the problem. We present a more general method which generates rules that can be applied to a range of problems. Because these rules are more general, they help researchers build intuitions about their models and help managers more easily apply the model's result to real world situations. We use a classifier to learn about the important features of the model. To generate new rules, we use a genetic algorithm. Although classifiers are traditionally used to find key features of documents or other similar objects, we find that they can also discover important attributes of facility location models. Based on these attributes, the classifier chooses what facilities should be built. While still only a proof of concept, our results indicate classifiers are a reasonable tool for solving facility location problems.
Develop a compiler in Java for a compiler design course
Authors: Abdul Sattar, Torben Lorenzen
Venue: ACM SIGCSE Bulletin (2007)

The authors' Compiler Design course at Bridgewater State College implemented a translator for a small language using Java. The project was broken into five assignments that included a language definition, extension of this language, a lexical analyzer, a recursive descent parser, and finally a code generator that generated Jasmin assembly language code for the JVM (Java Virtual Machine).
Optimization of dynamic data structures in multimedia embedded systems using evolutionary computation
Authors: David Atienza, Christos Baloukas, Lazaros Papadopoulos, Christophe Poucet, Stylianos Mamagkakis, Jose I. Hidalgo, Francky Catthoor, Dimitrios Soudris, Juan Lanchares
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applications share complex and intensive dynamic memory use. Thus, dynamic memory optimizations are a requirement when porting these applications. Within these optimizations, the refinement of the Dynamically (de)allocated Data Type (or DDT) implementations is one of the most important and difficult parts for an efficient mapping onto low-power embedded devices. In this paper, we describe a new automatic optimization approach for the DDTs of object-oriented multimedia applications. It is based on an analytical pre-characterization of the possible elementary DDT blocks, and a multi-objective genetic algorithm to explore the design space and to select the best implementation according to different optimization criteria (i.e., memory accesses, memory footprint and energy consumption). Our results in real-life multimedia applications show that the best implementations of DDTs can be obtained in an automated way in few hours, while typically designers would require days to find a suitable implementation, achieving important savings in exploration time with respect to other state-of-the-art heuristics-based optimization methods for this task.
Assessing the effectiveness of integrated freshmen curricula in engineering
Authors: S. G. Haag
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. Reform across subject areas through curricular integration has an overarching goal of achieving high academic success for all students. A number of schools in the country associated with the National Science Foundation Engineering Education Coalition program have incorporated reform across subject areas as one of their objectives. In an attempt to reform engineering education at Arizona State University, the Foundation Coalition (FC) program offered an integrated freshman program and embedded four core reform competencies in its strategic plan and across all subject areas. The core competencies are emphasized not only for high academic success but for student retention and professionalism. The four competencies include: utilization of technology-enabled education, improvement of human interactions that affect the educational environment, integration of subject matter within the curriculum, and promotion of life long learning. This report contains outcomes from comprehensive evaluation of the FC program. The evaluation included assessment of FC students and a non-FC comparison group of students.
Adaptive and reliable parallel computing on networks of workstations
Authors: Robert D. Blumofe, Philip A. Lisiecki
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

In this paper, we present the design of Cilk-NOW, a runtime system that adaptively and reliably executes functional Cilk programs in parallel on a network of UNIX workstations. Cilk (pronounced "silk") is a parallel multithreaded extension of the C language, and all Cilk runtime systems employ a provably efficient threadscheduling algorithm. Cilk-NOW is such a runtime system, and in addition, Cilk-NOW automatically delivers adaptive and reliable execution for a functional subset of Cilk programs. By adaptive execution, we mean that each Cilk program dynamically utilizes a changing set of otherwise-idle workstations. By reliable execution, we mean that the Cilk-NOW system as a whole and each executing Cilk program are able to tolerate machine and network faults. Cilk-NOW provides these features while programs remain fault oblivious, meaning that Cilk programmers need not code for fault tolerance. Throughout this paper, we focus on end-to-end design decisions, and we show how these decisions allow the design to exploit high-level algorithmic properties of the Cilk programming model in order to simplify and streamline the implementation.
Tracking areas of interest for content-based functionalities in segmentation-based video coding
Authors: F. Marques
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper presents a technique for tracking areas of interest in the framework of segmentation-based video coding. The technique is independent of the type of segmentation technique used in the coding approach. Therefore, it can also be used in block-based coding schemes. The algorithm relies on a double segmentation of the image based on morphological tools. This double segmentation permits to obtain the position and shape of the previous area of interest in the current image. In order to demonstrate the potentialities of this algorithm, it is applied in a specific coding scheme so that content-based selective coding is allowed.
An educational environment for VHDL hardware description language using the WWW and specific workbench
Authors: A. Etxebarria
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

In this paper, an educational environment for the hardware description language (VHDL) is described. There are three parts that make up this environment: to teach students the fundamental concepts in theory, to design and simulate digital circuits and finally, to check the behavior of the real programmable logic devices (PLD). The theoretical tutorial and the practical manual for the simulations, both evolved using hypertext mark-up language (HTML), allow students to follow the course from any point of the planet through the World Wide Web (WWW). In order to achieve the above mentioned goals, a board has been specifically designed. This device is connected to a shared personal computer. The data transmission and the control of the board has been developed based on a set of Virtual Instruments (VI) designed over LabView (Laboratory Virtual Instrument Engineering Workbench from National Instrument) which is a graphical programming, language that has been widely adopted throughout industry, academia, and research lab as a standard for data acquisition, and instrument control software.
Performance Analysis on Utilizing Directional Antenna in High-Density WLAN
Authors: Guoqing Li, Jing Zhu
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In this paper, we present a performance study of applying directional antenna to infrastructure-based wireless LAN networks. We focus on high-density (HD) deployment, in which multiple cells are operated on the same channel due to limited non-overlapped channels, and thus network capacity is limited mainly by co-channel interference. Network throughput and fairness index are studied for performance evaluation. Based on the simulation results, we provide insights on how directional antenna should be implemented in a HD-WLAN and how performance scales with network and antenna configurations.
Fast implementation methods for Viterbi-based word-spotting
Authors: K. M. Knill, S. J. Young
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper explores methods of increasing the speed of a Viterbi-based word-spotting system for audio document retrieval. Fast processing is essential since the user expects to receive the results of a keyword search many times faster than the actual length of the speech. A number of computational short-cuts to the standard Viterbi word-spotter are presented. These are based on exploiting the background Viterbi phone recognition path that is computed to provide a normalisation base. An initial approximation using the phone transition boundaries reduces the retrieval time by a factor of 5, while achieving a slight improvement in word-spotting performance. To further reduce retrieval time, pattern matching, feature selection, and Gaussian selection techniques are applied to this approximate pass to give a total /spl times/50 increase in speed with little loss in performance. In addition, a low memory requirement means that these approaches can be implemented on any platform, including hand-held devices.
Curve Matching, Time Warping, and Light Fields: New Algorithms for Computing Similarity between Curves
Authors: Alon Efrat, Quanfu Fan, Suresh Venkatasubramanian
Venue: Journal of Mathematical Imaging and Vision (2007)

The problem of curve matching appears in many application domains, like time series analysis, shape matching, speech recognition, and signature verification, among others. Curve matching has been studied extensively by computational geometers, and many measures of similarity have been examined, among them being the Fréchet distance (sometimes referred in folklore as the "dog-man" distance).A measure that is very closely related to the Fréchet distance but has never been studied in a geometric context is the Dynamic Time Warping measure (DTW), first used in the context of speech recognition. This measure is ubiquitous across different domains, a surprising fact because notions of similarity usually vary significantly depending on the application. However, this measure suffers from some drawbacks, most importantly the fact that it is defined between sequences of points rather than curves. Thus, the way in which a curve is sampled to yield such a sequence can dramatically affect the quality of the result. Some attempts have been made to generalize the DTW to continuous domains, but the resulting algorithms have exponential complexity.In this paper we propose similarity measures that attempt to capture the "spirit" of dynamic time warping while being defined over continuous domains, and present efficient algorithms for computing them. Our formulation leads to a very interesting connection with finding short paths in a combinatorial manifold defined on the input chains, and in a deeper sense relates to the way light travels in a medium of variable refractivity.
Melange: creating a "functional" internet
Authors: Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scott, Ripduman Sohan
Venue: Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 (2007)

Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems. Type-safe languages eliminate many errors but are not used to due to the perceived performance overheads. We combine two techniques to eliminate this performance penalty in a practical fashion: strong static typing and generative meta-programming. Static typing eliminates run-time type information by checking safety at compile-time and minimises dynamic checks. Meta-programming uses a single specification to abstract the low-level code required to transmit and receive packets. Our domain-specific language, MPL, describes Internet packet protocols and compiles into fast, zero-copy code for both parsing and creating these packets. MPL is designed for implementing quirky Internet protocols ranging from the low-level: Ethernet, IPv4, ICMP and TCP; to the complex application-level: SSH, DNS and BGP; and even file-system protocols such as 9P. We report on fully-featured SSH and DNS servers constructed using MPL and our OCaml framework Melange, and measure greater throughput, lower latency, better flexibility and more succinct source code than their C equivalents OpenSSH and BIND. Our quantitative analysis shows that the benefits of MPL-generated code overcomes the additional overheads of automatic garbage collection and dynamic bounds checking. Qualitatively, the flexibility of our approach shows that dramatic optimisations are easily possible.
The bootstrap applied to passive acoustic aircraft parameter estimation
Authors: D. C. Reid
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper proposes and demonstrates a practical parameter estimation scheme for estimating the height, speed, range and acoustic frequency of an overflying aircraft. This scheme is based on the phase of the acoustic signal emitted by the aircraft as heard by a stationary observer. Bootstrap techniques are employed to determine confidence bounds for the aircraft parameters given only a single acoustic realisation. This estimation scheme, and the novel use of the bootstrap, are demonstrated by computer simulation and with aircraft acoustic data which was collected by the authors under accurately monitored experimental conditions.
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
Authors: Crina Grosan, Ajith Abraham
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow occurs from a source node to a destination node in a certain direction subject to a cost constraint. In this paper, a new approach for dealing with this problem is proposed. The proposed algorithm uses a special way to build valid solutions and an improvement technique to adjust the path. Some numerical experiments are performed using randomly generated networks having 25 - 200 nodes. Empirical results are compared with the results obtained using Genetic Algorithms which is an established technique for solving networking problems.
Providing for practice in Computer Science I
Authors: A. N. Kumar
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

In Computer Science I, students are expected to master the tools of programming as well as learn how to apply them to solve problems. However, most Computer Science textbooks do not provide sufficient exercises or problems to help students practice what they learn. Without such practice, students tend to have a shallow understanding of the programming constructs, and are inadequately prepared to apply the constructs to solve problems. We may use courseware to address this problem of insufficient exercises and examples in textbooks. A courseware module may be built for each topic, which includes/presents an infinite source of examples as well as problems. We are currently building such courseware modules to teach the semantics of programming language constructs. Although the modules are designed for the C programming language, most of them can be easily generalized to any other language. Each of the courseware modules addresses three pedagogical concerns: analysis, synthesis and testing.
What Makes Software Architecture-Based Testing Distinguishable
Authors: Henry Muccini
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Has Software Architecture-based testing any characteristic which makes it unique with respect to other testing techniques? This recurrent question will be analyzed in this short paper, providing some initial solution, while leaving ample space for discussion.
Static error detection using semantic inconsistency inference
Authors: Isil Dillig, Thomas Dillig, Alex Aiken
Venue: ACM SIGPLAN Notices (2007)

Inconsistency checking is a method for detecting software errors that relies only on examining multiple uses of a value. We propose that inconsistency inference is best understood as a variant of the older and better understood problem of type inference. Using this insight, we describe a precise and formal framework for discovering inconsistency errors. Unlike previous approaches to the problem, our technique for finding inconsistency errors is purely semantic and can deal with complex aliasing and path-sensitive conditions. We have built a nullde reference analysis of C programs based on semantic inconsistency inference and have used it to find hundreds of previously unknown null dereference errors in widely used C programs.
Innovations in teaching creative engineering at the freshmen level
Authors: A. Warsame, P. O. Biney, J. O. Morgan
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The complexity of modern engineering systems calls for an integrated design approach in the industry today. A careful review of the educational approach to design indicates that there is not enough design integration in the engineering curriculum, resulting in intensive retraining of graduates once they enter the work force. It is advantageous to start integration of design into the engineering curriculum at the freshman level, where engineering creativity can be effectively introduced. The second course of a two-semester freshmen Creative Engineering sequence is the focus of the freshmen design plans presented in this paper. This course sequence was the result of a NSF funded project on "Development of a Freshman Engineering Curriculum" at Prairie View A&M University. A successfully tested innovative approach for teaching design at the freshmen level is discussed. The ability of freshmen to design, fabricate and test simple engineering systems is also discussed and demonstrated. The result of this strategy is that the students are able to work in teams on integrated projects (such as the Sunrayce, FutureCar Challenge and Hybrid Vehicle projects) required in the senior year. This experience makes the student highly successful in the modern design environment.