ppxscal/embedding_network huggingface dataset:
Key Software Engineering Concepts for Project Success: The Use of "Boot Camp" to Establish Successful Software Projects
Authors: David Root, Mel Rosso-Llopart, Gil Taran
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

The use of project initiation techniques is not new to academia or industry. While successfully using "real world" projects to educate software engineers, the Master of Software Engineering (MSE) program at Carnegie Mellon University has learned some key concepts and topics that make software project initiation more successful. We have found that project success is linked to issues surrounding how teams are formed and the specific guidance that they are initially provided. The MSE program uses a concept we call "boot camp" that focuses on some key areas of Software Process issues and Human Communication.
Stress testing traffic to infer its legitimacy
Authors: Nick Duffield, Balachander Krishnamurthy
Venue: Proceedings of the Steps to Reducing Unwanted Traffic on the Internet on Steps to Reducing Unwanted Traffic on the Internet Workshop (2005)

Adaptation in the face of performance degradation is the hallmark of well-behaved network traffic. For sufficiently robust applications, we propose distinguishing good from bad traffic on the basis of the response to artificial performance impairments. We explain the basic requirements for our scheme, and show how it could be generically applied at different levels in the protocol stack.
A New Family of High.Performance Parallel Decimal Multipliers
Authors: Alvaro Vazquez, Elisardo Antelo, Paolo Montuschi
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

This paper introduces two novel architectures for parallel decimal multipliers. Our multipliers are based on a new algorithm for decimal carry-save multioperand addition that uses a novel BCD-4221 recoding for decimal digits. It significantly improves the area and latency of the partial product reduction tree with respect to previous proposals. We also present three schemes for fast and efficient generation of partial products in parallel. The recoding of the BCD-8421 multiplier operand into minimally redundant signed-digit radix-10, radix-4 and radix-5 representations using new recoders reduces the complexity of partial product generation. In addition, SD radix-4 and radix-5 recodings allow the reuse of a conventional parallel binary radix-4 multiplier to perform combined binary/ decimal multiplications. Evaluation results show that the proposed architectures have interesting area-delay figures compared to conventional Booth radix-4 and radix-8 parallel binary multipliers and other representative alternatives for decimal multiplication.
The challenge of collaborative learning in engineering and math
Authors: M. Guzdial
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The CoWeb is a collaborative learning technology used in many classes (over 100) at Georgia Institute of Technology (Georgia Tech), USA. The authors present evidence of the success of the tool in supporting learning at a low cost. They also provide anecdotes about the active resistance they have received to use of the CoWeb in engineering, mathematics and some computer science classes. Evidence from interviews and questionnaires points to some of the sources for this resistance.
An intelligent wireless ad hoc routing protocol
Authors: Hossein Hosseini, K. Vairavan
Venue:  (2006)

Ad hoc networks are self-organizing and self-configuring networks that do not have fixed infrastructures. The wireless ad hoc networks do not require a predefined configuration. Mobile stations in wireless ad hoc networks move around in the network, thus requiring routing to handle dynamically the constant changing of network topologies. We propose an algorithm that presents a new intelligent routing protocol for wireless ad hoc networks. The Intelligent Wireless Ad Hoc Routing (IWAR) protocol selects optimal routes, and also provides load balancing and fault tolerance. The IWAR selects routes based on available bandwidth, error rate, queue delay, process and propagation delay, and route stability. The concept of the artificial intelligence technique called Reinforcement Learning is used to heuristically define credits to routes based on throughputs, available queue buffer spaces, and route lengths. In addition, IWAR uses multiple routes to distribute the traffic among them to create load balancing and fault tolerance. This research includes the implementation of the IWAR algorithm and studies the protocol's performance and reliability. The protocol uses two heuristic functions that are used during the routing discovery and routing maintenance stages to select routes. The protocol evaluates the impact of the different components of each function to fine-tune the performance outcomes. Our study also compares the performance of the IWAR protocol with the well-known Ad Hoc On-Demand Distance-Vector (AODV) protocol. AODV protocol is a wireless ad hoc protocol that makes its routing decision based on the shortest path. The performance evaluation of both protocols studies lightly, moderately, and heavily loaded networks. In addition, the research includes the evaluation of both protocols with stable and unstable network configurations. Throughputs and delays are used to measure the performance of both protocols. In our study, the IWAR protocol outperformed AODV protocol by range from 10% to 21%.
Making connections through the World Wide Web [engineering education marketing]
Authors: J. J. Schemmel
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This is the fifth in a series of six companion papers that address the marketing of the College of Engineering at the University of Arkansas, USA. While valuable as an independent resource, this document should be considered within the context of all six papers. One of the most successful marketing tools being used by the UA College of Engineering is its official Web site. This site presents the message that the College is adding personal, social and economic value to Arkansas and beyond through its educational programs and strategic areas of research emphasis. Further, the College serves a number of key clientele groups. Reaching the point of having a Web site that is first a marketing tool and second a resource for information has been an evolutionary processes that continues today. This paper examines the evolution of the College's web site as marketing moved to the forefront in the college.
Design and Implementation of Floating Point Stack on General RISC Architecture
Authors: Xuehai Qian, He Huang, Hao Zhang, Guoping Long, Junchao Zhang, Dongrui Fan
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

