ppxscal/embedding_network huggingface dataset:
The professionalization of software engineering and its significance for ethics education
Authors: D. Gotterbarn
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 May of 1993, the Board of Governors of the IEEE-CS established a steering committee for evaluating, planning, and coordinating actions related to establishing software engineering as a profession. In that same year the ACM Council endorsed the establishment of a Commission on Software Engineering. By January of 1994, both societies formed a joint committee "To establish the appropriate set(s) of standards for professional practice of Software Engineering upon which industrial decisions, professional certification, and educational curricula can be based." To accomplish these tasks they made the following recommendations: (1) adopt standard definitions; (2) define required body of knowledge and recommended practices; (3) define ethical standards; and (4) define educational curricula for undergraduate, graduate (MS) and continuing education (for retraining and migration).
A Framework for Ontology Enriched Semantic Annotation of CCTV Video
Authors: Bogdan Vrusias, Dimitrios Makris, John-Paul Renno
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

This paper deals with the problem of semantic transcoding of CCTV video footage. A framework is proposed that combines Computer Vision algorithms that extract visual semantics, together with Natural Language Processing that automatically builds the domain ontology from unstructured text annotations. The final aim is a system that will link the visual and text semantics in order to routinely annotate video sequences with the appropriate keywords of the domain experts' terminology.
One-to-one correspondence between fuzzifying topologies and fuzzy preorders
Authors: Jinming Fang, Piwei Chen
Venue: Fuzzy Sets and Systems (2007)

This paper is devoted to the discussion of the relationship between fuzzifying topologies and fuzzy relations. A saturated fuzzifying topology can be generated by a reflexive fuzzy relation; and conversely, a fuzzy preorder can be generated by a fuzzifying topology. In fact, there exists a one-to-one correspondence between the set of all saturated fuzzifying topologies and that of all fuzzy preorders.
Design of space-time turbo trellis codes for two, three and four transmit antennas
Authors: Yi Hong, Jinhong Yuan, Branka Vucetic, Zhuo Chen
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Optimum space-time turbo trellis codes (ST turbo TCs) with 4-PSK and 8-PSK for two, three and four transmit antennas on multi-input/multi-output (MIMO) fading channels are presented. The component codes of the turbo schemes are designed by choosing feedforward coefficients to maximize coding gain and feedback coefficients to minimize iterative decoding threshold. Performance comparison of ST turbo TCs with various memory orders, feedback coefficients, transmit antennas and interleaver structures is illustrated. For four transmit antennas, ST turbo TCs offer a gain of 3.75 dB over the one with two transmit antennas and is 2 dB better than the space-time trellis codes (STTCs) at an FER of 10/sup -3/ on slow Rayleigh fading channels.
Curriculum integration in the freshman year at the University of Alabama-foundation coalition program
Authors: J. Parker, D. Cordes, C. Laurie, A. Hopenwasser, J. Izatt, D. Nikles
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The University of Alabama presented its first set of freshman year courses as part of the NSF sponsored Foundation Coalition during the 1994-1995 academic year. The three major thrust areas of this coalition are: curriculum integration; technology enabled education; and human interface issues. The focus of the paper is on the integration aspects of the freshman year engineering, mathematics, and sciences curriculum. Most freshman level mathematics, chemistry, and physics courses are taught in isolation from each other. Consequently, there is relatively little interaction on the education level between engineering professors and their colleagues in the math and science departments. As a result, most engineering programs lose many students during the freshman year. Our solution to this problem is an integrated set of courses for all engineering majors in chemistry, engineering, mathematics and physics, which must be taken together. The authors were the instructors for the initial offering of the courses mentioned above. The paper focuses on several specific examples of curriculum integration that have been attempted, along with observations about the success of the program. The Foundation Coalition consists of the following: Arizona State University, Maricopa Community College District, Rose Hulman Institute of Technology, Texas A&M University, Texas A&M University Kingsville, Texas Women's University, The University of Alabama.
Electing the Doge of Venice: Analysis of a 13th Century Protocol
Authors: Miranda Mowbray, Dieter Gollmann
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

