ppxscal/embedding_network huggingface dataset:
Grey Weighted Polar Distance Transform for Outlining Circular and Approximately Circular Objects
Authors: Kristin Norell, Joakim Lindblad, Stina Svensson
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We introduce the polar distance transform and the grey weighted polar distance transform for computation of minimum cost paths preferring circular shape, as well as give algorithms for implementations in a digital setting. An alternative to the polar distance transform is to transform the image to polar coordinates, and then apply a Cartesian distance transform. By using the polar distance transform, resampling of the image and interpolation of new pixel values are avoided. We also handle the case of grey weighted distance transform in a 5 X 5 neighbourhood, which, to our knowledge, is new. Initial results of using the grey weighted polar distance transform to outline annual rings in images of log end faces are presented.
Defending Against Barrier Intrusions with Mobile Sensors
Authors: Guanqun Yang, Wei Zhou, Daji Qiao
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Deploying wireless sensor networks has been recognized as one of the effective and cost-efficient ways to defend remote barrier regions such as international territorial borders. It has also been demonstrated recently that, by introducing sensor mobility into the wireless sensor network, the network coverage performance can be greatly improved. In this paper, we employ a game theoretic approach to study the problem of defending against barrier intrusions with mobile sensors, and demonstrate the equilibriums between barrier intrusions and sensor movement strategies in both non-obstructed and obstructed barriers. In particular, we derive the optimal sensor movement strategy to defend non-obstructed barriers, and propose a Dijkstra-like algorithm to generate a sensor movement strategy that performs well in defending obstructed barriers. We verify the correctness of our theoretic analysis by conducting in-depth simulations under various barrier intrusion and sensor movement scenarios.
Problems in Acquisition and Representation of Coronary Arterial Trees
Authors: C. F. Starmer
Venue: Computer (1975)

The nature of the contractions of the heart wall has long been recognized as indicative of the presence and degree of atherosclerotic lesions in the coronary arteries. More recently, the coronary arterial tree itself has been studied and the changes in length of the arterial segments during a heart cycle have been shown to have diagnostic value for coronary artery disease. Further, it has been proposed that the geometry of the tree influences the nature and location of lesions in the walls of the coronary vessels.
Stumbling Forward into the Connected Future
Authors: Jim Miller
Venue: IEEE Internet Computing (2007)

How do we stay connected as the Internet grows beyond its initial bounds toward the broader world of consumer products? The Home SysAdmin tries to answer this question.
An Optimized Time-constraint Job Distribution Scheme in Group based P2P Networks
Authors: Yong-Hyuk Moon, Jae-Hoon Nah, Jong-Soo Jang, Chan-Hyun Youn
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Peer-to-Peer (P2P) technology benefits from a tractable and flexible job distribution scheme. However due to the dynamic nature of P2P, the optimal decision point of job scheduling is still unpredictable and some DLT-like heuristics are not sufficient to be a promising candidate for this role. As a reason of that, in this paper we have proposed the optimized time-constraint job distribution scheme in group based P2P networks. This scheme supports the hybrid type of jobs according to divisibility property. Also, it provides the methodology (3 phase-algorithms) which guarantees efficient job distribution under the condition of minimum completion time of executing jobs. Through the simulation in the aspects of balancing and minimum completion time, we will discuss about its performance evaluation.
A New Verification Rule and Its Applications
Authors: J. C. Huang
Venue: IEEE Transactions on Software Engineering (1980)

This paper describes a verification rule for loop programs, and shows how it can be used in conjunction with the invariant-relation theorem to facilitate verification of programs.
Orthogonal Latin Square Configuration for LSI Memory Yield and Reliability Enhancement
Authors: M. Y. Hsiao
Venue: IEEE Transactions on Computers (1975)

When errors occur which exceed the correction capability of an error correcting code, the only recourse to restore the original memory function is to physically replace the failed entity. In this paper the authors propose an automatic reconfiguration technique which uses the concept of address skewing to disperse such multiple errors into correctable errors. No additional redundancy other than that required for the error correcting code is needed. The skewing mechanism is derived using the theory of orthogonal Latin squares.
Brief paper: Design of noise and period-time robust high-order repetitive control, with application to optical storage
Authors: Maarten Steinbuch, Siep Weiland, Tarunraj Singh
Venue: Automatica (Journal of IFAC) (2007)

