ppxscal/embedding_network huggingface dataset:
Program design in file structures [by students]
Authors: S. A. Mengel, D. A. Tappan
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The importance of emphasizing design in programming stems from the desire to train students in thinking more about solving the problem than programming the problem. Although sitting in front of the computer causes the student to think that he or she is getting closer to a working program with every passing minute, the student may actually spend more time on the program than necessary. More time is spent because the student may have written the program with the wrong approach and figured that out only after many hours of debugging. Further, the program may not be organized very well, which also leads to long debugging periods. To help the student streamline the development of programs, formulating a design of the program was necessary before actual code could be written in a senior-level file structures course. The design component became necessary as the instructor watched students fail to complete the more complex B-tree and hashing programs. The design component also confirmed the correct or incorrect thought processes of the student so that incorrect notions could be corrected before programming was completed. The design component includes drawing the file structure to be implemented and examples of the operations upon it. The design then goes into further detail by requiring the student to split the problem up into subprograms specified in pseudocode. The design process undertaken by the students is analyzed and reported in this paper as to how it helped the students to understand the file structure concepts better.
RTL Test Point Insertion to Reduce Delay Test Volume
Authors: Kedarnath J. Balakrishnan, Lei Fang
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

In this paper, a novel test point insertion methodology is presented for RTL designs that aims to reduce the data volume of scan-based transition delay tests. Test points are identified based on functional information of RTL primitives using a satisfiability based algorithm. A subset of scan flip-flops is identified for conversion to enhanced-scan, i.e., the values are stored in two flip-flops thereby removing the circuit dependency of the second pattern in broadside transition tests. Using the proposed methodology, the number of specified bits required to test transition faults is reduced thus improving test set compaction. The advantage of test point insertion at RTL is that the extra delay due to multiplexers can be absorbed during logic synthesis. Experimental results show that the proposed methodology can reduce transition test data volume by more than 30% with 1% area overhead and without violating timing constraints.
High Throughput Compression of Double-Precision Floating-Point Data
Authors: Martin Burtscher, Paruj Ratanaworabhan
Venue: Proceedings of the 2007 Data Compression Conference (2007)

This paper describes FPC, a lossless compression algorithm for linear streams of 64-bit floating-point data. FPC is designed to compress well while at the same time meeting the high throughput demands of scientific computing environments. On our thirteen datasets, it achieves a substantially higher average compression ratio than BZIP2, DFCM, FSD, GZIP, and PLMI. At comparable compression ratios, it compresses and decompresses 8 to 300 times faster than the other five algorithms.
Semantic approach to event processing
Authors: Opher Etzion
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

Various approaches have been taken towards modelling and definition of event processing systems, the dominant ones being: using rules, using SQL extensions, and using scripts. Yet, there are some semantic structures that are expressed by all of them, providing the opportunity to raise the level of abstraction and create semantic model of event processing. This talk will describe the major different types of event processing from the point of view of the role it plays in computing, describe some common design patterns, and then describe the idea of the semantic approach to event processing, the semantic abstractions that are required in order to achieve it, and its possible automatic mappings to various implementations. The concepts will be demonstrated by a comprehensive example.
Role of consulting engineering experiences for civil engineering technology faculty and other engineering educators in the next century
Authors: A. T. Rose
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Remaining current in one's field is a requirement for promotion and tenure in engineering and engineering technology faculty positions. Technology and engineering, however, are changing at an ever-increasing pace. In the next century, engineering educators will be challenged to keep up with an increasing number of new developments within their fields of expertise. Research and industrial experiences are often used to maintain currency. Incorporating these experiences into the curriculum keeps the education of future engineers and engineering technologists current as well. Industrial experiences for civil engineering faculty often involve relationships with local consulting engineering firms. Consulting experiences can provide multiple benefits for civil engineering faculty and their students. This paper discusses consulting engineering as a means of remaining current in the practice of civil engineering and integrating consulting experiences into the curriculum. Also discussed are the benefits of consulting experiences for professional development of civil engineering technology faculty. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A novel method for power line interference suppression
Authors: G. Keratiotis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

