ppxscal/embedding_network huggingface dataset:
Hardware dissection in computer science as a tool to improve teamwork
Authors: M. Feldgen
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

In our subject: "File Organization and Processing", a classical computer science subject, we decided to introduce a floppy disk drive hardware dissection in order to motivate students with a different type of work, a true engineer's work as it is perceived by society. We asked teams to disassemble, reassemble, explain the working principles, compare, and write an assembly-disassembly manual of the drive. The authors present their experiences and our outcomes. We found that dissection is a motivating task that not only worked as desired, increasing the retention, but also improved the team productivity. Each team managed to build an adequate environment to develop its own style of work. The mixed nature of the requested work, with tactile, intellectual, research, analysis and organizational requirements was addressed to each member's personal style and allowed them to find a common way of working, subordinating their personal prominence to the efficiency of the whole.
Analysis of the adaptive matched filter algorithm for cases with mismatched clutter statistics
Authors: Y. Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In practical radar applications of the adaptive matched filter algorithm, the covariance matrix for the clutter-plus-noise is typically estimated using data taken from range cells surrounding the cell under test. In a nonhomogeneous environment, this can lead to a mismatch between the mean of the estimated covariance matrix and the true covariance matrix for the range cell under test. Closed form expressions are provided, which give the performance for such cases. These equations are exact in some cases and provide useful approximate results in others. Performance depends on a small number of important parameters. These parameters describe which types of mismatches are important and which are not. Numerical examples illustrate how the performance varies with each of the important parameters. Monte Carlo simulations are included which closely match the predictions of our equations.
Choice of the best alternative in case of a continuous set of states of nature-application of fuzzy numbers
Authors: Dorota Kuchta
Venue: Fuzzy Optimization and Decision Making (2007)

On the basis of a known application of an order weighted averaging operator to the decision making in the case of a discrete set of states of nature, a general approach to the case of a continuous set of states of nature is proposed. The general approach encompasses various types of attitudes of the decision maker, expressed in the form of fuzzy numbers.
A Grid-Based Stable Routing Algorithm in Mobile Ad Hoc Networks
Authors: Zhengyu Wu, Hantao Song, Shaofeng Jiang, Xiaomei Xu
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Since nodes in the mobile ad hoc networks (MANETs) network move freely and randomly, routes often get disconnected. The major challenge for MANETs is therefore to implement routing protocols that must respond to changes in the network topology in order to maintain and reconstruct the routes in a timely manner as well as to establish reliable routes. In this paper, we propose a new routing algorithm called Grid-based Stable Routing Algorithm (GSRA). GSRA exploits the concept of a routing protocol called GRID. The main difference between these two protocols is that GSRA considers grid head stability and route stability but the GRID does not. In GSRA, grid partitioning is the same as in the GRID routing protocol. Each grid zone selects a grid head to route. Also, GSRA defines a new parameter called grid head stability to select stable grid head. In routing discovery, each node receives the RREQ packet and uses the link stability metric to evaluate link stability. The destination node collects several feasible routes and then selects the most stable route according to end-to-end reliability. Simulation results indicate that GSRA has a higher packet delivery ratio, lower end-to-end delay and lower routing load than GRID and AODV.
A Verified Formal Model of a VC Generator
Authors: R. D. Arthan
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

This paper describes some modelling work carried out to inform understanding of an Ada verification system. It presents a simple formal model in Z of a refinement notation comprising a miniature, but complete, imperative programming language annotated with formal specifications. The semantics of that programming language and the notion of correctness relative to the specification annotations is defined. A semantic model of a verification condition generator is given which can be proved to be sound with respect both to the programming language semantics and to the intensional semantics of the specification annotations. The specifications and proofs were prepared using the ProofPower system and all proofs have been fully machine-checked. We argue that the use of appropriate abstractions and good tools make machine-checked proof a realistic and beneficial target.
The use of Hough transforms in spatial error concealment
Authors: D. L. Robie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

