ppxscal/embedding_network huggingface dataset:
Curve-Skeleton Properties, Applications, and Algorithms
Authors: Nicu D. Cornea Deborah Silver
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Curve-skeletons are thinned 1D representations of 3D objects useful for many visualization tasks including virtual navigation, reduced-model formulation, visualization improvement, animation, etc. There are many algorithms in the literature describing extraction methodologies for different applications; however, it is unclear how general and robust they are. In this paper, we provide an overview of many curve-skeleton applications and compile a set of desired properties of such representations. We also give a taxonomy of methods and analyze the advantages and drawbacks of each class of algorithms.
HMIN: A New Method for Hierarchical Interconnection of Processors
Authors: Yashovardhan R. Potlapalli, Dharma P. Agrawal
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Hierarchical interconnection schemes have been proposed in the literature to take advantage of locality of refernce. This paper presents a dynamic scheme for hierarchical intercon nection called Hierarchical Multistage Interconnection Net work (HMIN). We discuss the various design alternatives and evaluate each of them with respect to average delay and cost. HMINs are compared only with MINs because of a lack of a method of comparing the cost of a static HIN with a dynamic HMIN.
Assessment of technology-assisted learning in higher education: it requires new thinking by universities and colleges
Authors: S. D. Sheppard
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

The purpose of this paper is to outline some of the issues, challenges and questions facing universities and colleges as they consider the use of technology in the support of teaching and learning. The issues are difficult in that they require balanced consideration of questions such as: (i) what types of technologies improve learning?; (ii) which faculty members will adopt and experiment with technologies and how will this impact the reward system?; and (iii) which technologies can we afford and what are the hidden costs? Most of these questions remain unanswered. The authors begin by giving examples of the types of learning technologies that universities are exploring and adopting. They proceed to enumerate some of the reasons for this adoption, and then discuss the various groups who should be asking probing questions about the effectiveness of these technologies. Some of the characteristics of an evaluation plan that would address these various questions are then proposed. They conclude with several emerging models for such an evaluation plan.
"Plug-up"-a new concept for fabricating SOI MEMS devices
Authors: J. Kiihamaki, P. Pekko, H. Kattelus, T. Sillanpaa, T. Mattila
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

This paper reports a novel process sequence for making micromechanical devices on silicon on insulator (SOI) wafers. The merits of the new process are its improved immunity to stiction and elimination of conductor metal endurance problems during sacrificial etching with hydrofluoric acid (HF). With this new process one can fabricate vacuum cavities on blank SOI substrates. Further processing of these cavity wafers enables the realization of a wide variety of single crystal micromechanical devices.
Pattern Oriented Software Architecture: Patterns for Resource Management
Authors: Prashant Jain, Michael Kircher
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

From embedded software in a mobile device to software in a large enterprise server, it is important that resources, such as memory, threading, files, or network connections are managed efficiently to allow the systems to function properly and effectively. In many systems, the actual need for resource management is discovered late in the software development lifecycle, at system-analysis or performance-analysis time. The design techniques that must be used in implementing resource management in a system depend largely upon the domain, the system constraints and requirements. A technique that works well in a particular system or configuration may not be as effective in a different system.
Bayesian Region Growing and MRF-based Minimization for Texture and Colour Segmentation
Authors: Ilias Grinias, Nikos Komodakis, Georgios Tziritas
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

We propose a generic, unsupervised feature classification and image segmentation framework, where only the number of classes is assumed as known. Image segmentation is treated as an optimization problem. The framework involves block-based unsupervised clustering using k-means, followed by region growing in spatial domain. High confidence statistical criteria are used to compute a map of initial labelled pixels. A new region growing algorithm is introduced, which is named Independent Flooding Algorithm and computes a height per label for each one of the unlabeled pixels, using Bayesian dissimilarity criteria. Finally, a MRF model is used to incorporate the local pixel interactions of label heights and a graph cuts algorithm performs the final labelling by minimizing the underlying energy. Segmentation results using texture, intensity and color features are presented.
Integration of seamless design, analysis and manufacturing concepts into undergraduate mechanics courses
Authors: J. Beuth
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