This paper presents a framework for implementing the X86 FP stack used in an x86-compliant processor based on a general RISC architecture. Architectural supports are added to a typical RISC architecture to maintain the FP stack status. Some speculative techniques are applied to the decode stage to enable pipelined and efficient FP operations. An optimized register renaming scheme is proposed to eliminate redundant micro-ops in FP programs, resulting in an increased performance while mitigating the burden on register rename table. The simulation results show that on average more than 10% fmov micro-ops are removed. Elimination of micro-ops significantly speeds up the execution of programs. The IPC increases are as high as 30% for some programs, and near 10% on average.
Optimal subset selection for adaptive signal representation
Authors: M. Nafie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A number of over-complete dictionaries such as wavelets, wave packets, cosine packets etc. have been proposed. Signal decomposition on such over-complete dictionaries is not unique. This non-uniqueness provides us with the opportunity to adapt the signal representation to the signal. The adaptation is based on sparsity, resolution and stability of the signal representation. The computational complexity of the adaptation algorithm is of primary concern. We propose a new approach for identifying the sparsest representation of a given signal in terms of a given over-complete dictionary. We assume that the data vector can be exactly represented in terms of a known number of vectors.
A scalable and robust framework for distributed applications
Authors: M. Jelasity, M. Press, B. Paechter
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper describes a novel tool for running distributed experiments on the Internet. The possible applications include simple load balancing, parallel evolutionary computation, agent-based simulation and artificial life. Our environment is based on cutting-edge peer-to-peer (P2P) technology. We demonstrate the potentials of the framework by analyzing a simple distributed multistart hillclimber application. We present theoretical and empirical evidence that our approach is scalable, effective and robust.
A Model for Credential Based Exception Management in Digital Rights Management Systems
Authors: Jean-Henry Morin, Michel Pawlak
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

While Digital Rights and Policy Management (DRM / DPM) technologies have matured to become mainstream they are now poised to thrive in all aspects of our daily electronic lives and digital assets. A key issue remains however unsolved with respect to managing exceptions in the context of DRM enabled systems and information assets. This paper addresses this issue defining the problem and proposing a model based on credentials allowing to dynamically account for lawful unanticipated usage situations while still maintaining a given level of persistent protection, governed usage and audit trails.
Inter mode vertex-based optimal shape coding
Authors: G. Melnikov
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper investigates the problem of optimal lossy encoding of object contours in the inter mode. Contours are approximated by connected second-order spline segments, each defined by three consecutive control points. Taking into account correlations in the temporal direction, control points are chosen optimally in the rate-distortion sense. Applying motion to contours in the reference frame followed by the temporal context extraction, we predict the next control point location, given the previously encoded one. Based on the chosen differential encoding scheme and an additive MPEG-4 based distortion metric, the problem is formulated as Lagrangian minimization. We utilize an iterative procedure to jointly find the optimal solution and the associated DPCM parameter probability mass functions.
Software Deployment, Past, Present and Future
Authors: Alan Dearle
Venue: 2007 Future of Software Engineering (2007)

