ppxscal/embedding_network huggingface dataset:
Super Resolution of 3D Surface Texture Based on Eigen Images
Authors: Junyu Dong, Zuozhen Liu, Zhenwei Yu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

Real-world surface texture generally comprises rough geometry and various reflectance properties, which can dramatically change its appearance under different illumination directions, namely 3D surface texture. Thus, traditional methods for super resolution of 2D texture images cannot be directly used to generate 3D surface texture with higher resolution. This paper presents an efficient method for super resolutionon 3D surface texture. It focuses on synthesizing real-world surface textures with higher resolution and under varied illumination directions. To this extent, it first employs an Eigen-based method to represent 3D surface texture images under multiple illumination directions. Then it modifies the examplebased super resolution method proposed by Freemanet al. to generate new 3D surface texture. Experimental results based on a set of real-world surface textures are presented and show the effectiveness of the new algorithm.
Graph Transformations for Modeling hp-Adaptive Finite Element Method with Triangular Elements
Authors: Anna Paszyńska, Maciej Paszyński, Ewa Grabska
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The paper presents composition graph (CP-graph) grammar, which consists of a set of CP-graph transformations, suitable for modeling triangular finite element mesh transformations utilized by the self-adaptive hp Finite Element Method (FEM). The hp adaptive FEM allows to utilize distributed computational meshes, with finite elements of various size (thus h stands for element diameter) and polynomial orders of approximation varying locally, on finite elements edges and interiors (thus p stands for polynomial order of approximation). The computational triangular mesh is represented by attributed CP-graph. The proposed graph transformations model the initial mesh generation, procedure of h refinement (breaking selected finite elements into son elements), and p refinement (adjusting polynomial orders of approximation on selected element edges and interiors). The graph grammar has been defined and verified by implemented graph grammar transformation software tool.
Truthful reputation mechanisms for online systems: IFAAMAS-07 Victor Lesser distinguished dissertation award
Authors: Radu Jurca
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

The internet is moving rapidly towards an interactive milieu where online communities and economies gain importance over their traditional counterparts. While this shift creates opportunities and benefits that have already improved our day-to-day life, it also brings a whole new set of problems. For example, the lack of physical interaction that characterizes most electronic transactions, leaves the systems much more susceptible to fraud and deception.
IT Audit: A Critical Business Process
Authors: Anna Carlin, Frederick Gallegos
Venue: Computer (2007)

IT audits validate the security, integrity, and privacy of information systems.
Split-merge classification information in video compression
Authors: Bruno Carpentieri
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Given a segmentation with integer labels of the first frame in a video sequence, we describe how to track it in the following frames, maintaining the same labels for the same "objects", while doing displacement estimation for video compression purposes. Furthermore we also show how to "learn" objects and their relationship in the sequence, and how to use the segmentation information to enhance the the video compression process.
An Introduction to High Performance Fortran
Authors: John Merlin, Anthony Hey
Venue: Scientific Programming (1995)

High Performance Fortran (HPF) is an informal standard for extensions to Fortran 90 to assist its implementation on parallel architectures, particularly for data-parallel computation. Among other things, it includes directives for specifying data distribution across multiple memories, and concurrent execution features. This article provides a tutorial introduction to the main features of HPF.
A Study on the Effects of Noise Level, Cleaning Method, and Vectorization Software on the Quality of Vector Data
Authors: Hasan S. Al-Khaffaf, Abdullah Zawawi Talib, Rosalina Abdul Salam
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Correct detection of line attributes by line detection algorithms is important and leads to good quality vectors. Line attributes includes: end points, width, line style, line shape, and center (for arcs). In this paper we study different factors that affect detected vector attributes. Noise level, cleaning method, and vectorization software are three factors that may influence the resulting vector data attributes. Real scanned images from GREC'03 and GREC'07 contests are used in the experiment. Three different levels of salt-and-pepper noise (5%, 10%, and 15%) are used. Noisy images are cleaned by six cleaning algorithms and then three different commercial raster to vector software are used to vectorize the cleaned images. Vector Recovery Index (VRI) is the performance evaluation criteria used in this study to judge the quality of the resulting vectors compared to their ground truth data. Statistical analysis on the VRI values shows that vectorization software has the biggest influence on the quality of the resulting vectors.
Discovery of textual knowledge flow based on the management of knowledge maps
Authors: Xiangfeng Luo, Qingliang Hu, Weimin Xu, Zhian Yu
Venue: Concurrency and Computation: Practice Experience (2008)

