ppxscal/embedding_network huggingface dataset:
An infinite family of Goethals-Seidel arrays
Authors: Mingyuan Xia, Tianbing Xia, Jennifer Seberry, Jing Wu
Venue: Discrete Applied Mathematics (2005)

In this paper we construct an infinite family of Goethals-Seidel arrays and prove the theorem: If q = 4n - 1 is a prime power ≡ 3 (mod 8), then there exists an Hadamard matrix of order 4n of Goethals-Seidel type.
Applying Fault-Tolerant Solutions of Circulant Graphs to Meshes and Hypercubes
Authors: Shituo Lou, Abdel Aziz Farrag
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Many important architectures such as rings, meshes and hypercubes can be modeled as circulant graphs. As a result, circulant graphs have received a lot of attention, and a new method was developed for designing fault-tolerant solutions for them. We review this method in this paper, and examine its applications to the design of fault-tolerant solutions for meshes and hypercubes. Our results indicate that these solutions are efficient.
iCheck Series: iCheck Express Microsoft PowerPoint 2003, Student Edition, 1 edition
Venue:  (2005)

iCheck Express PowerPoint 2003 was written specifically for high school students. It is age-level and interest-level appropriate. Cross-curricular projects help you reinforce interdisciplinary skills. Project-based activities give students real-world experience. An Annotated Teacher’s Edition provides point of use instruction and helpful teaching strategies for all student skill levels. This book covers Microsoft Office Exam objectives for PowerPoint 2003 Specialist.
Real-time Detection of Faces in Video Streams
Authors: M. Castrillon-Santana, O. Deniz-Suarez, C. Guerra-Artal, M. Hernandez-Tejera
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper describes a face detection system which goes beyond traditional approaches normally designed for still images. First the video stream context is considered to apply the detector, and therefore, the resulting system is designed taking into consideration a main feature available in a video stream, i.e. temporal coherence. The resulting system builds a feature based model for each detected face, and searches them using the various model information in the next frame. The results achieved for video stream processing outperform Rowley-Kanade's and Viola-Jones' solutions providing eye and face data in a reduced time with a notable correct detection rate.
A Lightweight Authentication Protocol for Mobile Ad Hoc Networks
Authors: Bin Lu, Udo W. Pooch
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The characteristics of mobile ad hoc networks (MANETs) determine that the authentication approaches to protect routing and data packet transmission in MANETs should be lightweight and scalable. In this paper, we propose a lightweight authentication protocol, which utilizes one-way hash chain to provide effective and efficient authentication for communications between neighboring nodes in MANETs. The security properties and performance are also analyzed in the paper. The analysis shows that the protocol incurs low overhead penalty and achieves a tradeoff between security and performance.
Robust Task Allocation for Dynamic Distributed Real-Time Systems Subject to Multiple Environmental Parameters
Authors: Dazhang Gu, Frank Drews, Lonnie Welch
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Some distributed real-time systems interact with external environments that change dynamically, and it is necessary to take the external variables into account when performing task allocation. We developed an approximation algorithm for task allocation, and it finds allocations that are maximally robust against dynamic changes in multiple external variables. Such an algorithm will help to reduce expensive reallocations triggered by changes in unpredictable environments. The algorithm has a polynomial running time, and its robustness optimality is given by an approximation ratio, which equals 2.41 asymptotically, when workloads are large and workload independent utilization of tasks is insignificant.
Organic Computing - A New Vision for Distributed Embedded Systems
Authors: Hartmut Schmeck
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

Organic Computing is becoming the new vision for the design of complex systems, satisfying human needs for trustworthy systems that behave life-like by adapting autonomously to dynamic changes of the environment, and have self-x properties as postulated for Autonomic Computing. Organic Computing is a response to the threatening view of being surrounded by interacting and self-organizing systems which may become unmanageable, showing undesired emergent behavior. Major challenges for organic system design arise from the conflicting requirements to have systems that are at the same time robust and adaptive, having sufficient degrees of freedom for showing self-x properties but being open for human intervention and operating with respect to appropriate rules and constraints to prevent the occurrence of undesired emergent behavior.
Review of "Genetic Algorithms for Machine Learning by John J. Greffenstette", Kluwer Academic Publishers, 1993.
Authors: Dimitri C. Dracopoulos
Venue: ACM SIGART Bulletin (1998)