Repetitive control is useful if periodic disturbances or setpoints act on a control system. Perfect (asymptotic) disturbance rejection is achieved if the period time is exactly known. The improved disturbance rejection at the periodic frequency and its harmonics is achieved at the expense of a degraded system sensitivity at intermediate frequencies. A convex optimization problem is defined for the design of high-order repetitive controllers, where a trade-off can be made between robustness for changes in the period time and for reduction of the error spectrum in-between the harmonic frequencies. The high-order repetitive control algorithms are successfully applied in experiments with the tracking control of a CD-player system.
Adaptation Method for Level of Detail (LOD) of 3D contents
Authors: Hakran Kim, Yongik Yoon, Hwajin Park
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In this research we present a method for adaptation of 3D contents over ubiquitous environment. The need of contents adaptation and delivery is growing to support multiple target platforms for single source. Since contents base on computer graphics deal with a large data set and a high performance, a service adaptation for context changing is required to manipulate graphics contents with a more complicated method in multiple devices such as desktops, laptops, PDAs, mobile phones, etc. This paper presents some theoretical method for adaptation, which is Service Rendering Middleware, and device-based decision making algorithm for LOD of 3D contents. Service Rendering Middleware consists of Service Adaptation (SA) for analyzing environments, Service Rendering (SR) for reconfiguring customized services and LOD Algorithm for generating an adapted service by processing customized data according to the level of detail. Also, the decision-making algorithm, which is based on device capabilities, is used both in LOD algorithm module and method to decide level of 3D contents.
Software Fault Prediction using Language Processing
Authors: David Binkley, Henry Feild, Dawn Lawrie, Maurizio Pighin
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Accurate prediction of faulty modules reduces the cost of software development and evolution. Two case studies with a language-processing based fault prediction measure are presented. The measure, refereed to as a QALP score, makes use of techniques from information retrieval to judge software quality. The QALP score has been shown to correlate with human judgements of software quality. The two case studies consider the measure's application to fault prediction using two programs (one open source, one proprietary). Linear mixed-effects regression models are used to identify relationships between defects and QALP score. Results, while complex, show that little correlation exists in the first case study, while statistically significant correlations exists in the second. In this second study the QALP score is helpful in predicting faults in modules (files) with its usefulness growing as module size increases.
Efficient and compact indexing structure for processing of spatial queries in line-based databases
Authors: Hung-Yi Lin
Venue: Data Knowledge Engineering (2008)

Points, lines and regions are the three basic entities for constituting vector-based objects in spatial databases. Many indexing schemes have been widely discussed for handling point or region data. These traditional schemes can efficiently organize point or region objects in a space into a hashing or hierarchical directory, and they provide efficient access methods for accurate retrievals. However, two difficulties arise when applying such methods to line segments: (1) the spatial information of line segments may not be precisely expressed in terms of that of points and/or regions, and (2) traditional methods for handling line segments can generate a large amount of dead space and overlapping areas in internal and external nodes in the hierarchical directory. The first problem impedes high-quality spatial conservation of line segments in a line-based database, while the second degrades the system performance over time. This study develops a novel indexing structure of line segments based on compressed B^+ trees. The proposed method significantly improves the time and space efficiencies over that of the R-tree indexing scheme.
Synopsis Data Structures for XML Databases: Models, Issues, and Research Perspectives
Authors: Angela Bonifati, Alfredo Cuzzocrea
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Due to the lack of efficient native XML database management systems, XML data manipulation and query evaluation may be resource-consuming, and represent a bottleneck for several computationally intensive applications. To overcome the above limitations, a possible solution consists in computing synopsis data structures from XML databases, i.e. compressed representations providing a "succinct" description of the original databases while ensuring low computational overhead and high accuracy for many XML processing tasks. Specifically, these data structures are very useful for both selectivity estimation and approximate query answering purposes. On the other hand, while synopsis data structures have been widely applied to relational as well as multidimensional data, a full usage for XML data is still lacking. Inspired by these considerations, in this paper we discuss the models and issues of synopsis data structures for XML databases, and we complete our analysis by selecting and discussing future perspectives for this research field.
Designing Intelligence Augmentation System with a Semiotic-Oriented Software Development Process
Authors: Andre Luis Ogando Paraense, Ricardo Ribeiro Gudwin, Rodrigo de Almeida Goncalves
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper, the authors describe the first steps of a semiotic-oriented software development process called "Brainmerge" [1], and present a case study where the process is used to coordinate the steps required for the design of a locomotive and car assignment system, modeled as an Intelligence Augmentation Systems (IAS). IAS represent an extension of Decision Support Systems (DSS) [2] with the use of Peircean semiotics [4], intelligence augmentation techniques [3], computational agents [5] and usually dynamic decision making processes (DDMP). IAS are suitable for DDMP. Traditional software methodologies are usually inefficient when dealing with IAS, and our methodology aims at fulfilling these shortcomings. This work considers the resolution of a real world problem of tactical planning in railroads where such DDMP play a key role.
High doped MBE Si p-n and n-n heterojunction diodes on 4H-SiC
Authors: A. Pérez-Tomás, M. R. Jennings, M. Davis, V. Shah, T. Grasby, J. A. Covington, P. A. Mawby
Venue: Microelectronics Journal (2007)