This paper discusses the protocol used for electing the Doge of Venice between 1268 and the end of the Republic in 1797. We will show that it has some useful properties that in addition to being interesting in themselves, also suggest that its fundamental design principle is worth investigating for application to leader election protocols in computer science. For example, it gives some opportunities to minorities while ensuring that more popular candidates are more likely to win, and offers some resistance to corruption of voters. The most obvious feature of this protocol is that it is complicated and would have taken a long time to carry out. We will also advance a hypothesis as to why it is so complicated, and describe a simplified protocol with very similar properties.
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes
Authors: Ching-Tien Ho, Ming-Yang Kao
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We give an optimal algorithm that broadcasts on an n-dimensional hypercube in \Theta(n/ log_{2}(n+ 1)) routing steps with wormhole, e-cube routing and all-port communication. Previously, the best algorithm of McKinley and Trefftz requires [n/2] routing steps. We also give routing algorithms that achieve tight time bounds for n \leqslant 7.
Is accurate occlusion of glossy reflections necessary?
Authors: Oscar Kozlowski, Jan Kautz
Venue: Proceedings of the 4th symposium on Applied perception in graphics and visualization (2007)

Much research in recent times has been conducted towards real-time rendering of accurate glossy reflections under direct, natural illumination including correct occlusions. The view dependent nature of these reflections will always cause this computation to be expensive unless heavily approximated. There also remains a question as to whether humans are even capable of noticing the difference in accuracy or whether our perception of the realism of the scene remains unchanged and thus the extra effort expended in rendering accurate reflections is effectively wasted. We conduct a user study to analyse any decline in perceived realism of glossy scenes rendered with a variety of specular occlusion approximations under a multitude of BRDFs, lighting environments and camera orientations. We demonstrate that although no one approximation is always suitable, it is rare to have a scene whose computational complexity cannot be decreased to some degree.
S3: A Service-Oriented Reference Architecture
Authors: Ali Arsanjani, Liang-Jie Zhang, Michael Ellis, Abdul Allam, Kishore Channabasavaiah
Venue: IT Professional (2007)

The Service-Oriented Solution Stack provides an architectural framework based on a range of industry best practices.
Using multimedia and cooperative learning in and out of class
Authors: W. M. Clark
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

A multimedia learning tool was combined with a cooperative group project to provide an alternative to the traditional lecture/homework format in a sophomore level engineering course. The CD-ROM based learning tool included motivational video of real processes, theoretical development including text, audio, video and animation files, a virtual laboratory experiment, applications with worked examples and self-tests for learners. Teams of four students were loaned two CDs and assigned the task of learning the material while simultaneously completing a project requiring understanding of the fundamentals presented on the CD. The multimedia/group project format was evaluated against the traditional lecture/homework format with regard to student satisfaction, student learning and faculty and staff time. Student satisfaction increased while student learning remained constant or may have increased slightly. The multimedia/group project format requires substantially more initial development time but does provide some savings in delivery time once developed.
4 kb/s multi-pulse based CELP speech coding using excitation switching
Authors: K. Ozawa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper proposes an MP-CELP (multi-pulse based CELP) speech coding at 4 kb/s. In MP-CELP, amplitudes or signs of multi-pulse excitation are simultaneously vector quantized (VQ). In order to improve speech quality for background noise conditions, the excitation signal is switched between voiced and unvoiced speech, and the number of pulse is greatly increased for unvoiced speech by restricting pulse locations. Further, in order to improve voiced speech quality, the optimal combination among adaptive codebook lag, pulse location, sign codevector and gain codevector is selected which minimizes distortion by employing delayed-decision search. The subjective evaluation results show that speech quality for 4 kb/s MP-CELP is close to that for ITU-T G.723.1 (6.3 kb/s) and G.729 (8 kb/s) in M-TRS clean speech condition. For background noise conditions, the introduction for the excitation switching and the pulse location restriction significantly improves the mean opinion score (MOS) value by 0.4. However, further improvement is still required, except for interference talker condition.
A new error resilience technique for image compression using arithmetic coding
Authors: I. Sodagar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