Textual knowledge flow (TKF) provides an effective technique and theoretical support for the discovery and cooperation of knowledge innovation, intelligent browsing, and personalized recommendation in Web services and e-Science Knowledge Grid. For the discovery of TKF, firstly knowledge map (KM) is proposed to represent the textual knowledge; then a hash algorithm is used to code KMs in order to form an Island which contains enormous KMs belonging to a domain. Under the control of the Island, C-Location and R-Location are introduced to manage those KMs belonging to an Island. KM-Chord is proposed to manage the number of Islands, C-Locations and R-Locations in Web or a library. With the help of the management of KMs, similar relation and associated relation between KMs are found to build the semantic link network (SLN) between KMs. Based on the SLN and users' profile and input, similar or associated TKF with the user's different demands is activated. Experiments show that the proposed method can effectively discover TKF for Web services and e-Science Knowledge Grid. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A system for supporting group exercise in software development with facilities to create an optimal plan of student grouping and team formation of each group
Authors: Hiroaki Hashiura, Toru Kuwabara, Yumei Qiu, Koutarou Yamashita, Tatsuya Ishikawa, Kiyomi Shirakawa, Seiichi Komiya
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

In the recent years, software development has become larger in scale and more complicated. Furthermore, development with faster delivery and lower cost is required, thus the software development environment is becoming more and more critical. Therefore, companies are seeking high potential students in universities who have a practical sense. The information science and engineering department of Shibaura Institute of Technology provides group exercise classes that adopt a more practical approach to software development such that students can obtain the knowledge and skills necessary for software development (strictly it is a team exercise in the sense that each member of the group shares the tasks for software development). However, as the class hours assigned for learning software engineering are not sufficient, EtUDE (Environment for Ultimate software Development Exercise), the support system that learners can collectively practice at any time anywhere was developed, and introduced to the exercise classes. However, as the skills of software development differ from one student to another, the problem that some teams are not able to accomplish the assignment by the deadline often occurs. Therefore, the authors developed EtUDE/GO, which automatically generates the best plan for team formation. Optimizing team formation with this system, we can solve the problem attributable to difference in students' software development skills. This paper discusses the system overview of EtUDE/GO as well as the consequence of applying the system.
Robot Mice Draw Crowds, TV Coverage at NCC
Authors: J. Schallan
Venue: Computer (1978)

The first time trial of the IEEE Spectrum/Computer Amazing Micro-Mouse Maze Contest brought large audiences and CBS affiliate KNXT of Los Angeles to the IEEE booth at the NCC's Personal Computing Festival. 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
Fuzzy-Aided Syntactic Scene Analysis
Authors: Marzena Bielecka, Marek Skomorowski
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

In syntactic pattern recognition a pattern can be described by a graph. The problem of recognition is to determine if a pattern, represented by a describing graph, belongs to a language L(G), generated by a graph grammar G. The so-called IE graphs are used for pattern description. They are generated by so-called ETPL(k) graph grammars. The purpose of this paper is to present an idea of a new approach to syntactic recognition of fuzzy patterns represented by fuzzy IE graphs, followed the example of random IE graphs. This methodology can be used in embodied multi-agent systems for a scene analysis.
School Curriculum Development to Promote Student Spontaneous Diagram Use in Problem Solving
Authors: Yuri Uesaka, Emmanuel Manalo
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Although previous research has demonstrated that diagrams are powerful tools for problem solving, studies relating to educational practices indicate that students manifest various problems in diagram use. There are studies that have proposed teaching methods to address these problems, but these methods are not fully integrated with the school curriculum. This paper reports on the development of an instruction and support program to promote students' spontaneous use of diagrams as part of a school curriculum. The program was provided to students in the first grade of a public high school in collaboration with the teachers. Findings from a survey and interviews with the students showed that, following the program, their daily learning behaviors involving diagram use improved. These findings suggest the effectiveness of providing graphic literacy education as part of the school curriculum.
Announcing the B 5000
Authors: Ken T. Bement
Venue: IEEE Annals of the History of Computing (1987)