This paper examines the dimensions influencing the past and present and speculates on the future of software deployment. Software deployment is a postproduction activity that is performed for or by the customer of a piece of software. Today's software often consists of a large number of components each offering and requiring services of other components. Such components are often deployed into distributed, heterogeneous environments adding to the complexity of software deployment. This paper sets out a standard terminology for the various deployment activities and the entities over which they operate. Six case studies of current deployment technologies are made to illustrate various approaches to the deployment problems. The paper then examines specific deployment issues in more detail before examining some of the future directions in which the field of deployment might take.
Using a digital camera to teach the physics of light
Authors: J. R. Carr
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

3/4 digital cameras capable of 24-bit color (16.8 million colors) provide a unique and relatively inexpensive tool for teaching the physics of light. Many students are familiar with colors obtained by mixing different colors of paint. These color combinations represent subtractive color. Projected light, such as that emanating from the sun and reflected by objects, combines to form different additive colors. The concept of additive color may be more difficult for students to grasp because experimenting with this concept is perhaps more difficult in comparison to mixing paints. Yet, color televisions and computer monitors rely on the concept of additive color to display their many different colors. This paper shows how a digital camera may be used to demonstrate the concept of additive color and apply this concept for scientific investigation. The intended audience is K-12 educators, moreover instructors of college-level science courses that target nonscience majors.
Using Space-Based Computing for More Efficient Group Coordination and Monitoring in an Event-Based Work Management System
Authors: Marcus Mor, Richard Mordinyi, Johannes Riemer
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Group communication is a very difficult task to be implemented in distributed applications. Particularly, work management systems are important in many industries to support the coordination of distributed groups of mobile workers with different levels of availability. Traditional event-based systems using point-to-point communication such as e-mail are not well suited to coordinate a work group as the state of a work item is not always clear and this mode of communication creates many mistakes and massive communication overhead because those tasks are solved via a central server. In this paper, we analyze a work process in a major insurance company, develop a prototype providing solutions for the problems by exploring the coordination features deployed in spacebased computing and compare the current system with the prototype.
On the Impact of Address Space Assignment on Performance in Systems-on-Chip
Authors: G. Hazari, M. P. Desai, H. Kasture
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Today, VLSI systems for computationally demanding applications are being built as Systems-on-Chip (SoCs) with a distributed memory sub-system which is shared by a large number of processing elements. The memory sub-system is a potential performance bottle-neck in the system. In this paper, we consider such a distributed memory sub-system and study the impact of address space distribution on system performance. For a given application on such a system, we introduce the notion of address assignment quality. We show that this assignment quality metric is strongly correlated with memory sub-system throughput over large regions of the design space. We show this using open loop performance modeling of the memory sub-system, and justify this using a queueing and a Markov chain analysis. Further, we develop a detailed memory sub-system model for a multi-processor simulation system built on the Augmint [14] framework. Using two (highly parallel) applications (matrix multiplication and bubble sort) we show that application throughput and assignment quality are strongly correlated over large regions of the design space. We infer that maximization of the assignment quality metric can be a fundamental goal in designing memory sub-systems and in developing applications in such Systems-on-Chip.
A two-stage stochastic programming approach for project planning with uncertain activity durations
Authors: Guidong Zhu, Jonathan F. Bard, Gang Yu
Venue: Journal of Scheduling (2007)

This paper investigates the problem of setting target finish times (due dates) for project activities with random durations. Using two-stage integer linear stochastic programming, target times are determined in the first stage followed by the development of a detailed project schedule in the second stage. The objective is to balance (1) the cost of project completion as a function of activity target times with (2) the expected penalty incurred by deviating from the specified values. It is shown that the results may be significantly different when deviations are considered, compared to when activities are scheduled as early as possible in the traditional way. For example, the optimal target completion time for a project may be greater than the makespan of the early-start schedules under any scenario. To find solutions, an exact algorithm is developed for the case without a budget constraint and is used as a part of a heuristic when crashing is permitted. All computational procedures are demonstrated on a set of 150 benchmark problems consisting of 90 activities each.
Integrated model-driven dashboard development
Authors: Themis Palpanas, Pawan Chowdhary, George Mihaila, Florian Pinel
Venue: Information Systems Frontiers (2007)