This book is a reprint from a special issue of the journal Machine Learning on Genetic Algorithms (GAs). The fact that it was the third special issue of the journal on GAs shows the continuous increase of interest of people in the field. The five selected articles were presented at the Fourth International Conference on Genetic Algorithms, in June 1991 (San Diego), and at a Special Workshop for Machine Learning at the same conference. The intended book audience is both researchers and practitioners in the field.
Communicating intimacy one bit at a time
Authors: Joseph 'Jofish' Kaye, Mariah K. Levitt, Jeffrey Nevins, Jessica Golden, Vanessa Schmidt
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper, we present a study of 'minimal intimate objects': low bandwidth devices for communicating intimacy for couples in long-distance relationships. We describe a user study of a software intimate object built to communicate a single bit at a time. The results from both log data and journal entries suggest that even a one-bit communication device is seen by users as a valuable and rich channel for communicating intimacy, despite the availability of wider channels of communication such as email, instant messaging, and telephone. We suggest the constrained nature of the communication affords active reinterpretation by its users, and discuss the results in the context of the study of intimacy in human-computer interaction.
Casting Software Design in the Function-Behavior-Structure Framework
Authors: Philippe Kruchten
Venue: IEEE Software (2005)

How does software design compare with design in other disciplines? Using a general design framework--John Gero's Function-Behavior-Structure framework--as a reference, the author contrasts the software engineering process with processes in other engineering disciplines. The author summarizes FBS, then maps the elements and processes in the framework to artifacts and processes in the Rational Unified Process. He notes that software engineers use certain common terms, such as design, analysis, and documentation, in significantly different ways from other engineers. Moreover, the author finds that "design" in software engineering is more limited in scope than in other fields. Having a broader understanding of other engineering disciplines--and software engineering's place among them--can benefit software engineers involved in multidisciplinary projects. The author also discusses lessons applicable to research and to other aspects of software engineering.
Timer Interaction in Route Flap Damping
Authors: Beichuan Zhang, Dan Pei, Daniel Massey, Lixia Zhang
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Route Flap Damping is a mechanism generally used in network routing protocols. Its goal is to limit the global impact of unstable routes by temporarily suppressing routes with rapid changes over short time periods. Although route damping is a clearly defined and simple procedure at each router, its effect in a large network setting is not well understood. We show that the current damping design leads to the intended behavior only under persistent route flapping. When the number of flaps is small, the global routing dynamics deviates significantly from the expected behavior with a longer convergence delay. Previous work observed that a single route flap can falsely trigger route suppression due to path exploration. However our simulations show that this false suppression only accounts for 30% of the convergence delay after a single route flap. Our study reveals previously unknown interactions between reuse timers at different routers. Route suppression and reuse at different routers are triggered at different times and thus affect the number of updates received by other routers. In turn, this impacts other routersý damping behavior. We propose to use Root Cause Notification to eliminate both false suppression and undesirable timer interaction.
Natural language processing at Battelle-Columbus
Venue: Issue 94 (October 1985) (1985)

Natural Language Processing (NLP) research has evolved into a strong research thrust at Battelle's Columbus Laboratories. Backed by a Battelle-wide corporate commitment to Artificial Intelligence (Al) technology and supported by a substantial volume of contract research, Battelle's NLP research is actively seeking solutions to man-machine interface problems through the use of innovative methodologies and technologies.
Employers' preferences for academic letter recommendations from computer information systems graduates
Authors: Garry L. White, Stanley Stephenson, Ted Halatin
Venue: Journal of Computing Sciences in Colleges (2004)

A survey was done with 72 corporations to find out the value of professor's reference letters. The null hypothesis was corporations value reference letters from Computer Information Systems (CIS) professors, Business professors, and Humanities & Arts professors equally. Job skills (CIS) and people skills (Humanities & Arts) were considered equally important. Results from a Friedman Test reject the null hypothesis. A Sign Test on multiple comparisons indicated that employers valued professors' reference letters in the following order: CIS, Business, then Humanities & Arts. Future research needs to be done to see if employers value CIS reference letters stressing people skills greater then letters stressing job skills and knowledge.
All-port line broadcasting in highly connected graphs
Authors: Iris Gaber, Michal Parnas
Venue: Networks (2005)

In this article we propose polynomial time broadcasting protocols for an undirected graph under the circuit switched all-port model. In this model one vertex initiates a message and must inform all vertices of the graph of the message. The message is passed between the vertices of the graph in a sequence of rounds, where during a round the vertices communicate along edge disjoint paths. Our algorithms will require the graph to have a certain edge connectivity lower bound, to achieve fast broadcasting time. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 45&lpar;2&rpar;, 95&ndash;103 2005
A Hybrid Access Model for Storage Area Networks
Authors: Aameek Singh, Sandeep Gopisetty, Kaladhar Voruganti, David Pease, Ling Liu
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