A novel method to suppress the power line interference induced into telephone lines that are in proximity to power conductors is proposed. A phase-locked loop is used to synchronize the interference signal with an anti-phase waveform, which is stored in a buffer. The anti-phase signal is injected on the line and the samples of the residual signal are used to update the anti-phase waveform. Computer simulations are used to compare the novel adaptive phase-locked buffer (APLB) approach with the traditional least mean squares (LMS) algorithm in an adaptive noise cancellation configuration. The new technique achieves 15 dB further suppression compared to LMS and since it can be implemented on a single digital signal processor (DSP) chip it proves to be a very efficient solution to the power line interference problem.
A Hike through a Post-EJB J2EE Web Application Architecture, Part III
Authors: Konstantin Laufer, George K. Thiruvathukal, Benjamin Gonzalez
Venue: Computing in Science and Engineering (2007)

By incorporating automated component, integration, and acceptance testing into the various tiers of a lightweight Java 2 Enterprise Edition (J2EE) Web application architecture, developers can shorten the development cycle and increase the quality of their work.
Static Path Planning for Mobile Beacons to Localize Sensor Networks
Authors: Rui Huang, Gergely V. Zaruba
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

In this paper, we study the static path planning problem with wireless sensor network localization as the primary objective. We consider a model in which sensors are assumed to be uniformly deployed to a predefined deployment area. We then deploy a robot to serve as a mobile beacon to enable the localization of the sensor nodes. The robot follows a pre-determined static path while periodically broadcasting its current location coordinates to the nearby sensors. The static path planning problem looks for good paths that result in better localization accuracy and coverage of the sensor network while keeping the path length bounded. We propose two new path types, CIRCLES and S-CURVES, that are specifically designed to reduce the collinearity during localization. We compare our solution with existing ones using the Cramer Rao Bound (CRB) as the evaluation tool, which gives an unbiased evaluation regardless of localization algorithm used. The evaluation shows that our solutions cope with collinearity in a more effective manner than previous solutions. Our solutions provide significantly better localization accuracy and coverage in the cases where collinearity is the greatest problem.
A Comparative Study of Monitoring Tools for Pattern-Centric Behavior
Authors: Benjamin Tyler, Jason O. Hallstrom, Neelam Soundarajan
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

The benefits of design patterns in the design phase are well-established. We claim that patterns can --and should-- play equally important roles in later stages of the lifecycle. But to make this feasible, we need to develop suitable ways to precisely specify the requirements associated with the use of specific patterns, and runtime monitoring tools to identify any violations of these requirements. We summarize a specification and monitoring approach focused on pattern-centric behavior that we developed previously, evaluate alternative ways to monitor systems based on the formalism, and discuss the overall utility of the specification and monitoring approach in the context of a case study.
Shared backup tree protection in MP/spl lambda/S networks
Authors: T. Lan, K. Steenhaut, A. Nowe
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Multi-Protocol Lambda Switching (MP/spl lambda/S) has been recently applied in the optical network control plane to provide fast lightpath provisioning. Shared backup tree lightpath protection is a promising paradigm in an MP/spl lambda/S network because of its fast recovery from single failure and its efficiency in terms of consumed capacity. We propose a heuristic that yields an efficient placement of working paths and backup trees in polynomial time. The experimental results show that the heuristic can save more than 15% capacity resources compared to dedicated path protection in existing optical wide area network topologies.
Personality and Emotion-Based High-Level Control of Affective Story Characters
Authors: Wen-Poh Su, Binh Pham, Aster Wardhani
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Human emotional behavior, personality, and body language are the essential elements in the recognition of a believable synthetic story character. This paper presents an approach using story scripts and action descriptions in a form similar to the content description of storyboards to predict specific personality and emotional states. By adopting the Abridged Big Five Circumplex (AB5C) Model of personality from the study of psychology as a basis for a computational model, we construct a hierarchical fuzzy rule-based system to facilitate the personality and emotion control of the body language of a dynamic story character. The story character can consistently perform specific postures and gestures based on his/her personality type. Story designers can devise a story context in the form of our story interface which predictably motivates personality and emotion values to drive the appropriate movements of the story characters. Our system takes advantage of relevant knowledge described by psychologists and researchers of storytelling, nonverbal communication, and human movement. Our ultimate goal is to facilitate the high-level control of a synthetic character.
Expertise Knowledge-Based Policy Refinement Process
Authors: Taufiq Rochaeli, Claudia Eckert
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

We present an approach to automated workflow policy refinement process supported by the domain experts' knowledge. The expertise knowledge about refinement patterns are captured by using the pattern paradigm. The combination of the temporal logic formalism and the description logic formalism facilitates the automated policy refinement process.
Modeling and control techniques for a class of mobile-robot error recovery problems
Authors: Ravi Balasubramanian
Venue:  (2006)