Summary form only given. In this paper, several projects that have been or are being assigned to mechanics students are described. Seamless design to manufacturing capabilities have been used in courses at all levels of undergraduate instruction. In particular, efforts at integrating these concepts into the departmental freshman-level fundamentals of mechanical engineering course have served as the ultimate test of the practicality of using sophisticated software packages in large undergraduate courses. Current outcomes and future plans for this effort are also summarized. 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
Empowerment to success: the class structure in an honors engineering course
Authors: J. Steciak
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

Structuring a quality honors course is a challenge in most disciplines. The authors have offered an honors section in their introductory computer science class for several years. During this time, they have restructured their honors section several times, including shifting both the focus and format. They started with a concentration in Web design, shifted to robotics, and then advanced onto student presentations. The layout began as a traditionally structured course, evolved with the introduction of student mentors, and most recently has advanced to student-directed learning. It is evidenced from both their evaluation of the student work and the student evaluations of the course that self-directed learning (i.e., empowerment) has resulted in a satisfactory and successful honors class.
Timing and Concurrency Specification in Component-based Real-Time Embedded Systems Development
Authors: Hung Ledang, Dang Van Hung
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

In a development of real-time embedded systems, one needs to consider at very early stages the platform on which the systems are deployed. An explicit specification of system resources enables in fact the specification of non-functional properties. In this paper, as an attempt to define a formal component model for real-time embedded systems, we propose to use resources as the first-class citizen at the contract level of components. We show that this explicit specification of resources enables not only the flexibility of the component contract but also the specification of several non-functional properties of systems. We show a way that the worst case execution time (WCET) and the concurrency of component methods are expressed and validated in terms of resources that are available to the component in question.
Exploring Clause Symmetry in a Distributed Bounded Model Checking Algorithm
Authors: H. Barros, S. Campos, M. Song, L. Zarate
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

In recent years new and efficient symbolic model checking algorithms have been developed. One technique, bounded model checking or BMC, has been particularly promising. BMC models the system being verified as a boolean formula whose satisfying assignments provide counterexamples for properties verified. BMC unrolls the system in its multiple iterations. Because of this the structure of the formula representing the system is very symmetric, since all iterations are similar in structure. This work explores this symmetry in a distributed algorithm by post-poning the unrolling of the formulas until they are used. This minimizes communication among processors since the formulas transmitted are shorter. Moreover, avoiding the unrolling of conflict clauses has a more pronounced effect, because due to the symmetric nature of the formula, a conflict clause for one instant in the execution can be applied to multiple time instants. As a consequence, short conflict clauses can be unrolled into much more effective clauses, cutting back on the search space significantly. In our experiments we have obtained gains of up to three orders of magnitude in verification time and up to two orders of magnitude in memory usage in large examples.
Routing, disjoint paths, and classification
Authors: Gregory R. Ganger, Bruce M. Maggs
Venue:  (2006)

In this thesis, we study three problems: routing, edge disjoint paths, and classification. In hierarchical routing, we obtain "near-optimal" routing table size and path stretch through a randomized hierarchical decomposition scheme in the metric space induced by a graph. We say that a metric (X, d) has doubling dimension dim(X) at most &alpha; if every set of diameter D can be covered by 2&alpha; sets of diameter D/2. (A doubling metric is one whose doubling dimension dim(X) is a constant.) For a connected graph G, whose shortest path distances dG induce the doubling metric (X, dG), we show how to perform (1 + &tau;)-stretch routing on G for any 0 < &tau; &le; 1 with routing tables of size at most (&alpha;/&tau;) O(&alpha;) log&Delta;log&delta; bits with only (&alpha;/&tau;)O(&alpha;) log&Delta; entries, where &Delta; is the diameter of G and &delta; is the maximum degree of G. The Edge Disjoint Paths (EDP) problem in undirected graphs refers to the following: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as possible using paths that are mutually edge disjoint. This leads to a variety of classic NP-complete problems, for which approximability is not well understood. We show a polylogarithmic approximation algorithm for the undirected EDP problem in general graphs with a moderate restriction on graph connectivity: we require the global minimum cut of G to be &Omega;(log5 n). Our algorithm extends previous techniques in that it applies to graphs with high diameters and asymptotically large minors. In the classification problem, we are given a set of 2N diploid individuals from population P1 and P2 (with no admixture), and a small amount of multilocus genotype data from the same set of K loci for all 2N individuals, and we aim to partition P 1 and P2 perfectly. In our model, given the population of origin of each individual, the genotypes are assumed to be generated by drawing alleles independently at random across the K loci, each form its own distribution. We show several results for this problem.
Rank order diversity detectors for wireless communications
Authors: A. Flaig
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A novel class of robust detectors, the rank order diversity (ROD) detectors, is proposed. The ROD detectors exploit the diversity inherent in any repetition code by sorting the sampled channel output, weighting each of the sorted samples according to their rank, and summing the weighted order statistics to form the test statistic. The ROD detectors subsume the globally optimal detectors for the short-tailed uniform and the normal distributions, as well as the locally optimal detector for the heavy-tailed double-exponential distribution, suggesting a high efficiency of the ROD detectors over a vast range of possible noise statistics. It is shown that for large sample sizes and under mild conditions on the noise statistics, the ROD detector achieves a probability of error less or equal than that of the linear detector with equality only for the normal distribution. The performance of the ROD detectors is illustrated in a DS-CDMA network.
Improvements to the Psi-SSA representation
Authors: François de Ferrière
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

