ppxscal/embedding_network huggingface dataset:
A New Algorithm for Reachability Testing of Concurrent Programs
Authors: Yu Lei, Richard Carver
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

One approach to testing concurrent programs, called reachability testing, generates test sequences automatically, and on-the-fly, without constructing any static models. To ensure that every partially-ordered synchronization sequence of a program with a given input is exercised exactly once, existing reachability testing algorithms need to save and search through the history of synchronization sequences that have already been exercised, which is impractical for many applications. In this paper, we present a new reachability testing algorithm which does not save any synchronization sequences but still guarantees that every partially-ordered sequence will be exercised exactly once. We describe a reachability testing tool called RichTest and report some empirical results, including a comparison between RichTest and a partial order reduction based tool called VeriSoft. RichTest performed significantly better for the programs in our study.
Intelligent MBWIMA/UMTS Protocol Using SDMA Scheduling in UTRA TDD Mode
Authors: Jeich Mar, Chih-Yang Kao
Venue: Wireless Personal Communications: An International Journal (2006)

The intelligent medium access control (MAC) protocol based on cascade fuzzy logic control (CFLC) using the first-duplicated space division multiple access (SDMA) scheduling for UTRA TDD mode is presented in this paper. Voice, data and video are integrated for transmission using CFLC-based movable boundary wireless multiple access in the UMTS (MBWIMA/UMTS) protocol. The CFLC-based MBWIMA/UMTS protocol performance with data rate control is optimized using the CFLC to generate the proper maximum number of voice/video slots and a suitable data rate. The first-duplicated SDMA scheduling, which provides the SDMA scheduling management, can increase the wireless mobile system capacity and reduce the voice-video dropping probability. The simulation results demonstrate that the CFLC-based MBWIMA/UMTS protocol using the first-duplicated SDMA scheduling can greatly improve both the voice-video dropping probability and data packet delay, compared with the MBWIMA/UMTS and GPRS/UMTS protocols using the first-duplicated SDMA scheduling at the expense of a small decrease in data packet throughput.
AntiWorm NPU-based Parallel Bloom Filters for TCP/IP Content Processing in Giga-Ethernet LAN
Authors: Zhen Chen, Chuang Lin, Jia Ni, Dong-Hua Ruan, Bo Zheng, Yi-Xin Jiang
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

TCP/IP protocol suite carries most application data in Internet. TCP flow retrieval has more security meanings than the IP packet payload. Hence, monitoring the TCP flow has more strength than only monitoring the IP packet payload in the AntiWorm system. The main idea of this paper is to use the flexibility and high performance of Network Processors to scan TCP flow for locating worm's binary codes, and cut off their propagation. A stateful TCP flow inspection engine is implemented based on IXP Network Processor, which can monitor about 512K flows. The performance issues about IXP Network Processors are evaluated and collected, and an analysis is made for further optimizing the system performance. The system is also demonstrated and proved by using the Internet traces and real assaults of Worms. Software Package TCPScanner 1.0 is also given as a software release of the research.
Certifications in computer areas: the demand for hiring employees with various certifications. an assessment of the workplace skills desired for placement of mississippi community college information systems technology completers
Authors: Joyce Elaine Jenkins
Venue:  (2005)