The physical and electrical properties of heavily doped silicon (5x10^1^9cm^-^3) deposited by molecular beam epitaxy (MBE) on 4H-SiC are investigated in this paper. Silicon layers on silicon carbide have a broad number of potential applications including device fabrication or passivation when oxidised. In particular, Si/SiC contacts present several atractive material advantages for the semiconductor industry and especially for SiC processing procedures for avoiding stages such as high temperature contact annealing or SiC etching. Si films of 100nm thickness have been grown using a MBE system after different cleaning procedures on n-type (0001) Si face 8^o off 4H-SiC substrates. Isotype (n-n) and an-isotype (p-n) devices were fabricated at both 500 and 900^oC using antimonium (Sb) or boron (B), respectively. X-ray diffraction analysis (XRD) and scanning electronic mircorscope (SEM) have been used to investigate the crystal composition and morphology of the deposited layers. The electrical mesurements were performed to determine the rectifiying contact characteristics and band offsets.
Interconnect-Centric Computing
Authors: William J. Dally
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

As we enter the many-core era, the interconnection networks of a computer system, rather than the processor or memory modules, will dominate its performance. Several recent developments in interconnection network architecture including global adaptive routing, high-radix routers, and technology-matched topologies offer large improvements in the performance and efficiency of this critical component. The implementation of a portion of several interconnection networks on multi-core chips also raises new opportunities and challenges for network design. This talk explores the role of interconnection networks in modern computer systems, recent developments in network architecture and design, and the challenges of on-chip interconnection networks. Examples will be drawn from several systems including the Cray BlackWidow.
Resource Management/Scheduling
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

We present cluster delegation, an enhancement to the NFSv4 file system, that improves both performance and recoverability in computing clusters. Cluster delegation allows data sharing among clients by extending the NFSv4 delegation model so that multiple clients manage a single file without interacting with the server. Based on cluster delegation, we implement a fast commit primitive, cooperative caching, and the ability to recover the uncommitted updates of a failed computer. Cluster delegation supports both read and write operations in the cooperative cache, while preserving the consistency guarantees of NFSv4. We have implemented cluster delegation by modifying the Linux NFSv4 client and show that it improves client performance and reduces server load by more than half. 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
Attention links sensing to recognition
Authors: Albert L. Rothenstein, John K. Tsotsos
Venue: Image and Vision Computing (2008)

This paper presents arguments that explicit strategies for visual attentional selection are important for cognitive vision systems, and shows that a number of proposals currently exist for exactly how parts of this goal may be accomplished. A comprehensive survey of approaches to computational attention is given. A key characteristic of virtually all the models surveyed here is that they receive significant inspiration from the neurobiology and psychophysics of human and primate vision. This, although not necessarily a key component of mainstream computer vision, seems very appropriate for cognitive vision systems given a definition of the topic that always includes the goal of human-like visual performance. A particular model, the Selective Tuning model, is overviewed in some detail. The growing neurobiological and psychophysical evidence for its biological plausibility is cited highlighting the fact that it has more biological support than other models; it is further claimed that it may form an appropriate starting point for the difficult task of integrating attention into cognitive vision systems.
A class of generalized models for shadowed fading channels
Authors: Saralees Nadarajah, Samuel Kotz
Venue: Wireless Personal Communications: An International Journal (2007)