Modern compiler implementations use the Static Single Assignment representation [5] as a way to efficiently implement optimizing algorithms. However this representation is not well adapted to architectures with a predicated instruction set. The &psi;-SSA representation was first introduced in [11] as an extension to the Static Single Assignment representation. The &psi;-SSA representation extends the SSA representation such that standard SSA algorithms can be easily adapted to an architecture with a fully predicated instruction set. A new pseudo operation, the &psi; operation, is introduced to merge several conditional definitions into a unique definition. This paper presents an adaptation of the &psi;-SSA representation to support architectures with a partially predicated instruction set. The definition of the &psi; operation is extended to support the generation and the optimization of partially predicated code. In particular, a predicate promotion transformation is introduced to reduce the number of predicated operations, as well as the number of operations used to compute guard registers. An out of &psi;-SSA algorithm is also described, which fixes and improves the algorithm described in [11]. This algorithm is derived from the out of SSA algorithm from Sreedhar et al. [10], where the definitions of liveness and interferences have been extended for the &psi; operations. This algorithm inserts predicated copy operations to restore the correct semantics in the program in a non-SSA form. The &psi;-SSA representation is used in our production compilers, based on the Open64 technology, for the ST200 family processors. In this compiler, predicated code is generated by an if-conversion algorithm performed under the &psi;-SSA representation [12, 1].
An Application Program and Error Sharing Agent Running on Ubiquitous Networks
Authors: Eung Nam Ko, Kee Chun Bang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

This paper presents the design and implementation of an application program an error sharing agent for collaborative multimedia distance education system which is running on RCSM (Reconfigurable Context Sensitive Middleware) for ubiquitous networks. RCSM provides standardized communication protocols to interoperate an application with others under dynamically changing situations. It describes a hybrid software architecture that is running on situationaware middleware for a web based distance education system which has an object with a various information for each session and it also supports multicasting with this information.
Smart Carpet: A Footstep Tracking Interface
Authors: Domnic Savio, Thomas Ludwig
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Distributed computing infrastructures provided by sensor networks supports new ways of observing human motion. In this paper, we discuss algorithms that use data from sensor networks for tracking the gait of human walk. Three methods for identifying footsteps and footstep patterns that describe a walk of a subject are discussed. The methods interpret the data into a set of coordinates that represent a trajectory of the subject's walk. The results show that the proposed methods are more accurate and cost less than existing methods.
New Approach for Cellular Network Improvement
Authors: Stanislav Milanovic
Venue: Proceedings of the First International Conference on the Digital Society (2007)