Business performance modeling and model-driven business transformation are two research directions that are attracting much attention lately. In this study, we propose an approach for dashboard development that is model-driven and can be integrated with the business performance models. We adopt the business performance modeling framework, and we extend it in order to capture the reporting aspect of the business operation. We describe models that can effectively represent all the elements necessary for the business performance reporting process, and the interactions among them. We demonstrate how all these models can be combined and automatically generate the final solution. We further extend the proposed framework with mechanisms that can detect changes in the models and incrementally update the deployed solutions. Finally, we discuss our experience from the application of our technique in a real-world scenario. This case study shows that our technique can be efficiently applied to and handle changes in the underlying business models, delivering significant benefits in terms of both development time and flexibility.
Specifying the memorization process with STOPA
Authors: F. L. Pelayo, M. Nunez, N. Lopez
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

In this paper we use the formal language STOPA for specifying cognitive systems. In addition to the usual characteristics of these formalisms, our language features the possibility of including stochastic time. This kind of time is useful to represent systems where the delays are not controlled by fix amounts of time, but they are given by a probability distribution function. In order to illustrate the usefulness of our formalism we will formally represent a cognitive model of the memory. Following contemporary theories of memory classification in Squire, L., et al, (1993) we consider sensory buffer, short-term, and long-term memories. Moreover, borrowing from Wang, Y. and Wang, Y., (2003), we also consider the so-called action buffer memory.
On-Line Hard Real-Time Scheduling of Parallel Tasks on Partitionable Multiprocessors
Authors: Davender Babbar, Phillip Krueger
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Until now little research has addressed the problem of on line scheduling of sporadic parallel tasks with hard deadlines in partitionable multiprocessor systems In this paper we present two on-line scheduling algorithms - Buddy/RTand Stacking, for such environments Both the algorithms either guarantee or reject a task at the time of its arrival Buddy/RT is a straight-forward extension of the well-known Buddy strategy to the real-time environment, while Stacking is a more sophisticated algorithm based on the lessons learned from Buddy/RT The underlying concept behind the Stacking algorithm is to reduce fragmentation by 'stacking' equal-sized jobs in the time dimension The Stacking algorithm is found to perform significantly better than Buddy/RT over a wide range of workloads, even though both the algorithms have the same time complexity
On the minimum gap and the angle between two subspaces
Authors: Chun-Yuan Deng
Venue: Journal of Computational and Applied Mathematics (2007)

In this note, we give the expressions of the minimum gap and the angle between two closed subspaces of a Hilbert space in terms of the properties of the projections on these subspaces.
Independent component analysis with sinusoidal fourth-order contrasts
Authors: J. J. Murillo-Fuentes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The authors propose a new solution to the independent component analysis (ICA) problem. In the two-dimensional case, we prove that under the whiteness constraint some fourth-order contrasts may be approximated by a sinusoid. Thus, the minimization of the contrast reduces to computing its phase. The novel approach, called SICA (sinusoidal ICA), uses the 'Jacobi optimization' to cope with higher dimensions. The method presented has a good performance along with a low computational cost. Some experiments with blind separation of audio and synthetic sources are included to compare the algorithm to other well-known approaches.
Development and implementation of a course in instrumentation and data acquisition for the Penn State baccalaureate degree electro-mechanical engineering technology program
Authors: P. J. Shull
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

In support of a new four-year Bachelor of Science program in Electromechanical Engineering Technology at Penn State University, USA, an instrumentation and data acquisition course has been developed. This course is targeted at junior level students that already possess a basic knowledge of digital and analog electronics, microprocessors and physical measurements. Initially, the students develop familiarity with sensors and techniques to measure physical phenomena such as force, velocity, acceleration, pressure, temperature and electromagnetic fields. The data acquisition from these sensors is first performed using basic 'manual' methods followed by the introduction of automated techniques using Labview/sup (C/). The course requires the students, working in teams, to complete a semester long project. The project design requires the students to use current material while considering concepts that have not formally been discussed. Planning with flexibility in their designs is crucial to the completion of the projects. As a direct assessment of this course, the students are expected to utilize their knowledge of sensors, data acquisition, product research and design methods in a subsequent laboratory course in control systems. This paper discusses the details of the development of this course.
Using a Raster Display for Photometric Stereo
Authors: Nathan Funk, Yee-Hong Yang
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper presents a new controlled lighting apparatus which uses a raster display device as a light source. The setup has the advantage over other alternatives in that it is relatively inexpensive and uses commonly available components. The apparatus is studied through application to shape recovery using photometric stereo. Experiments on synthetic and real images demonstrate how the depth map of an object can be recovered using only a camera and a computer monitor.