Arithmetic coding is commonly used for entropy coding in image compression. It has been shown that arithmetic coding has a higher coding efficiency than other entropy coding schemes. However, it has a severe drawback when used in an error prone environment. Since arithmetic coding makes it impossible to precisely locate an error, a large portion of a bitstream must be discarded when an error occurs. In traditional packetization techniques, the bitstream is segmented to packets and the arithmetic encoder is reset at the beginning of each packet. However, the re-initialization will significantly reduce the coding efficiency of the arithmetic coder. We propose a novel technique to improve the error resilience of arithmetic coding. This new technique adds segment markers in the coded bitstream without the re-initialization of the arithmetic coder, which helps retain the correctly decoded segments within the bitstream improving the quality of the reconstructed image. Segment markers have been adopted in both MPEG-4 and JPEG 2000. Experimental results show that THE segment marker significantly improves the quality of reconstructed image with minor increase in bitstream size.
Tree Encoding and Transitive Closure Compression
Authors: Yangjun Chen
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Tree encoding is a very useful mechanism to check ancestordescendant relationships of the nodes in a tree structure, by which each node is associated with a pair of integers that can be used to characterize the reachability. Recently, this method is extended to directed graphs (digraph for short) G by associating each node in G with a pair sequence. However, no approach is reported to minimize such pair sequences. In this paper, we address this issue and propose an efficient algorithm that is always able to generate minimized pair sequences. The algorithm runs in O(b·e + b·n· ) time and O(b·n), where n and e are the numbers of the nodes and edges of a DAG, respectively; and b is the DAG's width.
Learning constraint-based grammars from representative examples: theory and applications
Authors: Kathleen Mckeown
Venue:  (2006)

Computationally efficient models for natural language understanding can have a wide variety of applications starting from text mining and question answering, to natural language interfaces to databases. Constraint-based grammar formalisms have been widely used for deep language understanding. Yet, one serious obstacle for their use in real world applications is that these formalisms have overlooked an important requirement: learnability. Currently, there is a poor match between these grammar formalisms and existing learning methods. This dissertation defines a new type of constraint-based grammars, Lexicalized Well-Founded Grammars (LWFGs), which allow deep language understanding and are learnable. These grammars model both syntax and semantics and have constraints at the rule level for semantic composition and semantic interpretation: The interpretation constraints allow access to meaning during language processing. They establish links between linguistic expressions and the entities they refer to in the real world. We use an ontology-based interpretation, proposing a semantic representation that can be conceived as an ontology query language. This representation is sufficiently expressive to represent many aspects of language and yet sufficiently restrictive to support learning and tractable inferences. In this thesis, we propose a new relational learning model for LWFG induction. The learner is presented with a small set of positive representative examples, which consist of utterances paired with their semantic representations. We have proved that the search space for grammar induction is a complete grammar lattice, which allows the construction and generalization of the hypotheses and guarantees the uniqueness of the solution, regardless of the order of learning. We have proved a learnability theorem and leave provided polynomial algorithms for LWFG induction, proving their soundness. The learnability theorem extends significantly the class of problems learnable by Inductive Logic Programming methods. In this dissertation; we have implemented a system that represents an experimental platform for all the theoretical algorithms. The system has the practical advantage of implementing sound grammar revision and grammar merging, which allow an incremental coverage of natural language fragments. We have provided qualitative evaluations that cover the following issues: coverage of diverse and complex linguistic phenomena; terminological knowledge acquisition from natural language definitions; and handling of both precise and vague questions with precise answers at the concept level.
Software configuration management in an object oriented database
Authors: Mick Jordan, Michael L. Van De Vanter
Venue: Proceedings of the USENIX Conference on Object-Oriented Technologies on USENIX Conference on Object-Oriented Technologies (COOTS) (1995)