A internal announcement dated February 10, 1961, addressed to the Equipment and Systems Marketing Division of the Burroughs Corporation, and sent by the author. A brief overview of the system specifications is included. 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
Effect of Scan Angle and Reconstruction Algorithm on Model Observer Performance in Tomosynthesis
Authors: I. Reiser, B. A. Lau, R. M. Nishikawa
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

The goal of this work is to develop task-based figures of merit for the assessment of tomosynthesis imaging. Towards this aim, we have computed performance of a prewhitening model observer for a SKE detection task in uniform background, in the in-focus plane of a the signal in the reconstructed tomosynthesis volume, as well as signal contrast. Test images were computer generated and reconstructed using both iterative ML-EM and filtered backprojection. We found that in noiseless images, signal contrast was substantially higher for the FBP reconstruction. For ML-EM reconstruction, model observer performance decreased with iteration number. At 10 iterations, performance was similar to that of FBP reconstruction. We found an increase of model observer performance with scan angle in the ML-EM reconstructed images. FBP showed a slight decrease of observer performance with scan angle. The results of this study are limited by the task, which is not realistic because backgrounds do not contain structure noise. This will be addressed in the future.
Streaming source coding with delay
Authors: Anant Sahai
Venue:  (2007)

Traditionally, information theory is studied in the block coding context&mdash;all the source symbols are known in advance by the encoder(s). Under this setup, the minimum number of channel uses per source symbol needed for reliable information transmission is understood for many cases. This is known as the capacity region for channel coding and the rate region for source coding. The block coding error exponent (the convergence rate of the error probability as a function of block length) is also studied in the literature. In this thesis, we consider the problem that source symbols stream into the encoder in real time and the decoder has to make a decision within a finite delay on a symbol by symbol basis. For a finite delay constraint, a fundamental question is how many channel uses per source symbol are needed to achieve a certain symbol error probability. This question, to our knowledge, has never been systematically studied. We answer the source coding side of the question by studying the asymptotic convergence rate of the symbol error probability as a function of delay&mdash;the delay constrained error exponent. The technical contributions of this thesis include the following. We derive an upper bound on the delay constrained error exponent for lossless source coding and show the achievability of this bound by using a fixed to variable length coding scheme. We then extend the same treatment to lossy source coding with delay where a tight bound on the error exponent is derived. Both delay constrained error exponents are connected to their block coding counterpart by a "focusing" operator. An achievability result for lossless multiple terminal source coding is then derived in the delay constrained context. Finally, we borrow the genie-aided feed-forward decoder argument from the channel coding literature to derive an upper bound on the delay constrained error exponent for source coding with decoder side-information. This upper bound is strictly smaller than the error exponent for source coding with both encoder and decoder side-information. This "price of ignorance" phenomenon only appears in the streaming with delay setup but not the traditional block coding setup. These delay constrained error exponents for streaming source coding are generally different from their block coding counterparts. This difference has also been recently observed in the channel coding with feedback literature.
Optimization of the Routing Table Lookup Algorithm for IPv6
Authors: Jinxian Lin, Huimin Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

With the extensive application of IPv6 protocol, the traditional IPv4 routing table lookup algorithms no longer satisfy the need of routing forward in the IPv6 network environment. So we optimize the routing table lookup algorithm to adapt for IPv6 that employs Bloom filters to realize parallel longest prefix match. The algorithm efficiently narrows the scope of the search, reduces the average time of hash probe per lookup, and thereby enhances lookup speed.
A New Logarithmic Normalization Method in Games Theory
Authors: Edmundas Kazimieras Zavadskas, Zenonas Turskis
Venue: Informatica (2008)

Multi-criteria decision making is used in many areas of human activities. Each alternative in multi-criteria decision making problem can be described by a set of criteria. Criteria can be qualitative and quantitative. They usually have different units of measurement and different optimization direction. The normalization aims at obtaining comparable scales of criteria values. The normalization of criteria values is not always needed, but it may be essential. In the new program LEVI 3.1 the following normalization methods are possible: vector, linear scale, non-linear and new logarithmic techniques. Logarithmic normalization has never been used before. The present research is focused on introducing a new logarithmic method for decision making matrix normalization.
Towards Reconfigurable Circuits Based on Ternary Controlled Analog Multiplexers/Demultiplexers
Authors: Emilia Sipos, Lelia Festila, Gabriel Oltean
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