We present HSAN - a hybrid storage area network, which uses both in-band (like NFS [13]) and out-of-band virtualization (like SAN FS [10]) access models. HSAN uses hybrid servers that can serve as both metadata and NAS servers to intelligently decide the access model per each request, based on the characteristics of requested data. This is in contrast to existing efforts that merely provide concurrent support for both models and do not exploit model appropriateness for requested data. The HSAN hybrid model is implemented using low overhead cache-admission and cache-replacement schemes and aims to improve overall response times for a wide variety of workloads. Preliminary analysis of the hybrid model indicates performance improvements over both models.
Distributed Content Adaptation for Pervasive Systems
Authors: Girma Berhe, Lionel Brunie, Jean-Marc Pierson
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Pervasive systems are created by introducing wireless communication into distributed multimedia systems. These systems facilitate mobile data access to applications such as health care, tourism and emergency. However new challenges have emerged that has not been adequately addressed in traditional distributed multimedia systems. In pervasive systems, data must be adapted to the user's preferences, device capabilities and network conditions. Several content adaptation techniques have been proposed to fit the data to the usage environment. In this paper we present a distributed content adaptation framework (DCAF) for distributed multimedia systems and its prototype implementation. The architecture takes into consideration client profile, network conditions, content profile (meta-data) and available adaptation services (third party software elements) to construct an optimal dynamic adaptation graph.
3D Feature Tracking Using a Dynamic Structured Light System
Authors: Antonio Adan, Fernando Molina, Andres S. Vazquez, Luis Morena
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In this paper we present a 3D tracking system that is able to identify several characteristic points on the surface of a moving scene. The system is considered as a preliminary step in the interaction of industrial robots with dynamic scenes. Through a new color structured light technique based on a disordered codeword pattern, 3D coordinates of the object surface are extracted and processed. This method recovers 3D information in such a way that the correspondence problem is easily and robustly solved. After establishing a set of feature points, an inter frame window search algorithm is carried out to solve the tracking problem. A controlled experimental setup has been built in our lab composed by a 2 DOF mobile platform, a light structured sensor and a manipulator robot. The experimentation has been performed on medium spatial resolution and for soft movement specifications giving promising results.
Accelerating Spatially Explicit Simulations of Spread of Lyme Disease
Authors: Dhananjai M. Rao, Philip A. Wilsey
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