The backhaul transmission network is the most difficult segment of a cellular network to upgrade for mobile broadband. Backhaul cannot easily be scaled-up and therefore for mobile broadband the capacity bottleneck shifts from the radio link to the backhaul. This paper explores how cellular traffic switching can cut backhaul requirements while improving 2G/3G network flexibility.
Reliability Techniques for RFID-Based Object Tracking Applications
Authors: Ahmad Rahmati, Lin Zhong, Matti Hiltunen, Rittwik Jana
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Radio Frequency Identification (RFID) technology has the potential to dramatically improve numerous industrial practices. However, it still faces many challenges, including security and reliability, which may limit its use in many application scenarios. While security has received considerable attention, reliability has escaped much of the research scrutiny. In this work, we investigate the reliability challenges in RFID-based tracking applications, where objects (e.g., pallets, packages, and people) tagged with low-cost passive RFID tags pass by the RFID reader's read zone. Our experiments show that the reliability of tag identification is affected by several factors, including the inter-tag distance, the distance between the tag and antenna, the orientation of the tag with respect to the antenna, and the location of the tag on the object. We demonstrate that RFID system reliability can be significantly improved with the application of simple redundancy techniques.
A Data Sharing Facility for Mobile Ad-Hoc Emergency and Rescue Applications
Authors: Thomas Plagemann, Ellen Munthe-Kaas, Katrine S. Skjelsvik, Matija Puzar, Vera Goebel, Ulrik Johansen, Joe Gorman, Santiago Perez Marin
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Efficient information sharing is very important for emergency and rescue operations. Mobile Ad-Hoc Networks (MANETs) are often the only network environment for such operations. We have developed the MIDAS Data Space (MDS) to transparently share information among rescue applications in such environments. To achieve the required level of availability for important information, MDS performs optimistic replication. The problems caused by optimistic replication, like consistency management, are not solved by standard solutions; instead we employ tailor-made solutions for emergency and rescue applications.
Scalable network I/O in Linux
Authors: Niels Provos, Chuck Lever
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Recent highly publicized benchmarks have suggested that Linux systems do not scale as well as other systems, such as Windows NT, when used as network servers. Windows NT contains features such as I/O completion ports that help boost network server performance and scalability. In this paper we focus on improving the Linux implementation of poll() to reduce the expense of managing large numbers of network connections. We also explore the newer POSIX RT signal API that will help network servers scale into the next decade. A comparison between the two interfaces shows that a server using our /dev/poll interface scales better than a server using RT signals.
A fast degradation-free algorithm for DCT block extraction in the compressed domain
Authors: Y. Shibata
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A fast, degradation-free solution for the DCT block extraction problem is proposed. The problem is defined as extracting a DCT block from a DCT compressed frame composed of DCT blocks. This problem is encountered in both video/image manipulations in the compressed domain and transcodecs, for example, converting from MPEG to Motion JPEG. Traditionally, solutions involve using the pixel domain manipulation or Chang's (1992) algorithm with approximations. The new solution expands Chang's algorithms, takes full advantage of a fast DCT algorithm, and exploits characteristics of the input DCT blocks without any approximation. The new DCT block extraction achieves 70% performance improvement without any degradation of image quality compared with the conventional solutions.
Highly Reliable Power Aware Memory Design
Authors: Costas Argyrides, Dhiraj K. Pradhan
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

In this paper, an efficient technique for designing RAMs for on chip correction of double errors integrated on H-tree memory architecture is discussed. The reliability of the proposed design is improved by 8X while the Mean Time To Failure is improved 3X while comparing to traditional Hamming codes for a 256Mbits memory chip. The area is sacrificed for these reliability improvements, significant power savings and the performance boost.
Analysis and repair of name tagger errors
Authors: Heng Ji, Ralph Grishman
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Name tagging is a critical early stage in many natural language processing pipelines. In this paper we analyze the types of errors produced by a tagger, distinguishing name classification and various types of name identification errors. We present a joint inference model to improve Chinese name tagging by incorporating feedback from subsequent stages in an information extraction pipeline: name structure parsing, cross-document coreference, semantic relation extraction and event extraction. We show through examples and performance measurement how different stages can correct different types of errors. The resulting accuracy approaches that of individual human annotators.
PSTL: a C++ persistent standard template library
Authors: Thomas Gschwind
Venue: Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6 (2001)

The C++ Standard Template Library provides efficient storage of data in containers, and efficient operations on such containers. While STL can be parameterized with custom allocators, these cannot be used to add persistency to the container cleasses provided by STL. Thus, we have designed the Persistent Standard Template Library (PSTL) that overcomes this by providing its own containers that are compatible with STL, but store their elements on disk. This compatibility provides a programming model that is known and more natural to C++ programmers and enables the reuse of many of the algorithms provided by STL in combination with PSTL. In this paper we discuss PSTL's design, show the challenges we faced, and how STL's design would have to be extended to provide native support for persistency.