A robot's locomotion mode fails when its environmental contacts fail, a situation called a locomotion error. For example, a legged robot cannot move when its leg becomes trapped in a crevice, and a wheeled robot is handicapped when its wheels skid. How can a robot recover when its standard locomotion mode fails? One way is to utilize any remaining freedoms to move the robot to a situation where the robot's standard locomotion mode is again feasible. However, planning and control for such unconventional motion is difficult, since the relationship between the robot's controls and its motion in a locomotion error is unclear. This complexity when combined with the uncertainty in environmental interaction (perceived as an "element of luck") in a locomotion error appears as a lack of structure, inducing operators to sometimes use random escape maneuvers. This thesis proposes finding recovery strategies by exploiting the structure inherent to the robot's constrained mobility and environmental interaction in the locomotion error. A robot equipped with multiple locomotion modes can choose between them depending on the circumstance, ultimately contributing to robust mobility. While robotic locomotion fails in many ways depending on the robot's design and the environmental interaction, this thesis finds novel recovery modes involving a combination of direct actuation and dynamically coupled actuation for two specific locomotion errors: first, a high-centered legged robot, where the robot's legs dangle in air; and second, a car trapped in a slippery pit. In the high-centered robot problem, we present a novel locomotion mode called "legless locomotion", that allows the robot to locomote by rocking its body back and forth using leg swing without feedback about the robot's body motions. We use experiments and computer simulation to identify legless locomotion's properties and use simple models to derive an approximate control technique. In the car-in-ditch problem, we use computer simulation to find a control strategy involving wheel torques and an active-suspension that allows the car to roll out of the pit, while minimizing work done and perturbations to the car body. Finally, we present a classification structure for locomotion errors based on environmental influence.
Miniaturized fluorescence excitation platform with optical fiber for bio-detection chips
Authors: Hsiharng Yang, Chung-Tze Lee, Fuh-Yu Chang
Venue: Microsystem Technologies (2007)

This paper presents a new research study on the fabrication of a fluorescence bio-detection chip with an optical fiber transmission platform. Anisotropic wet etching on (100) silicon wafers to fabrication V-groove for optical fiber alignment and micro-mirror were included. Combined with anodic bonding technique to adhere glass, silicon structure and optical fiber for a fluorescence excitation platform was completed. In this study, a 40% KOH etching solution was used to study the parameter effect. The results show that the working temperature is the main parameter that significantly effects the etch rate. The anisotropic etching resulted in 54.7&#x00b0; reflective mirrors and the reflectivity for the optical beam was also examined. The surface roughness of the micro-mirror is Ra 4.1&#x00a0;nm measured using AFM providing excellent optical reflection. The incident light and beam profiles were also examined for further study. This study shows that this micro-platform is adaptable for fluorescence bio-detection.
A novel high-resolution algorithm for complex-direction search
Authors: R. C. Qiu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

The location dependent effect of the acoustic field received by a linear array is modeled as an extra "loss" factor in the complex spectral variable. A high-resolution algorithm combining the singular value decomposition method and the eigen-matrix pencil method is then employed to find the complex directions representing the incoming directions and the location dependent factors of multipath and multimode arrivals. Five key features (namely, noise immunity, robustness, resolution, accuracy, and physical insight) of the proposed algorithm are studied using numerical examples.
Structure-Free Data Aggregation in Sensor Networks
Authors: Kai-Wei Fan, Sha Liu, Prasun Sinha
Venue: IEEE Transactions on Mobile Computing (2007)

Data aggregation protocols can reduce the communication cost, thereby extending the lifetime of sensor networks. Prior works on data aggregation protocols have focused on tree-based or cluster-based structured approaches. Although structured approaches are suited for data gathering applications, they incur high maintenance overhead in dynamic scenarios for event-based applications. The goal of our work is to design techniques and protocols that lead to efficient data aggregation without explicit maintenance of a structure. As packets need to converge spatially and temporally for data aggregation, we propose two corresponding mechanisms—Data-Aware Anycast at the MAC layer and Randomized Waiting at the application layer. We model the performance of the combined protocol that uses both the approaches and show that our analysis matches with the simulations. Using extensive simulations and experiments on a testbed with implementation in TinyOS, we study the performance and potential of structure-free data aggregation.
Analysis of Interconnection Networks Based on Cayley Graphs of Strong Generating Sets
Authors: Jen-peng Huang, S. Lakshmivarahan, S. K. Dhall
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper describes a class of interconnection networks based on Cayley graph of (S_n, \Omega_CT)> where S_n is the symmetric group of degree n and order n! and \Omega_CT is the generator set consisting of all the n (n -1)/2 transpositions, called the complete transposition graph (CTG). A complete enumeration of a set of node disjoint paths for CTG is given which in turn implies that CTG has maximum fault-tolerance.
A study of software input failure propagation mechanisms
Authors: Carol Smidts
Venue:  (2006)