The factors influencing spread of Lyme disease are often studied using computer-based simulations and spatially explicit models. However, simulating large and complex models is a time consuming task, even when parallel simulation techniques are employed. In an endeavor to accelerate such simulations, an alternative approach involving dynamic (i.e., during simulation) changes to spatial resolution of the model via a novel methodology called Dynamic Component Substitution (DCS) is proposed. Changes to the resolution are performed such that the total number of interactions between the entities in the model is optimized, thereby improving overall performance but introducing minor (
Automorphisms of Projective Spaces and Min-Wise Independent Sets of Permutations
Authors: Maxim Vsemirnov
Venue: SIAM Journal on Discrete Mathematics (2005)

We study 4-restricted min-wise independent sets of permutations. In particular, we prove that the groups PGL(2,q) (for any prime power ) and PGL(3,q) (for any odd prime power q), permuting points of the projective line and the projective plane over the field $\mathbb{F}_q$, respectively, satisfy this property. We also show that (1) for any 4-restricted min-wise independent set $G\subseteq S_n$, its cardinality is at least 2n-2, and (2) for any sufficiently large n, there exists a 4-restricted min-wise independent set $G\subseteq S_n$ of size n3+o(n3). The last two results improve previous bounds found by Itoh, Takei, and Tarui.
Generalized Mumford-Shah Model and Fast Algorithm for Color Image Restoration and Edge Detection
Authors: Xiao Liang, Wu Huizhong, Wei Zhihui
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

A generalized Mumford-Shah model for color image restoration and edge detection is established in this paper. First the color images are consideedr as the manifold based on the "surface based method", then a new physical quantity in the form of vector product, which describes the differences of the gradient between different channels, is introduced into the regularization term of the "object", then a generalized energy functional is proposed. Finally, we proposed a fast PDEýs numerical iterative algorithm utilizing the steepest descent method and half-point scheme. Experimental results show the proposed model has good ability to overcoming the bad phenomena of color fluctuations along edges caused in the straightforward extension of the original Mumford-Shah model in vectorial cases.
On the use of visualization to support awareness of human activities in software development: a survey and a framework
Authors: Margaret-Anne D. Storey, Davor Čubranić, Daniel M. German
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

This paper proposes a framework for describing, comparing and understanding visualization tools that provide awareness of human activities in software development. The framework has several purposes -- it can act as a formative evaluation mechanism for tool designers; as an assessment tool for potential tool users; and as a comparison tool so that tool researchers can compare and understand the differences between various tools and identify potential new research areas. We use this framework to structure a survey of visualization tools for activity awareness in software development. Based on this survey we suggest directions for future research.
Image Parsing: Unifying Segmentation, Detection, and Recognition
Authors: Zhuowen Tu, Xiangrong Chen, Alan L. Yuille, Song-Chun Zhu
Venue: International Journal of Computer Vision (2005)

In this paper we present a Bayesian framework for parsing images into their constituent visual patterns. The parsing algorithm optimizes the posterior probability and outputs a scene representation as a "parsing graph", in a spirit similar to parsing sentences in speech and natural language. The algorithm constructs the parsing graph and re-configures it dynamically using a set of moves, which are mostly reversible Markov chain jumps. This computational framework integrates two popular inference approaches--generative (top-down) methods and discriminative (bottom-up) methods. The former formulates the posterior probability in terms of generative models for images defined by likelihood functions and priors. The latter computes discriminative probabilities based on a sequence (cascade) of bottom-up tests/filters. In our Markov chain algorithm design, the posterior probability, defined by the generative models, is the invariant (target) probability for the Markov chain, and the discriminative probabilities are used to construct proposal probabilities to drive the Markov chain. Intuitively, the bottom-up discriminative probabilities activate top-down generative models. In this paper, we focus on two types of visual patterns--generic visual patterns, such as texture and shading, and object patterns including human faces and text. These types of patterns compete and cooperate to explain the image and so image parsing unifies image segmentation, object detection, and recognition (if we use generic visual patterns only then image parsing will correspond to image segmentation (Tu and Zhu, 2002. IEEE Trans. PAMI, 24(5):657--673). We illustrate our algorithm on natural images of complex city scenes and show examples where image segmentation can be improved by allowing object specific knowledge to disambiguate low-level segmentation cues, and conversely where object detection can be improved by using generic visual patterns to explain away shadows and occlusions.
How Digital Photography Works
Authors: Ron White, Timothy Edward Downs
Venue:  (2005)

Remember when digital cameras first came on the market a few years ago? Like most people, you probably waited to buy one, waiting to see if it was just a fad or if it was going to become a way of life, much like PCs did in the 1980s. Well, years have gone by and digital cameras are only getting better with time. Yet it seems like more people have digital cameras than know how to use them. How Digital Photography Works is a digital camera and photography book that actually tells you how it all works. Full-color, large illustrations take the guesswork out of understanding all of the cool things your digital camera and software can do, from capturing images to fixing mistakes. You will learn: How a lens works How exposure works How digital cameras transform light to become data How digital cameras manipulate photos How digital tools correct picture-taking mistakes How digital print-making works So much moreHow Digital Photography Worksis the only book that gives you a behind the scenes look at digital photography, ultimately making you a better digital photographer.
Shape-from-Shading Under Perspective Projection
Authors: Ariel Tankus, Nir Sochen, Yehezkel Yeshurun
Venue: International Journal of Computer Vision (2005)

Shape-from-Shading (SfS) is a fundamental problem in Computer Vision. A very common assumption in this field is that image projection is orthographic. This paper re-examines the basis of SfS, the image irradiance equation, under a perspective projection assumption. The resultant equation does not depend on the depth function directly, but rather, on its natural logarithm. As such, it is invariant to scale changes of the depth function. A reconstruction method based on the perspective formula is then suggested; it is a modification of the Fast Marching method of Kimmel and Sethian. Following that, a comparison of the orthographic Fast Marching, perspective Fast Marching and the perspective algorithm of Prados and Faugeras on synthetic images is presented. The two perspective methods show better reconstruction results than the orthographic. The algorithm of Prados and Faugeras equates with the perspective Fast Marching. Following that, a comparison of the orthographic and perspective versions of the Fast Marching method on endoscopic images is introduced. The perspective algorithm outperformed the orthographic one. These findings suggest that the more realistic set of assumptions of perspective SfS improves reconstruction significantly with respect to orthographic SfS. The findings also provide evidence that perspective SfS can be used for real-life applications in fields such as endoscopy.