During the transmission of video, errors can cause the loss of single or multiple macroblocks in MPEG-2 video. Although there are many ways to correct these losses, the use of spatial concealment, which relies on data from surrounding macroblocks in the same frame, is an invaluable scheme. This paper describe a spatial concealment scheme based the Hough transform and image segmentation. The image is initially segmented into bright foreground, dark foreground and background. The Hough transform is used to determine the best direction for filtering or interpolation of the foregrounds. The results show a significant improvement over the use of bidirectional interpolation especially in the area of significant edges and texture. It also improves upon other directional schemes by better isolating and preserving edge features.
The Emergence of the Mobile Enterprise: A Value-Driven Perspective
Authors: Rahul C. Basole
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The mobile enterprise is an emerging organizational form that has resulted in a paradigm shift of how business is done. However, only little theoretical work has been done to explore what actually constitutes a mobile enterprise. This article addresses this definitional issue by exploring the salient value propositions that drive the emergence of the mobile enterprise, identifying categories of workers that can benefit from mobile ICT, reviewing what current solutions support the mobile workforce, identifying the challenges of adopting and implementing these solutions, and providing propositions for future theoretical and empirical research.
Bootstrap methods for adaptive signal detection
Authors: Hwa-Tung Ong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A general bootstrap procedure for signal detection is presented. Two methods under this general procedure are given. One method requires a regression model to be available to generate the bootstrap data while the other method assumes a pivot. Examples of detecting known signals, signals with unknown parameters and random signals are given. Performance in terms of false alarm and detection rates of the bootstrap methods are found using simulations and compared with the performance of the constant false alarm rate (CFAR) matched filter, the CFAR subspace matched filter bank and a test for zero skewness. Results in an application using ground penetrating radar data to detect buried landmines are also presented.
How Long Will It Take to Fix This Bug?
Authors: Cathrin Weiss, Rahul Premraj, Thomas Zimmermann, Andreas Zeller
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

Predicting the time and effort for a software problem has long been a difficult task. We present an approach that automatically predicts the fixing effort, i.e., the person-hours spent on fixing an issue. Our technique leverages existing issue tracking systems: given a new issue report, we use the Lucene framework to search for similar, earlier reports and use their average time as a prediction. Our approach thus allows for early effort estimation, helping in assigning issues and scheduling stable releases. We evaluated our approach using effort data from the JBoss project. Given a sufficient number of issues reports, our automatic predictions are close to the actual effort; for issues that are bugs, we are off by only one hour, beating na¨ýve predictions by a factor of four.
Project Lead The Way-a model program for initiating, funding and maintaining a successful pre-engineering program in the nation's high schools
Authors: G. Adelson
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

A new initiative, Project Lead The Way (PLTW) takes aim at changing the focus of technology education at the high school level. The program offers a four-year sequence in engineering and engineering technology. The program was first developed in the 1980s by Richard Blais. Blais and his staff began a process of reviewing, developing and testing a series of courses that incorporated the skills needed in engineering with the latest high-technology equipment and software. He and his department were supported by a Technology Advisory Board that he established in order to gain the expertise of people in industry and to garner support for the changes that were to be implemented in the curriculum. The members of the board went beyond their initial objectives, locating funds to help purchase equipment and materials for the program in its experimental stage. Over the next three years it became apparent that the program was attracting an increasing number of students, many who would not have enrolled in any technology course until college. Project Lead The Way has been presenting its program to selected schools in New York State and New Hampshire. They have developed an effective organization, goals and strategies that have resulted in over thirty school districts signing contracts to participate in the program.
A Review on Trust and Reputation for Web Service Selection
Authors: Yao Wang, Julita Vassileva
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

A trust and reputation mechanism is a mechanism using consumers' feedbacks to identify good services from bad ones. Compared with other approaches, it has more advantages in solving the selection problem for web services. The paper proposes a typology to classify trust and reputation systems using the three criteria, centralized or decentralized, person or resource, global or personalized. Inspired by the criteria, some potential research directions for web service selection are pointed out.
Conflicting International Standards Pressure Chip Designers
Authors: Victor Berman
Venue: IEEE Design Test (2007)

There is a growing controversy on the international stage between established communications standards from the US and the European Union (EU) and those being developed by emerging economic giants in Southeast Asia, particularly China. Find out more, in this column.
A Workflow Verification Method Based on Calculus.
Authors: Fei Xu, Zhiwei Yu
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