Probabilistic Risk Assessment (PRA) is a well-established technique to assess the probability of failure or success of a system. Classical PRA does not consider the contributions of software to risk. Dr. B. Li and C. Smidts have established a framework to integrate software into PRA which recognizes the existence of four classes of risk contributors: functional, input, output and support failures. Input/Output failures have been shown to make up 57.4 % of the failures experienced during software development of major aerospace systems and have been at the origin of a number of major accidents such as the Mars Polar Lander. This research quantifies the contribution of the input failures. More specifically, this dissertation (1) defines the concept of input failure, (2) studies the related propagation mechanisms, (3) estimates the propagation probability for different types of input failures, and (4) applies the fault propagation analysis to the framework of integrating software into PRA. The dissertation defines the concept of artifact as a reference point to identify expected inputs and consequently input failures (inputs which differ from the expected ones). Input failures are divided into value-related failures (including value, range, type and amount failures) and time-related failures (including time, rate and duration failures). Value failures are examined first. The concept of masking areas and flat parts is defined, and the dissertation proposes an Image Reconstruction Method (IRM) to estimate the propagation probability of input value failures. This method is proven to require less number of test cases than one that could be based on random testing to reach the same relative error. For the other input failure modes, the dissertation reveals how they transform to the data state error and formalizes their propagation criteria so that the IRM can be applied to estimate the propagation probability. The contributions are thus: (1) Clear definition of the concept of input failure; (2) Definition of a systematic process of identification and quantification of the contributions of input failures to risk; (3) Systematic analysis of the propagation mechanisms of each type of input failures.
On the Expressiveness of Timed Coordination via Shared Dataspaces
Authors: Isabelle Linden, Jean-Marie Jacquet
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Since Linda, many differents coordination models using shared dataspaces have been developped. However, a few only have incorporated the notion of time. This paper builds upon previous work to study the expressive power of two families of timed coordination models based on shared dataspaces. The first one relies on Linda's communication primitives whereas the second relies on the more general notion of multi-set rewriting, incorporated, for instance, in Gamma. We analyse the expressiveness increase provided by the primitives in each of the two families and also compare the expressiveness power of the two families.
Studying ENUM Performance with Modeling and Simulation
Authors: Sandoche Balakrichenan, Thomas Bugnazet, Monique Becker
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The new IETF protocol ENUM uses the DNS to bind existing phone numbers into set of information's (email address, SIP phone number etc.). Success of ENUM will depend on whether the DNS can achieve a performance similar to the database used in classical voice services. In order to study the DNS performance we designed a new way to measure and model a single DNS server behavior. We also modeled and measured the IP links connecting the DNS devices: Resolver, Cache server and Authoritative servers. Finally we created a simulation model which enables us to simulate ENUM traffic. We then use the parameters obtained from the previous two models as input values into this simulator. The numerical results obtained from the simulation, was compared to real measurements in order to validate the global model. We plan to use the simulator to study different scenarios by varying different parameters. This will lead to recommendations of the new ENUM protocol to achieve the best performance.
An effective offloading middleware for pervasive services on mobile devices
Authors: Shumao Ou, Kun Yang, Jie Zhang
Venue: Pervasive and Mobile Computing (2007)

The practical success of pervasive services running in mobile wireless networks and devices relies on their ability to provide effective and efficient offloading support, so as to satisfy the increasing demand for mobile devices to run heavier applications (e.g. those running on desktop PCs). Offloading is an effective mechanism for leveraging the severity of resource constrained mobile devices by migrating some computing load to nearby resource-rich surrogates (e.g. desktop PCs, servers) on home networks or their extension. This paper proposes a light-weight and efficient offloading middleware, which provides runtime offloading services for resource constrained mobile devices. The middleware considers multiple types of resources (i.e. memory, CPU and bandwidth) and carries out application partitioning and partition offloading in an adaptive and efficient manner. The corresponding algorithms are presented. The evaluation outcomes indicate the effectiveness and efficiency of this service offloading solution.