The purpose of this study was to determine what human resource managers perceive to be the certifications, skills, and qualifications that are required by Mississippi service industries for hiring prospective employees educated in the Mississippi Community College Information Systems Technology Programs. The focus of the study was placement of postsecondary completers in service industries in Mississippi. Community colleges in Mississippi are providing an increasing number of courses and programs in IT fields including computer networking and programming requested by industry. The Mississippi Local Area Network Technology is a two-year program, which offers training in network technologies, administration, maintenance, and operating systems. Postsecondary Career and Technology educators are faced with the challenge of placing their program completers, which is one of the core indicators outlined by the Carl Perkins Act of 1998. In order to meet the required state placement levels of community college faculty will need to know what educational qualifications, workplace skills and computer certifications are in demand by employers to successfully train students for job placement from Information Systems Technology Programs. Placement is a measure of the percentage of students who completed or exited basic skills programs at the secondary level or occupational programs at the postsecondary level. Therefore, it is necessary that faculty know what employers are looking for in order to place students. This study examined the desired educational qualifications by job titles and employment levels, the IT certifications in demand, the usage, and demand of IT skills, the importance of workplace skills, and recruitments methods used to hire IT professionals. Employers are seeking employees that hold one or more the following IT certifications: (1) Microsoft Certified Systems Administrator (MCSA), (2) Microsoft Certified Systems Engineer (MCSE), (3) Microsoft Training Services, (4) Cisco Certified Network Associate (CCNA), (5) A+ Service Technician Certification, (6) Microsoft Certified Professional (MCP), (7) Network+, (8) Microsoft Office User Specialist (MOUS) Certification, (9) Security+, and (10) Certified Novell Administrator (CNA). IT certifications can be a plus in landing a job, but is not the most important factor considered when hiring employees at the various job levels: entry, intermediate, senior or managerial. Service industries perceived doctoral degrees as an educational qualification for most entry-level IT positions. Personal referrals were the most common recruitment method used by employers.
Extreme Multimedia
Authors: Thomas A. DeFanti
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Recent availability of production-quality switched Gigabit and 10 Gigabit networks on an international scale has facilitated the emergence of extreme multimedia devices and applications. Digital cinema at four times HDTV resolution (4096x2160) can now be streamed from Japan 15,000 kilometers over CineGrid Gigabit networks. 100- megapixel tiled displays can be managed as large landscapes of information fed by up to 20 Gigabits/second of data from Amsterdam. A 3D point-to-point life-size teleconferencing with no glasses or tracking encumbrances is eerily natural. Stereo HDTV from underwater reefs in Taiwan or robots at play in Korea, and live HDTV sent from smoker vents two miles under the surface of the ocean triply illustrate the extended reach of multimedia today. To protect content from disruption or theft, new prototype technology showed switches in Ottawa, Amsterdam, and Chicago transmitting twelve 800 megabit/second multimedia streams to San Diego with 256-bit AES encryption, in real-time, without any knowledge by the application. This keynote will present multimedia pushed to demonstrated limits at the extreme September iGrid2005 workshop www.igrid2005.org at which 49 networked demonstrations from 20 countries took advantage of 100 Gigabits of networking into San Diego from around the world, displayed on huge screens in the just-opened Calit2 building at UCSD. Credits and references will be amply provided.
Hardware Testing For Error Tolerant Multimedia Compression based on Linear Transforms
Authors: In Suk Chong, Antonio Ortega
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

In this paper, we propose a system-level error tolerance scheme for systems where a linear transform is combined with quantization. These are key components in multimedia compression systems, e.g., video and image codecs. Using the concept of acceptable degradation, our scheme classifies hardware faults into acceptable and unacceptable faults. We propose analysis techniques that allow us to estimate the faults¿ impact on compression performance, and in particular on the quality of decoded images/video. We consider as an example the Discrete Cosine Transform (DCT), which is part of a large number of existing image and video compression systems. We propose methods to establish thresholds of acceptable degradation and corresponding testing algorithms for DCT-based systems. Our results for a JPEG encoder using a typical DCT architecture show that over 50% of single stuck-at interconnection faults in one of its 1D DCT modules lead to imperceptible quality degradation in the decoded images, over the complete range of compression rates at which JPEG can operate.
Wearable Augmented Reality System Using Invisible Visual Markers and an IR Camera
Authors: Yusuke Nakazato, Masayuki Kanbara, Naokazu Yokoya
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper describes a wearable augmented reality (AR) system using invisible visual markers. Some AR systems use visual markers in order to measure the position and orientation of user's viewpoint. However, conventional visual markers usually impair the scenery. This paper proposes a system using invisible visual markers consisting of translucent retro-reflectors. The system can be realized without undesirable visual effects and power supply for infrastructures.
Matching Tensors for Pose Invariant Automatic 3D Face Recognition
Authors: A. S. Mian, M. Bennamoun, R. A. Owens
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

The face is an easily collectible and non-intrusive biometric used for the authentication and identification of individuals. 2D face recognition techniques are sensitive to changes in illumination, makeup and pose. We present a fully automatic 3D face recognition algorithm that overcomes these limitations. During the enrollment, 3D faces in the gallery are represented by third order tensors which are indexed by a 4D hash table. During online recognition, tensors are computed for a probe and are used to cast votes to the tensors in the gallery using the hash table. Gallery faces are ranked according to their votes and a similarity measure based on a linear correlation coefficient and registration error is calculated only for the high ranked faces. The face with the highest similarity is declared as the recognized face. Experiments were performed on a database of 277 subjects and a rank one recognition rate of 86.4% was achieved. Our results also show that our algorithm¿s execution time is insensitive to the gallery size.
Comments on "Incremental Construction and Maintenance of Minimal Finite-State Automata," by Rafael C. Carrasco and Mikel L. Forcada
Authors: Jan Daciuk
Venue: Computational Linguistics (2004)

