ppxscal/embedding_network huggingface dataset:
Robust tests for stuck-open faults and design for testability of reconvergent fan-out CMOS logic networks
Authors: F. Darlay, B. Courtois
Venue: Proceedings of the conference on European design automation (1990)

This paper addresses the problem of generating robust tests (tests which are efficient even in the presence of arbitrary delays) for stuck-open faults, in CMOS logic networks. Our approach consists of a topological analysis leading to the definition of a criterion which allows us to distinguish between robustly and non-robustly testable gates. We also present a new design for testability method, to be applied to non-robustly testable gates.
Efficient Commit Processing of Web Transactions Using Priority Scheduling Mechanism
Authors: M. Younas, I. Awan
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

This paper proposes a novel approach for the efficient commit processing of Web transactions. The approach is based on the priority active network scheduling mechanism. This approach takes into account the actual queuing delay of the network nodes involved in the commit processing of Web transactions. Using this approach, the queuing delays for the high priority messages (such as commit/abort) can significantly be reduced. Consequently, the performance of the commit processing is improved as response time of the nodes responsible for making decisions is reduced. This approach can be used to improve the performance of the existing commit protocols of Web transactions.
A disk head scheduling simulator
Authors: Steven Robbins
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Disk head scheduling is a standard topic in undergraduate operating systems courses. Disk drives were once fairly simple devices with little intelligence. Disk head scheduling and bad block mapping were done exclusively by operating systems. As disk drives became larger and faster, they took on some of these tasks. Modern drives often have a large cache and hide their internal structure from the outside world. In spite of changes in disk technology, the teaching of disk head scheduling has changed little over the last decade. This paper describes a disk head scheduling simulator that allows students to explore traditional disk scheduling algorithms as well as the consequences of modern disk technology. The simulator, which is written in Java and is freely available, can be run remotely from a browser or downloaded for local execution. We present methods for modifying the traditional curriculum to make the presentation of disk head scheduling more relevant and interesting.
Sea of Images: A Dense Sampling Approach for Rendering Large Indoor Environments
Authors: Daniel G. Aliaga, Thomas Funkhouser, Dimah Yanovsky, Ingrid Carlbom
Venue: IEEE Computer Graphics and Applications (2003)

Visual simulation of large real-world environments is one of the grand challenges of computer graphics. Applications include remote education, virtual heritage, specialist training, electronic commerce, and entertainment. The sea of images image-based approach provides interactive and photorealistic walkthroughs of complex indoor environments. The strategy obtains a dense sampling of viewpoints in a large static environment with omnidirectional images. A motorized cart is used to capture omnidirectional images every few inches on an eye-height plane throughout an environment. They then compress and store the images in a multiresolution hierarchy suitable for real-time prefetching to produce interactive walkthroughs.Finally, they render novel images for a simulated observer viewpoint using a feature-based warping algorithm. They demonstrate photorealistic walkthroughs of real-world environments reproducing specular reflections and occlusion effects while rendering 20-30 frames per second.
Towards construction of business components: an approach to development of web-based application systems
Authors: Dentcho N. Batanov, Somjit Arch-int
Venue: Practicing software engineering in the 21st century (2003)

Global competition among today's enterprises forces their business processes to evolve constantly, leading to changes in corresponding Web-based application systems. Most existing approaches that extend the traditional software engineering to develop Web-based application systems are based on object-oriented methods. Such methods emphasize modeling individual object behaviors instead of system behavior. This chapter proposes the Business Process-Based Methodology (BPBM) for developing such systems. It uses a business process as a unified conceptual framework for analyzing relationships between a business process and associated business objects and for identifying business activities and designing object-oriented components called business components. We propose measures for coupling and cohesion measurement in order to ensure that these business components enable the potential reusability. These business components can more clearly represent semantic system behaviors than linkages of individual object behaviors. A change made to one business process impacts some encapsulated atomic components within the respective business component without affecting other parts of the system. A business component is divided into parts suitable for implementation of multitier Web-based application systems.
Modeling of student's quality by means of GMDH algorithms
Authors: Pavel Náplava, Miroslav Šnorek
Venue: Systems Analysis Modelling Simulation (2003)