The multiplexers are used in a wide range of applications. At present, they are controlled by binary signals. To reduce the number of interconnections, ternary signals are proposed to be used to control analog multiplexers/demulti-plexers. The analog multiplexers/demultiplexers are realized with CMOS transmission gates, their control circuits being designed using CMOS ternary inverters. The technology used to design ternary inverters is SUS-LOC. A 3-to-1 analog multiplexer is proposed in the design of a reconfigurable ternary inverter.
Knowledge Aquisition and Data Storage in Mobile GeoSensor Networks
Authors: Peggy Agouris, Dimitrios Gunopulos, Vana Kalogeraki, Anthony Stefanidis
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

In this paper we address the issue of mobility in geosensor networks, inspired by the computational challenges imposed by modern surveillance applications. More specifically we consider networks of optical sensors (video and still cameras), and present a spatiotemporal framework for the management of information captured in them. In this context, mobility is addressed at two levels, considering mobile objects in the area monitored by a network, and mobile sensors observing such objects. Our interest lies on the data acquisition and storage problems that arise in this setting. We identify certain key issues behind the development of a general framework for knowledge acquisition and data storage in geosensor networks, namely: spatiotemporal object modeling; similarity metrics to compare spatiotemporal objects; storing and indexing spatiotemporal objects in a geosensor network; and network management using spatiotemporal techniques. We present some emerging approaches that address these key issues and thus outline a general framework for information and sensor management in mobile sensor networks.
Recognition of Car License Plates Using Morphological Features, Color Information and an Enhanced FCM Algorithm
Authors: Kwang-Baek Kim, Choong-Shik Park, Young Woon Woo
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

In modern days, it is very hard to regulate cars of traffic lights violation and speed violation as well as parking violation and management of cars in parking places because of rapid increase of cars. In this paper, we proposed an intelligent recognition system of car license plates to mitigate these problems. The processing sequence of the proposed algorithm is as follows. At first, a license plate segment is extracted from an acquired car image using morphological features and color information, and noises are eliminated from the extracted license plate segment using a line scan algorithm and a grass fire algorithm, and then individual codes are extracted from the license plate segment using 4-directional edge tracking algorithm. Finally the extracted individual codes are recognized by an enhanced FCM algorithm. The enhanced FCM algorithm is a clustering algorithm improved from conventional clustering algorithms having problems that undesirable clustering results to be acquired because of distribution of patterns in cluster spaces. In order to evaluate performance of segment extraction and code recognition of the proposed method, we used 150 car images for experiment. In the results, we could verify the proposed method is more efficient and recognition performance is improved in comparison with conventional car license plate recognition methods.
Using a Creativity Workshop to Generate Requirements for an Event Database Application
Authors: Claudia Schlosser, Sara Jones, Neil Maiden
Venue: Proceedings of the 14th international conference on Requirements Engineering: Foundation for Software Quality (2008)

This paper describes one experience of using a creativity workshop to generate requirements for an event database application for a network of German Chambers of Commerce (CCI's). The workshop described was the first to be run by the host organization. Techniques used during the workshop included discussion of system boundaries and use of creativity triggers. We discuss the results from the workshop in terms of the number and importance to stakeholders of the requirements generated. We end with a presentation of lessons learnt for improved creative practices in requirements engineering.
ID-Based (t,n) Threshold Proxy Signcryption for Multi-agent Systems
Authors: Fagen Li, Yupu Hu, Shuanggen Liu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

A (t,n) threshold proxy signcryption scheme allows t or more proxy signcrypters from a designated group of n proxy signcrypters to signcrypt messages on behalf of an original signcrypter. In this paper, an identity-based (t,n) threshold proxy signcryption scheme using bilinear pairings is proposed. Our construction is based on Baek and Zheng's pairing-based verifiable secret sharing scheme and Libert and Quisquater's identity-based signcryption scheme. As compared to the previous threshold proxy signcryption schemes, the key management problem in our scheme is simplified because of using identity-based cryptography. We also present an application of our scheme in multi-agent systems.