In a recent article, Carrasco and Forcada (June 2002) presented two algorithms: one for incremental addition of strings to the language of a minimal, deterministic, cyclic automaton, and one for incremental removal of strings from the automaton. The first algorithm is a generalization of the "algorithm for unsorted data" - the second of the two incremental algorithms for construction of minimal, deterministic, acyclic automata presented in Daciuk et al. (2000). We show that the other algorithm in the older article - the "algorithm for sorted data" - can be generalized in a similar way. The new algorithm is faster than the algorithm for addition of strings presented in Carrasco and Forcada's article, as it handles each state only once.
Dewarping of document image by global optimization
Authors: Hironori Ezaki, Seiichi Uchida, Akira Asano, Hiroaki Sakoe
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper proposes a novel dewarping technique for document images of bound volumes. This technique is a kind of model fitting techniques for estimating the warp of each text line by fitting some elastic curve model to the text line. Differing from conventional techniques, the proposed technique is applicable to document images including local irregularities such as formulae, short text lines, and figures, since the proposed technique dewarps whole document images by fitting splines while considering the global optimality that specifies the desirable relationship among the splines. The experimental results on several document images including the local irregularities indicated the effectiveness of the proposed technique. The experimental result also indicated the effectiveness of the vertical division of a document image into some partial document images for more accurate dewarping.
The existence of metrics of nonpositive curvature on the brady-krammer complexes for finite-type artin groups
Authors: Woonjung Choi
Venue:  (2004)

My dissertation focuses on the existence of metrics of nonpositive curvature for the simplicial complexes constructed recently by Tom Brady and Daan Krammer for the braid groups and other Artin groups of finite type. In particular, for each Artin group of finite type, there is a recently constructed finite simplicial Eilenberg-Mac Lane space known as its Brady-Krammer complex. The Brady-Krammer complexes are highly symmetric objects. Prior work on the relationship between the Brady-Krammer complexes and the theory of CAT(0) spaces has produced some positive results in low-dimensions. More specifically, the Brady-Krammer complexes of dimension at most 3 have been shown to support piecewise Euclidean metrics of nonpositive curvature. Similarly, the 4-dimensional Brady-Krammer complexes of type A 4 and type B4 also support such metrics. In every instance, the metrics assigned respect all of the symmetries alluded to above. The main results of my dissertation show that this pattern does not extend to the Brady-Krammer complexes of type F 4 and D4. These are the first negative results known about the curvature of these Brady-Krammer complexes. The proofs of my main theorems involve a combination of combinatorial results and computer calculations. These negative results are particularly striking since Ruth Charney, John Meier and Kim Whittlesey have shown that a particular complex closely related to each Brady-Krammer complex admits an asymmetric metric satisfying a weak version of nonpositive curvature. Thus, one corollary of my results is that the weak asymmetric version of a CAT(0) metric (initially defined by Mladen Bestvina) is strictly weaker than the traditional version.
Countering Trusting Trust through Diverse Double-Compiling
Authors: David Wheeler
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

An Air Force evaluation of Multics, and Ken Thompson's famous Turing award lecture "Reflections on Trusting Trust," showed that compilers can be subverted to insert malicious Trojan horses into critical software, including themselves. If this attack goes undetected, even complete analysis of a system's source code will not find the malicious code that is running, and methods for detecting this particular attack are not widely known. This paper describes a practical technique, termed diverse double-compiling (DDC), that detects this attack and some compiler defects as well. Simply recompile the source code twice: once with a second (trusted) compiler, and again using the result of the Jirst compilation. If the result is bit-for-bit identical with the untrusted binary, then the source code accurately represents the binary. This technique has been mentioned informally, but its issues and ramifications have not been identified or discussed in a peer-reviewed work, nor has a public demonstration been made. This paper describes the technique, justifies it, describes how to overcome practical challenges, and demonstrates it.
A review of OSIRIS IV
Authors: Richard C. Roistacher
Venue: ACM SIGSOC Bulletin (1980)

The Survey Research Center at the University of Michigan's Institute for Social Research has begun the dissemination of OSIRIS IV, the latest version in Michigan's series of statistical systems. OSIRIS IV is designed to be an eventual replacement for the OSIRIS III system. OSIRIS has long been the ugly duckling of statistical systems. Data analysts find its six volumes of documentation forbidding and unintelligible, and dislike the cross-tabulation program's control syntax and lack of category labels. As a result, most data managers have remained unaware of OSIRIS III's unequalled power at managing sequential data files. 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
Project initiation and control
Authors: Otis T. Watkins,  Jr
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