This article presents a method of modeling based on a data set by means of the GMDH algorithms. The data set contains information about fresh students of the Faculty of Electrical Engineering, Czech Technical University of Prague, Czech Republic (CTU, FEE). The motivation for our investigation was to discover, whether and how a particular student will be successful in his/her university studies. The data set was mined from official study application forms. They reflect student's personality, type and results (grades) from high school and entrance examination. These results serve as input vectors for prediction of his/her study results after the 1st semester. The results produced by the model were then compared with the real ones. The second motivation for our investigation was to find the significance of a particular input vector component, because it enables us to identify possible weak points of a student. As appropriate tools the GMDH neural networks (both linear and nonlinear) have been used.
Dimensioning optical networks under traffic growth models
Authors: Tapan Kumar Nayak, Kumar N. Sivarajan
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

In this paper, we consider the problem of dimensioning a large optical wavelength-division multiplexing (WDM) network assuming the traffic is growing over time. Traffic between pairs of nodes is carried through lightpaths which are high-bandwidth end-to-end circuits, occupying a wavelength on each link of the path between two nodes. We are interested in dimensioning the WDM links so that the first lightpath request rejection will occur, with high probability, after a specified period of time T. Here we introduce the concept of capacity exhaustion probability--the probability that at least one lightpath request will be rejected in the time period (0,T) due to lack of bandwidth/capacity on some link. We propose a network dimensioning method based on a traffic growth model which eventually results in a nonlinear optimization problem with cost minimization as the objective and route capacity exhaustion probabilities as the constraints. Computation of exact capacity exhaustion probabilities requires large computing resources and is thus feasible only for small networks. We consider a reduced load approximation for estimating capacity exhaustion probabilities of a wavelength routed network with arbitrary topology and traffic patterns. We show that the estimates are quite accurate and converge to the correct values under a limiting regime in the desired range of low-capacity exhaustion probabilities.
Project LOCAL: bridging the gap
Authors: Robert N. Haven
Venue: ACM SIGCUE Outlook (1975)

Project LOCAL, a not-for-profit regional consortium, offers a broad spectrum of in-service training courses tailored to meet the needs of educators in various disciplines and levels of experience. The purpose of these offerings is to bridge the communication gap between innovative centers in computer-oriented education and staff members in Boston area schools.The number of schools trying to use the computer in instruction is increasing but the computer's potential is not being fully realized. This is largely the result of a scarcity of adequate information and training to prepare school staff members who want to use computers in instruction.In LOCAL's curriculum, teachers and administrators can obtain an introduction to computer-oriented techniques in a variety of areas.
ICSE 2003 workshop on software architectures for dependable systems
Authors: Rogério de Lemos, Cristina Gacek, Alexander Romanovsky
Venue: ACM SIGSOFT Software Engineering Notes (2003)

This workshop summary gives a brief overview of a one-day Workshop on "Software Architectures for Dependable Systems" held in conjunction with ICSE 2003.
Calibration of Open Interconnect Yield Models
Authors: D. K. de Vries, P. L. C. Simon
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