The commonly used models for shadowed fading channels arise by compounding the Nakagami distribution with others such as the log-normal and gamma distributions. A distribution that is more flexible than the Nakagami distribution is the well known Weibull distribution. In this paper, we derive a collection of generalized models for shadowed fading channels by compounding the Weibull distribution with other distributions belong to some fifteen flexible families. We also illustrate the superior performance of these models over the standard Nakagami models.
Continuous program improvement: a project to automate record-keeping for accreditation
Authors: Larry Booth, Jon Preston, Junfeng Qu
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Preparing for an accreditation visit is generally viewed as a huge ask. The new accreditation guidelines for Information Technology (IT) suggest that accreditation should not be viewed as a discrete event. With an emphasis on outcomes, assessment, and continuous improvement, the guidelines seek to encourage IT departments to look at accreditation as a continuous process; an iteration of data collection, analysis, and change. To that end, the IT Department at Clayton State University has developed a prototype system that maps the department's outcomes and course objectives to ABET-CAC's outcomes for IT. Student assignments are mapped to course objectives and program outcomes. Students submit their work for assessment via the web. Assessment metadata is extracted and used to revise individual courses and the program as a whole. To develop this system, students in database, ecommerce, programming, and quality assurance courses teamed with faculty to design and implement a prototype. The initial design was described in an earlier paper. Here, the development process and the prototype are described and a SQL script is provided so that other IT departments can create their own systems, benefiting from the work completed.
IDDQ Test Challenges in Nanotechnologies: A Manufacturing Test Strategy
Authors: Yu Wei P'ng, Moo Kit Lee, Peng Weng Ng, Chin Hu Ong
Venue: Proceedings of the 16th Asian Test Symposium (2007)

The implementation of IDDQ test is increasingly challenging with the shrinking of process geometry in nanotechnologies. This paper presents a case study of the test challenges that the industry is facing in deep submicron process. An IDDQ manufacturing test strategy is discussed to address the challenges.
Propositional theories are strongly equivalent to logic programs
Authors: Pedro Cabalar, Paolo Ferraris
Venue: Theory and Practice of Logic Programming (2007)

This paper presents a property of propositional theories under the answer sets semantics (called Equilibrium Logic for this general syntax): any theory can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two different proofs for this result: one involving a syntactic transformation, and one that constructs a program starting from the countermodels of the theory in the intermediate logic of here-and-there.
Provision of differentiated performance in Optical Burst Switching networks based on burst assembly processes
Authors: Mushi Jin, Oliver W. W. Yang
Venue: Computer Communications (2007)

Optical Burst Switching (OBS) has been designed as a practical solution for the high-speed transport network using enabling optical technologies, which can work without optical buffering or pure optical signal processing in the intermediate nodes. As a collection of many packets, optical bursts exhibit different traffic characteristics in the bufferless optical core networks compared to the packet-level traffic in the conventional electronic switching systems. However, many OBS studies often neglect this issue by assuming the inputs to be optical bursts when analyzing the system performance. This paper demonstrates that the loss performance of optical bursts is dramatically different when considering burst assembly process at the edge nodes and the connectivity of the core nodes. We develop some analytical models which can model the loss performance more accurately than the traditional methods. Based on our observations, we propose a scheme to support differentiated loss performances for optical bursts by modifying the burst assembly parameters at the source edge nodes. Our scheme is implemented at the edge nodes and there is no specific requirement to the core nodes. Thus, our design provides good flexibility and scalability in the heterogeneous Internet.
Introducing Fuzziness on Snake Models for Off-Line Signature Verification: A Comparative Study
Authors: J. F. Velez, A. Sanchez, A. B. Moreno, J. L. Esteban
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper presents an experimental comparison of different hybrid snake-based algorithms for automatic off-line signature verification. Snakes are usually applied to different image analysis tasks, especially to segmentation. Off-line signature verification aims to establish the degree of genuineness between one given test signature and one reference signature. Due to the intrapersonal variability in human signatures, a system with tolerance to imprecision seems be appropriate for this verification task. Our work aims to study how effective is introducing fuzziness to tackle this image analysis problem. We developed several hybrid snake algorithms adapted to the practical requirements of automatic signature verification. Fuzziness is introduced in the feature extraction stage and during the signature verification (or classification) stage. Our work compares four different hybrid snake- based approaches for this verification problem using the corresponding FAR and FRR biometric errors. Experimental results have shown that none of the tested approaches clearly outperforms the other ones.
Chinese Keyword Extraction Based on Word Platform
Authors: Hui Jiao, Qian Liu, Hui-bo Jia
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

At present researches on Chinese keyword extraction mainly focus on automatic segmentation which is a pretreatment problem. This paper presents a kind of Chinese encoding method based on word platform, and establishes a new Chinese document format in computer. This method makes word the smallest information unit. Chinese keyword extraction does not rely on segmentation by this new method. Thereby the efficiency and quality could be improved. Statistical analysis is adopted to conduct the experiment of keyword extraction based on word platform, and experimental results are satisfying.