The task of configuration management for software development environments is not well supported by conventional files, directories, and ad hoc persistence mechanisms. Typed, immutable objects combined with ubiquitous versioning provide a much more sound basis. A prototype configuration management system currently under development relies upon persistent objects provided by a commercial object-oriented database system. Mechanisms and policies developed for this prototype simplify programming with persistent objects; results include simplicity of both design and implementation, as well as flexibility, and extensibility. Initial measurements suggest that performance is acceptable.
Architectures for controller based CDP
Authors: Guy Laden, Paula Ta-Shma, Eitan Yaffe, Michael Factor, Shachar Fienblit
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Continuous Data Protection (CDP) is a recent storage technology which enables reverting the state of the storage to previous points in time. We propose four alternative architectures for supporting CDP in a storage controller, and compare them analytically with respect to both write performance and space usage overheads. We describe exactly how factors such as the degree of protection granularity (continuous or at fixed intervals) and the temporal distance distribution of the given workload affect these overheads. Our model allows predicting the CDP overheads for arbitrary workloads and concluding the best architecture for a given scenario. Our analysis is verified by running a prototype CDP enabled block device on both synthetic and traced workloads and comparing the outcome with our analysis. Our work is the first to consider how performance is affected by varying the degree of protection granularity, both analytically and empirically. In addition it is the first to precisely quantify the natural connection between CDP overheads and a workload's temporal locality. We show that one of the architectures we considered is superior for workloads exhibiting high temporal locality w.r.t. granularity, whereas another of the architectures is superior for workloads exhibiting low temporal locality w.r.t. granularity. We analyze two specific workloads, an OLTP workload and a file server workload, and show which CDP architecture is superior for each workload at which granularities.
On Derating Soft Error Probability Based on Strength Filtering
Authors: Alodeep Sanyal, Sandip Kundu
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Soft errors caused by ionizing radiation have emerged as a major concern for current generation of CMOS echnologies and the trend is expected to get worse. A significant fraction of soft errors in semiconductor has been reported to never lead to a system failure. System level soft-error rate (SER) analysis shows that soft-error in internal circuit nodes frequently fail to propagate to an observable point due to Boolean filtering and latching window filtering. A previous study shows that when soft-error is viewed as an analog signal distortion rather than a digital error, it often disappears during signal propagation due to error signal attenuation. This has been termed as electrical filtering. Electrical filtering in system level soft-error rate analysis is expensive because it involves circuit level simulation. In this paper, we present an electrical filtering technique that treats soft-errors as digital errors, but uses analog strengths to decide whether such errors can propagate. We call this technique strength filtering. Strength filtering does not involve SPICE simulation, hence it is computationally efficient. Used as a pre-processing step, strength filtering improves the efficiency of system level soft-error rate analysis. Experimental results on ISCAS-85 benchmark circuits show that an average of ~ 38% of the soft errors have no potential impact on the system level behavior and therefore, can be filtered out to improve both accuracy and efficiency of soft rate estimation process.
Direct-pNFS: scalable, transparent, and versatile access to parallel file systems
Authors: Dean Hildebrand, Peter Honeyman
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

Grid computations require global access to massive data stores. To meet this need, the GridNFS project aims to provide scalable, high-performance, transparent, and secure wide-area data management as well as a scalable and agile name space. While parallel file systems give high I/O throughput, they are highly specialized, have limited operating system and hardware platform support, and often lack strong security mechanisms. Remote data access tools such as NFS and GridFTP overcome some of these limitations, but fail to provide universal, transparent, and scalable remote data access. As part of GridNFS, this paper introduces Direct-pNFS, which builds on the NFSv4.1 protocol to meet a key challenge in accessing remote parallel file systems: high-performance and scalable data access without sacrificing transparency, security, orportability. Experiments with Direct-pNFS demonstrate I/O throughput that equals or out performs the exported parallel file system across a range of workloads.
An Adaptive Approach to Enhance the Performance of Content-Addressable Networks
Authors: Balazs Kovacs, Rolland Vida
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Distributed Hash Table (DHT) algorithms structure peer-to-peer networks to provide nodes with fast and scalable lookups. In recent DHT solutions, such as Chord and Kademlia, the contacts of a node in the overlay network are determined so as to keep up with a lookup cost of O(logN) in a network of N nodes. As opposed to these, one of the first DHT solutions, called Content Addressable Network (CAN), has the drawback of limiting the lookup cost only in O(dN1d ) where d is the number of dimensions in the coordinate space, a fixed network parameter. However, CAN has several merits to exploit. Thus, in this paper we present a novel algorithm for CAN, called Long-Range CAN (LRCAN) which is able to eliminate the rigidity of the original system, and provides a more scalable and resilient solution, not only compared to the original version, but to the currently best performing DHTs that we already mentioned.
Policy Based Job Analysis
Authors: Roger Curry, Cameron Kiddle, Rob Simmonds
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

Many job schedulers for clusters allow system administrators to specify a variety of policy constraints that can be used to implement site objectives. An example of a site objective could be to achieve high system utilization while at the same time giving users fair access to the resources. Policy can include such things as constraints on walltime, number of processors and memory that can be requested, fairshare targets, and privileges to certain users. This paper highlights the importance and uses of job scheduler policy information in job analysis. A suite of job analysis services that make use of job scheduler policy information is described. Using the analysis services, system administrators can determine if the current policy is having the desired effect and adjust policy as appropriate. Users can gain insight into the utilization they are achieving and determine more appropriate job submission strategies that could increase utilization or reduce queuing delays. Examples of the job analysis suite applied to production data from resources part of WestGrid, a high performance computing consortium in Western Canada, are also provided.
An analog associative memory chip for VQ image compression
Authors: L. Navoni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper presents a hardware implementation of full-search vector quantization image compression using an associative memory chip based on analog flash technology. Taking advantage of the features of this architecture, that performs a parallel search on 4 K 64-elements codebook in 4.6 /spl mu/s, encouraging results have been obtained in terms of perceived image quality and computation speed.