The critical area model is commonly used to estimate the yield loss sensitivity of products to random failure mechanisms, especially shorts. With the shift to dual-damascene copper backends, interconnect opens have become a very important factor in product yield loss. On via chain test structures, we observe a strong dependence of the yield loss as a function of via density. Using the critical area model, we calculate the sensitivity of via chains to metal opens and via opens. By comparison with experimental data, we show that the difference in via chain yields between aluminum line-tungsten plug and dual-damascene copper technologies can be adequately explained by the difference in predominant yield loss mechanism. The presented model allows accurate calibration of yield models for backend yield loss due to opens.
Composing Web services on the Semantic Web
Authors: Brahim Medjahed, Athman Bouguettaya, Ahmed K. Elmagarmid
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Service composition is gaining momentum as the potential silver bullet for the envisioned Semantic Web. It purports to take the Web to unexplored efficiencies and provide a flexible approach for promoting all types of activities in tomorrow&rsquo;s Web. Applications expected to heavily take advantage of Web service composition include B2B E-commerce and E-government. To date, enabling composite services has largely been an ad hoc, time-consuming, and error-prone process involving repetitive low-level programming. In this paper, we propose an ontology-based framework for the automatic composition of Web services. We present a technique to generate composite services from high-level declarative descriptions. We define formal safeguards for meaningful composition through the use of composability rules. These rules compare the syntactic and semantic features of Web services to determine whether two services are composable. We provide an implementation using an E-government application offering customized services to indigent citizens. Finally, we present an exhaustive performance experiment to assess the scalability of our approach.
Runtime Optimization of IEEE 802.11 Wireless LANs Performance
Authors: Luciano Bononi, Marco Conti, Enrico Gregori
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--IEEE 802.11 is the standard for Wireless Local Area Networks (WLANs) promoted by the Institute of Electrical and Electronics Engineers. Wireless technologies in the LAN environment are becoming increasingly important and the IEEE 802.11 is the most mature technology to date. Previous works have pointed out that the standard protocol can be very inefficient and that an appropriate tuning of its congestion control mechanism (i.e., the backoff algorithm) can drive the IEEE 802.11 protocol close to its optimal behavior. To perform this tuning, a station must have exact knowledge of the network contention level; unfortunately, in a real case, a station cannot have exact knowledge of the network contention level (i.e., number of active stations and length of the message transmitted on the channel), but it, at most, can estimate it. This paper presents and evaluates a distributed mechanism for contention control in IEEE 802.11 Wireless LANs. Our mechanism, named Asymptotically Optimal Backoff (AOB), dynamically adapts the backoff window size to the current network contention level and guarantees that an IEEE 802.11 WLAN asymptotically achieves its optimal channel utilization. The AOB mechanism measures the network contention level by using two simple estimates: the slot utilization and the average size of transmitted frames. These estimates are simple and can be obtained by exploiting information that is already available in the standard protocol. AOB can be used to extend the standard 802.11 access mechanism without requiring any additional hardware. The performance of the IEEE 802.11 protocol, with and without the AOB mechanism, is investigated in the paper through simulation. Simulation results indicate that our mechanism is very effective, robust, and has traffic differentiation potentialities.
Book Reviews
Authors: Fernando Berzal
Venue: Queue (2003)

This wonderful, short book is a pragmatic guide to the realities of managing software projects, and to the pitfalls of guiding research and development projects in general. With brief examples based on the authors’ real-life experiences, the reader sees how “good software practice” in its traditional and literal sense can often lead to something between disaster and frustration. In particular, the authors argue—based on experience with developing lean manufacturing systems—that specifying a software system in its entirety before developing any code ensures there is no flexibility for changes down the road when more is known about the problem. They draw the distinction between creative parts of the development process, during which variability is valued, and later stages, which attempt to stamp out any variances. The latter regime does not really apply to most software development, virtually all of which is a creative endeavor, so mismatches arise when manufacturing-style practices and metrics are applied to software development.
B2B E-Commerce Stages of Growth: The Strategic Imperatives
Authors: Caroline Chan, Paula M. C. Swatman
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Stages-of-growth has been the most popular approach used for strategy development andimplementation. The major stages of growth models such as Gibson and Nolan [1] have been widely discussed and are particularly useful in understanding the implementation of IS in organisations. These models might be more representative of e-commerce implementation, however, if they took into account more recent IS developments such as B2B ecommerce. Using a case study research undertaken in Australia, this study proposes a model of stages ofgrowth based on the use of B2B e-commerce technologies and applications in Australian organisations. Four stages of growth proposed for B2B e-commerce implementation are (i) initial e-commerce; (ii) centralised e-commerce; (iii) looking inward for benefits; and (iv) global e-commerce.
Integrated service mobile internet: RSVP over mobile IPv4&6
Authors: Shing-Jiuan Leu, Ruay-Shiung Chang
Venue: Mobile Networks and Applications (2003)

While the Internet keeps its penetration into every facet of life and every corner of the globe, two things stand out. One is the hunger for high quality of services to convey audio and video data. The other is the desire for ubiquitous connections. Combining the two we have an Internet that is capable of supporting multimedia communications for nomadic users on the move. To have a high quality connection, resource must be allocated along the connection path. The current Internet standard for resource reservation is RSVP (Resource reSerVation Protocol), which is receiver-initiated and allows one-to-one or one-to-many communication to have resource reserved in the path from sender to receiver(s). To support mobile users, the Internet also has the mobile IP standard. Mobile IP allows a mobile host to roam from one subnet to another seamlessly. However, several problems need to be solved before we can support QoS communications for mobile users by applying RSVP to mobile IP. In this paper, we identify four problems related to RSVP over mobile IP. The problems are the resource pre-reservation problem, the RSVP tunneling problem, the common path identification problem, and the mobile proxy problem. We also survey the various solutions proposed by many papers.
On an Estimation of the Effectiveness of Computer Diagnosis of Movement Disorders
Authors: L. A. Gusev, O. Ye. Khutorskaya
Venue: Automation and Remote Control (2003)