Awareness of the need for process orientation in IT support field has been increasing these decades, which made the formalization and verification of workflow become more and more significant. Among various formal methods,calculus, a branch of process algebra, proved to be most capable in modeling mobility and interaction, therefore is considered as a good choice of workflow formalizing and verifying. In this paper, a -calculus-based workflow verification method is introduced, by which three kinds of structure conflicts (deadlock, lack of synchronization and cycle without exit) can be detected. Verification algorithm based on reduction and replacement rules is also provided, according to which complex workflow model with both cyclic and overlapping structures can be verified with acceptable complexity.
High-level modeling of switching activity with application to low-power DSP system synthesis
Authors: M. Lundberg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

We address the issue of high-level synthesis of low-power digital signal processing (DSP) systems by proposing switching activity models. In particular, we present a technology independent hierarchical scheme to compare relative power performance of two competing DSP systems. The basic building blocks considered for such system are a full-adder and a one-bit delay. Estimates of switching activity at the output of these building blocks is used to model the activity in different architectural primitives used for building DSP systems. This method is very fast and simple and simulations show accuracy within 4% of extensive bit-level simulations. Therefore, it can easily be integrated into current communications/DSP CAD tools for low-power applications. The models show that the choice of multiplier/multiplicand is important when using array multipliers in a data-path. If the input signal with smaller variance is chosen as the as the multiplicand, up to 20% savings in switching activity can be achieved. This observation is verified by analog simulation.
Adaptive tap allocation decision feedback equalizer for multipath channel
Authors: M. Tuchler
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

This paper proposes an adaptive tap allocation technique based on the Kalman algorithm for minimizing the number of taps which are used for updating the equalizer coefficient. The conventional equalizer needs many taps to be adequate for the multipath channel with a long delay, which causes a high computational complexity for updating the coefficient. We propose a new method that the energy of tap and the channel delay length are observed during a training period and then the taps having negligible energy are gradually excluded from the coefficient update every channel delay length. The remaining taps form a new coefficient vector that reduces the computational complexity without any performance degradation. The proposed structure is simulated on the channel of the North American terrestrial high definition television (HDTV). Simulation results show that the computational complexity is almost 25 times lower than that of the conventional structure with the same convergence speed and mean square error (MSE) rate. 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
Rapid prototyping of DSP systems via system interface module generation
Authors: S. Famorzadeh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

As part of ARPA's RASSP program, Lockheed Martin ATL Laboratories has proposed a methodology for rapid prototyping using a plug and play approach. The methodology is based on encapsulation of the basic architectural elements in a design library. The encapsulation interface provides a uniform external view that is independent of the internal functionality of its component. In addition to encapsulating the functionality, the library also captures the low level I/O protocols along with relevant timing information both in synthesis and simulation views that are used for logic generation and the virtual prototyping phase of the development, respectively. The encapsulation is done via VHDL to provide a standard path to the existing synthesis tools. Given a library of encapsulated components, the net list for a functional hardware prototype can be obtained in a matter of hours. We examine this approach in detail in this paper and present some new results on efficient encapsulation.
Dynamic media arts programming in impromptu
Authors: Andrew R. Brown, Andrew Sorensen
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Dynamic software systems for generative art have particular requirements around rapid development and manipulation of ideas and real-time computational processes. Impromptu is an innovative new programming environment created by Andrew Sorensen, and is designed to facilitate the fluid flow of creative ideas and their expression in software. It has been used for our recent projects, including a variety of Collaborative Music Jamming Systems, because it supports creative processes by leveraging the audio, graphic and video capabilities of the modern operating system within a dynamic programming environment. In our projects collaboration is supported through a synthesis of media types, numerous communication protocols, and facilities for inter-system communications and control. The demonstration will show these environments and how Impromptu supported their development.
Equivalence of deterministic pushdown automata revisited
Authors: V. Yu. Meitus
Venue: Cybernetics and Systems Analysis (2007)