This article describes some of the forms and standards used to initiate and keep track of development projects at the Citizens Fidelity Bank & Trust Company in Louisville. These procedures provide the measure of control that we find necessary to form a more responsible user and ensure domestic tranquility. 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
Reliability and Performance Estimation for Enriched WS-SAGAS
Authors: Neila Ben Lakhal, Takashi Kobayashi, Haruo Yokota
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Over the last couple of years, the web services compositions paradigm has been gathering a considerable momentum to grasp at the opportunity of becoming the most natural solution for autonomous and heterogeneous applications integration. In this paper, we advocate that we have yet to be concerned about the reliability and performance levels that the web services composition will exhibit upon execution, which is still an ongoing research problem finding notable interest. Focusing on this issue, we propose to estimate the reliability and performance of web services compositions. We concentrate on one important aspect that has received little attention so far: the consideration of the failures repercussions on the overall composition execution performance. Specifically, our targets are twofold. Firstly, we propose to enrich WS-SAGAS with a new set of advanced aggregation patterns so that it fits with the inherent business processes complexity and thereby it allows to specify, as web services compositions, any business process no matter how it turns out to. Secondly, we propose to estimate the reliability and performance of each of these patterns, and this, in both, correct and faulty situations. Our enriched WS-SAGAS model ameliorates considerably the chances to acquire more plausible estimations of the reliability and performance because of its failure awareness. Moreover, analyzing these estimations helps to investigate the reasons that may lay behind these failures and indeed to contribute noticeably to acquire more reliable compositions execution with high performance level.
SHReQ: Coordinating Application Level QoS
Authors: Dan Hirsch, Emilio Tuosto
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

We present SHReQ, a formal framework for specifying systems that handle abstract high-level QoS requirements which are becoming more and more important for service oriented computing. SHReQ combines Synchronised Hyperedge Replacement (SHR) with constraint-semirings. SHR is a (hyper)graph rewriting mechanism for modelling evolution of systems. The novelty of the approach relies on the synchronisation mechanism which is based on constraint-semirings, algebraic structures that provide both the mathematics for multi-criteria QoS and the synchronisation policies underlying the SHR mechanism.
Enhancing Data Authenticity and Integrity in P2P Systems
Authors: Xinwen Zhang, Songqing Chen, Ravi Sandhu
Venue: IEEE Internet Computing (2005)

Peer-to-peer systems let users share information in distributed environments because of their scalability and efficiency. However, existing P2P systems are vulnerable to numerous security attacks and lack a mechanism to ensure shared information¿s authenticity and integrity. A proposed general architecture enhances these aspects by leveraging trusted computing technology, which is built on a trusted platform module and provides a mechanism for building trust into theapplication layer. Preliminary experimental results show that the proposed scheme can ensure data authenticity and integrity in P2P systems with acceptable performance overhead.
A Novel Approach to Skew Detection and Character Segmentation for Handwritten Bangla Words
Authors: A. Roy, T. K. Bhowmik, S. K. Parui, U. Roy
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Character segmentation is a necessary preprocessing step for character recognition in many handwritten word recognition systems. The most difficult case in character segmentation is the cursive script. Fully cursive nature of Bangla handwriting, the natural skewness in words poses some challenges for automatic character segmentation. In this article a novel approach to skew detection, correction as well as character segmentation has been presented for handwritten Bangla words as a test case. Segmenting points are extracted on the basis of some patterns observed in the handwritten words. With these segmenting points a graphical path (hereafter referred to as a candidate path) has been constructed. The handwritten words contain some consistent and also inconsistent skewness. Our algorithm can cope with both types of skewness at a time. Further the method is so direct that with the help of a candidate path one can handle both skew correction and segmentation successfully. the algorithm has been tested on a database prepared for laboratory use. The method yields fairly good results for this database.
Trajectory Based Video Sequence Synchronization
Authors: Daniel Wedge, Peter Kovesi, Du Huynh
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Video sequence synchronization is often necessary for computer vision applications where multiple simultaneously recorded videos are processed. We present a coarse-to-fineapproach to synchronizing two video sequences recorded at the same frame rate by stationary cameras with fixed internal parameters. At the coarse level, each sequence is broken into a set of sub-sequences, which are then matched. A voting scheme determines the range in which the sequences' temporal offset lies. The fine synchronization step searches for the temporal offset by initially examining integer offsets, and then using the golden-section search to locate the offset to sub-frame accuracy. Our algorithm recovers the temporal offset of two sequences using the motion of a single moving object, is computationally efficient, and it does not require any stationary background points as reference points. We present results for synthetic data and real video sequences, with various degrees of temporal overlap.