A method is suggested for the estimation of a system of the automatic diagnosis of various symptoms of Parkinson's disease. The method is based on the comparison of results of the operation of the diagnostic system with a certain result of a definite stochastic procedure.
Evaluating Overhead and Predictability of a Real-Time CORBA System
Authors: Jianfan Zou, David Levy, Anna Liu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Over the last few years, real-time CORBA are increasingly used in development of distributed real-time applications, in which real-time CORBA and operating system constitute the computing and communication infrastructure upon which the applications execute. However the amount of effort put into studying and evaluating the real-time characteristics of real-time CORBA is still inadequate. In this paper we focus on examining the overhead and predictability of real-time CORBA, which are two of the most important concerns when building real-time applications. Firstly we introduce the desired features in real-time applications and possible sources of unpredictability. Secondly, we evaluate a real-time CORBA implementation : TAO v1.2 on Linux kernel v2.4.18 over 100M Ethernet. It is observed that: 1) the overhead of TAO is acceptable, compared with the equivalent application using TCP/IP socket directly;2) TAO presents rather predictable behaviors under light network traffic, but unpredictability of CORBA invocations increases significantly as the network becomes overloaded. Moreover, we identify that the major source of unpredictability of CORBA invocations is in the TCP/IP stack of Linux rather than in TAO itself.
Hybrid log segmentation for assured damage assessment
Authors: Prahalad Ragothaman, Brajendra Panda
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

A database log is the primary resource for damage assessment and recovery after an electronic attack. The log is a sequential file stored in the secondary storage and it can grow to humongous proportions in course of time. To make the process of damage assessment and recovery more efficient, segmenting the log based on different criteria has been proposed before. But the trade off is that, either segmenting the log involves a lot of computation or damage assessment is a complicated process. In this research we propose to strike a balance through hybrid log segmentation. Our method will reduce the time taken to perform damage assessment while still segmenting the log fast enough so that no intricate computation is necessary. We build our model from a log that was previously segmented based on number of transactions, a time window for transactions to commit or space occupied by committed transactions. While performing damage assessment, we re-segment the log based on transaction dependency. Thus during repeated damage assessment procedures, we create new segments with dependent transactions in them so that the process of damage assessment becomes faster when there are repeated attacks on the system. We have discussed various cases that are applicable and also presented algorithms for each of the cases discussed.
Methods of teaching a computer science course for prospective teachers
Authors: Tami Lapidot, Orit Hazzan
Venue: ACM SIGCSE Bulletin (2003)

This article focuses on a "Methods of Teaching Computer Science in the High School" course (abbreviated MTCS). It presents the rationale and need for the course, and suggests optional course frameworks and implementations that are not limited to a particular programming language, programming paradigm, level of students, or curriculum.
Recognizing deviations from normalcy for brain tumor segmentation
Authors: David Thomas Gering
Venue:  (2003)

A framework is proposed for the segmentation of brain tumors from MRI. Instead of training on pathology, the proposed method trains exclusively on healthy tissue. The algorithm attempts to recognize deviations from normalcy in order to compute a fitness map over the image associated with the presence of pathology. The resulting fitness map may then be used by conventional image segmentation techniques for honing in on boundary delineation. Such an approach is applicable to structures that are too irregular, in both shape and texture, to permit construction of comprehensive training sets. We develop the method of diagonalized nearest neighbor pattern recognition, and we use it to demonstrate that recognizing deviations from normalcy requires a rich understanding of context. Therefore, we propose a framework for a Contextual Dependency Network (CDN) that incorporates context at multiple levels: voxel intensities, neighborhood coherence, intra-structure properties, inter-structure relationships, and user input. Information flows bi-directionally between the layers via multi-level Markov random fields or iterated Bayesian classification. A simple instantiation of the framework has been implemented to perform preliminary experiments on synthetic and MRI data. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)