This paper briefly analyzes main ideas underlying the comparison algorithm that made it possible to prove the equivalence of deterministic pushdown automata. An example of using this algorithm is presented. The relationship of this algorithm with other results in this area is shown. Moreover, the decidability of problems associated with some classes of formal grammars is established.
An Efficient Online/Offline Signcryption Scheme for MANET
Authors: Zhong Xu, Guanzhong Dai, Deming Yang
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

An efficient online/offline signcryption scheme based on elliptic curve for MANET is proposed in this paper. The proposed scheme takes lower computation and communication cost, since most of computations are carried out offline and online part is very efficient. It not only provides the security properties of confidentiality, authentication, integrity, forward secrecy of message confidentiality and secure against man-in-the-middle attacks, but also solves the key distribution problem using a node own private key and then generates a session key without the certificate authority(CA). Our scheme is especially suitable for MANET because the online computation part is very efficient and does not need a pre-existing certification authority. Empirical studies are conducted using GloMoSim to evaluate the effectiveness of our scheme. The simulation results show that the scheme is efficient in terms of cost and overhead.
Student response to cooperative learning homework teams: midcourse and final evaluations
Authors: S. M. Lord
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

To assess student response to mandatory cooperative learning homework teams, midcourse and final evaluations were conducted over two semesters in a junior-level required Materials Science course at the University of San Diego, USA. Students provided feedback on their group's effectiveness, how many hours per week the group meets, difficulties and whether they believe they learn best by themselves or in a group. They also rated their perception of change in skill at problem solving, communication, and teamwork, and provided recommendations for the teams in the course. On both evaluations, there were open-ended and specific response questions. Overall, students rated their groups as being successful although many groups' ratings declined from the midpoint until the final evaluation. Students reported that their experience working in teams positively impacted their skills. The biggest reported difficulty was with finding a common time for the entire team to meet.
Design and Construction of Virtual Spaces for Communications
Authors: Yuki Sogabe
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, some initial results are presented concerning work on the description and implementation of communications environments, here referred to as "virtual spaces," that is, environments produced by communications systems, usually TCP/IP networks, and associated user devices such as telephones, PC's, PDA's, and so on. The underlying purpose of this research is to characterise formally the concept of virtual space and to examine the design process for the creation of virtual spaces that will both attract and hold the attention of the target users.
Approximating minimum bounded degree spanning trees to within one of optimal
Authors: Mohit Singh, Lap Chi Lau
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

In the Minimum Bounded Degree Spanning Tree problem, we aregiven an undirected graph with a degree upper bound Bv on eachvertex v, and the task is to find a spanning tree of minimumcost which satisfies all the degree bounds. Let OPT be the costof an optimal solution to this problem. In this paper, we presenta polynomial time algorithm which returns a spanning tree T ofcost at most OPT and dT(v) ≤ Bv+1 for all v, where dT(v) denotes the degree of v in T. This generalizes aresult of Furer and Raghavachari [8] to weighted graphs, andsettles a 15-year-old conjecture of Goemans [10] affirmatively. The algorithm generalizes when each vertex v hasa degree lower bound Av and a degree upper bound Bv, andreturns a spanning tree with cost at most OPT and Av - 1 ≤dT(v) ≤ Bv + 1 for all v. This is essentially the bestpossible. The main technique used is an extension of the iterativerounding method introduced by Jain [12] for the design ofapproximation algorithms.
Focused crawling with scalable ordinal regression solvers
Authors: Rashmin Babaria, J. Saketha Nath, Krishnan S, Sivaramakrishnan K R, Chiranjib Bhattacharyya, M. N. Murty
Venue: Proceedings of the 24th international conference on Machine learning (2007)

In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone (SOC) constraint. The main contribution of the paper is a fast algorithm, CB-OR, which solves the proposed formulation more eficiently than general purpose solvers. Another main contribution of the paper is to pose the problem of focused crawling as a large scale Ordinal Regression problem and solve using the proposed CB-OR. Focused crawling is an efficient mechanism for discovering resources of interest on the web. Posing the problem of focused crawling as an Ordinal Regression problem avoids the need for a negative class and topic hierarchy, which are the main drawbacks of the existing focused crawling methods. Experiments on large synthetic and benchmark datasets show the scalability of CB-OR. Experiments also show that the proposed focused crawler outperforms the state-of-the-art.