ppxscal/embedding_network huggingface dataset:
SAR image segmentation based on mixture context and wavelet hidden-class-label Markov random field
Authors: Ming Li, Yan Wu, Qiang Zhang
Venue: Computers Mathematics with Applications (2009)

In order to suppress the effect of multiplicative speckle noise on Synthetic Aperture Radar (SAR) image segmentation, a new SAR image segmentation algorithm is proposed based on the mixture context and the wavelet hidden-class-label Markov Random Field (MRF). In our paper, a wavelet mixture heavy-tailed model is constructed, and the hidden-class-label MRF is extended to the wavelet domain to suppress the effect of speckle noise. The multiscale segmentation with overlapping window is presented here to segment the finest scale of stationary wavelet transform (SWT) domain, and the classical segmentation method is still utilized at the coarse scales of discrete wavelet transform (DWT) domain, moreover, a mixture context model is proposed to combine the two different segmentation methods. Finally, a new maximum a posteriori (MAP) classification is obtained. The experimental results demonstrate that our segmentation method outperforms several other segmentation methods.
Knowledge Reuse through Categorical Breakdown Analysis: A Method for Collaborative Systems Evaluation
Authors: Will Humphries, D. Scott McCrickard, Dennis Neale
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

Designing CSCW systems that support the widely varying needs of targeted users is difficult. There is no silver bullet technology that enables users to effectively collaborate with one another in different contexts. We propose a method of collaborative systems evaluation that enables novice evaluators to make insightful observations about the systems they evaluate at a level comparable to experts in certain situations. These observations come in the form of a categorical breakdown analysis of a laboratory study. The quantity and type of breakdowns can then be connected to recommended CSCW tools and features developed and described in the related literature. We conducted a study to explore the results generated when the method was applied by both experts and novices in the field of CSCW. We observed that experts found the method to be usable, and that novices capitalized on the knowledge embodied in the breakdown categories to make categorizations similar to those of experts.
AES-Galois Counter Mode Encryption/Decryption FPGA Core for Industrial and Residential Gigabit Ethernet Communications
Authors: Jesús Lázaro, Armando Astarloa, Unai Bidarte, Jaime Jiménez, Aitzol Zuloaga
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

This paper presents an AES-GCM) core. This core has been designed and implemented taking into account two main aspects: It should provide a real throughput, capable of feeding a Gigabit Ethernet, and should be implemented in a commercial FPGA as part of a System-on-a-Chip (SoC). The AES-GCM encryption/authentication algorithm is of key importance as the fact of being introduced in four different standards, from Ethernet to mass storage devices, suggests. This algorithm is interesting because of two different reasons, first it provides authentication and encryption at the same time, and second its structure is highly parallelized. It is composed of two main blocks: an encryption core (AES in current standards) and a Galois Field multiplier.
Secure Multiparty Computation for Comparator Networks
Authors: Gembu Morohashi, Koji Chida, Keiichi Hirota, Hiroaki Kikuchi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We propose a multiparty protocol for comparator networks which are used to compute various functions in statistical analysis, such as the maximum, minimum, median, and quartiles, for example, through sorting and searching. In the protocol, all values which are inputted to a comparator network and all intermediate outputs are kept secret assuming the presence of an honest majority. We also introduce an application of the protocol for a secure (M + 1)-st price auction.
A tree structure for web service compositions
Authors: Demian Antony D'Mello, V. S. Ananthanarayana
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

The composition of Web services is gaining a considerable momentum as an approach to the effective integration of distributed, heterogeneous and autonomous applications to build more sophisticated and value added services. Algorithms are needed to select the best services for the individual tasks of the composition. QoS is an important criterion to select the best service for the tasks of composition. The objective of selection algorithm is to maximize the QoS of the composition based on the composite service provider's (CSP) QoS requirements. In this paper, we define the various business offers (service offers) of Web services. We classify the CSP's requirements defined on the QoS and service offers based on its structure. We propose a tree structure to represent the CSP's requirements defined on the multiple QoS properties and service offers involving AND and OR operators with varied preferences.
Node discovery in networks
Authors: Kishori M. Konwar, Dariusz Kowalski, Alexander A. Shvartsman
Venue: Journal of Parallel and Distributed Computing (2009)

This paper abstracts the problem of network nodes discovering one another in a network of unknown size using all-to-all gossip. The problem is studied in terms of evolving directed graphs where each vertex represents a participating node and each edge represents one node's knowledge about another. Ideally, such a graph has diameter one, i.e., each node knows all others. Nodes share their knowledge by sending gossip messages. Gossip among the nodes allows them to discover one another, decreasing the diameter of the graph. Here this problem is considered in several synchronous settings under different assumptions about the ability of the participating nodes to communicate. Specifically, the following aspects of communication are considered: (1) the ability of the nodes to multicast gossip messages, and (2) the size of the messages. The results describe the lower and upper bounds on the number of synchronous rounds required for the participants to discover each other. A particular question of interest is: if the network size is unknown, how does a node know that it has discovered all other nodes? Given a weakly-connected graph describing the initial knowledge of the nodes, every node in our algorithm can stop the discovery process knowing that there are no unknown nodes-this is done without any prior knowledge of the total number of nodes participating in the computation.
A Nonlinear Approach to Robust Routing Based on Reinforcement Learning with State Space Compression and Adaptive Basis Construction
Authors: Hideki Satoh
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A robust routing algorithm was developed based on reinforcement learning that uses (1) reward-weighted principal component analysis, which compresses the state space of a network with a large number of nodes and eliminates the adverse effects of various types of attacks or disturbance noises, (2) activity-oriented index allocation, which adaptively constructs a basis that is used for approximating routing probabilities, and (3) newly developed control space compression based on a potential model that reduces the control space for routing probabilities. This algorithm takes all the network states into account and reduces the adverse effects of disturbance noises. The algorithm thus works well, and the frequencies of causing routing loops and falling to a local optimum are reduced even if the routing information is disturbed.
Gene Classification Using Codon Usage and Support Vector Machines
Authors: Jianmin Ma, Minh N. Nguyen, Jagath C. Rajapakse
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

Abstract-- A novel approach for gene classification, which adopts codon usage bias as input feature vector for classification by support vector machines (SVM) is proposed. The DNA sequence is first converted to a 59-dimensional feature vector where each element corresponds to the relative synonymous usage frequency of a codon. As the input to the classifier is independent of sequence length and variance, our approach is useful when the sequences to be classified are of different lengths, a condition that homology-based methods tend to fail. The method is demonstrated by using 1,841 Human Leukocyte Antigen (HLA) sequences which are classified into two major classes: HLA-I and HLA-II; each major class is further subdivided into sub-groups of HLA-I and HLA-II molecules. Using codon usage frequencies, binary SVM achieved accuracy rate of 99.3% for HLA major class classification and multi-class SVM achieved accuracy rates of 99.73% and 98.38% for sub-class classification of HLA-I and HLA-II molecules, respectively. The results show that gene classification based on codon usage bias is consistent with the molecular structures and biological functions of HLA molecules.
An architecture evaluation of campus systems toward SOA
Authors: Chia-Chen Yen, Jih-Shih Hsu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The information technology has dramatically changed the infrastructure of campus computing environment in recent years, and a dependable architecture has been getting considerable attentions not only because of the performance issues but also the scalable ability. More recently, the enterprise solutions have shifted to campus systems due to the academic global competition that is in a state of constant change. One of the more intriguing issues prevailing throughout the last few decades of campus system research is the question of how to achieve a flexible and intelligent curriculum system. In this paper, a practical campus curriculum system consisting of a course preparation system, a course enrollment system, and an assessment system is presented, and the core considerations of the proposed architecture are flexibility and intelligence; besides, the evaluation and measurement are also under discussion.
Content in Embedded Sentences
Authors: Uli Sauerland, Mathias Schenner
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

In this overview, we look at embedded clauses that report somebody's attitude or speech. Semantic content in the embedded clause can in some such cases be interpreted from either of two perspectives: that of the speaker or that of the attitude holder/speaker being reported on. Other classes of content do not exhibit this ambiguity. Our overview shows which factors determine the interpretation of embedded linguistic and non-linguistic material and develop a partial explanation.
Shape-Based Interpolation of Binary 3-D Images using Morphological Skeletonization
Authors: Vassilios Chatzis, Ioannis Pitas
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In this paper, the Morphological Skeleton Interpolation (MSI) algorithm is presented. It is an efficient shape-based interpolation method used for interpolating slices between successive slices of a 3-D object. It is based on the well known mathematical morphology procedure of morphological skeletonization, that is used as a representation of an object. The proposed morphological skeleton matching process provides translation, rotation and scaling information at the same time. The interpolated slices preserve the shape of the original object slices, when the slices have similar shapes. It can also modify the shape of an object when the successive slices have not similar shapes. Applications on artificial and real data are also presented.
Entertainment arts and engineering(or how to fast track a new interdisciplinary program)
Authors: Robert Kessler, Mark van Langeveld, Roger Altizer
Venue: ACM SIGCSE Bulletin (2009)

The Entertainment Arts and Engineering (EAE) program is a unique, new undergraduate interdisciplinary program at the University of Utah bringing together the School of Computing and the Division of Film Studies in an effort to teach both video game development and computer animation. Students pursuing a film or computer science degree may enroll in the program as a means of focusing their education on digital arts and entertainment. The key characteristic of the program is the shared classes where students from both Computer Science and Fine Arts study together and cooperate on game and animation projects. The program is highlighted by a yearlong capstone course in which the students work together to make a video game or animated short from scratch. This paper chronicles our efforts starting the EAE program and demonstrates how to create an interdisciplinary program that not only attracts students to CS, but also equips them for careers or research in video games and animation.
Downlink Scheduling Algorithm for Bluetooth Piconet and COV Evaluation
Authors: Qian Zhihong, Liu Dan, Guan Tingyan, Li Tianchi
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

A downlink scheduling algorithm for Bluetooth piconet is presented in this paper, which turns out have good characters of low delay, high channel utilization ratio and desired fairness, and particularly, delays decrease by 41.4%. By this algorithm, a scheduler can work out the estimate number of arrived packets and waiting time for every link pair from its previous polling moment through present moment According to the dynamic polling selection regulation, the scheduler selects a link pair that has the highest priority to poll, and computes the next poll time by the adaptive polling interval regulation. The simulation results indicate that this algorithm has the best overall characters, versus COV (covariance) of the flow rates of link pairs, in downlink traffic modes, compared to other algorithms.
Effects of an online problem based learning course on content knowledge acquisition and critical thinking skills
Authors: Serkan Şendağ, H. Ferhan Odabaşı
Venue: Computers Education (2009)

This study investigated how the online problem based learning (PBL) approach employed in an online learning environment influenced undergraduate students' critical thinking skills (CTS) and content knowledge acquisition. The pretest-posttest control group design was used in the study. The subjects included the students who were enrolled at the Department of Primary School Mathematics Teaching in Anadolu University Education Faculty. Subjects attended to Computer II course in 2008 spring. Experiment group attended the online PBL course whereas the control group attended the online instructor-led course. Each group consisted of 20 students. Data collection tools consisted of a multiple choice content knowledge acquisition scale and the Watson-Glaser critical thinking skills test. The results of two-way mixed design ANOVA indicated that learning in the online PBL group did not have a significant effect on the content knowledge acquisition scores. It was also revealed that learning in the online PBL group had a significant effect on increasing the critical thinking skills.
Multi-attribute Inter-enterprise Exchange of Logistics Services
Authors: Oleg Gujo
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

The exchange of inter-enterprise and intra-enterprise logistics services in the transport logistics sector has recently become more important. Nevertheless, only a few approaches are able to take into consideration the synergy effects between the customer orders in the case of the outsourcing process and the preferences of customers. In this article, an approach is introduced which offers a solution based on combinatorial auctions and multi-attribute bid formation, considers tradeoffs between an optimum allocation of customer orders and a maximum fulfillment of customer preferences in accordance with the strategy of the enterprise, and provides a customer satisfaction index in order to optimize a strategy of logistics service providers in terms of customer loyalty. The simulation results show that the consideration of customer preferences has a significant influence on savings, and that it is also possible to increase the number of fulfilled customer preferences without a significant reduction of savings.
Real world disassembly modeling and sequencing problem: Optimization by Algorithm of Self-Guided Ants (ASGA)
Authors: Mukul Tripathi, Shubham Agrawal, Mayank Kumar Pandey, Ravi Shankar, M. K. Tiwari
Venue: Robotics and Computer-Integrated Manufacturing (2009)

Decrease in product life along with the advent of stringent regulations and environmental consciousness have led to increased concern for methodological product recovery through disassembly operations. This research proposes a fuzzy disassembly optimization model (FDOM) and is aimed at determining the optimal disassembly sequence as well as the optimal depth of disassembly to maximize the net revenue at the end-of-life (EOL) disposal of the product in the real world situations. In order to account for the uncertainty inherent in quality of the returned products, fuzzy control theory is incorporated in the problem environment for modeling the expected value of the recovered modules. Considering the computational complexity of the problem at hand, an innovative approach of Algorithm of Self-Guided Ants (ASGAs) is proposed for the same. The performance of the proposed methodology is benchmarked against a set of test instances that were generated using design of experiment techniques and analysis of variance is performed to determine the impact of various factors on the objective. The robustness of proposed algorithm is authenticated against Ant Colony Optimization and Genetic Algorithm over which it always demonstrated better results thereby proving its superiority on the concerned problem.
VHS to VRML: 3D Graphical Models from Video Sequences
Authors: Andrew Zisserman, Andrew Fitzgibbon, Geoff Cross
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

We describe a method to completely automatically recover 3D scene structure together with a camera for each frame from a sequence of images acquired by an unknown camera undergoing unknown movement. Previous approaches have used calibration objects or landmarks to recover this information, and are therefore often limited to a particular scale. The approach of this paper is far more general, since the "landmarks" are derived and matched automatically directly from the imaged scene texture. The method can be applied to a large class of scenes and motions, and is demonstrated here for sequences of interior and exterior scenes using both controlled-motion and hand-held cameras.We demonstrate two applications of this technology. The first is the construction of 3D graphical models of the scene; the second is the insertion of virtual objects into the original image sequence.
BTOR: bit-precise modelling of word-level problems for model checking
Authors: Robert Brummayer, Armin Biere, Florian Lonsing
Venue: Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning (2008)

This is a proposal for a bit-precise word-level format, called BTOR. It is easy to parse and has precise semantics. In its basic form it allows to model SMT problems over the quantifier-free theory of bit-vectors in combination with one-dimensional arrays. Our main contribution is a sequential extension that can be used to capture model checking problems on the word-level. We present two case studies where BTOR is used as sequential format. Finally, we report on experimental results for the model checking extension of our SMT solver Boolector.
IEEE 802.11g baseband physical layer simulation
Authors: Jan Mikulka, Stanislav Hanus
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

This paper deals with a Matlab simulation of IEEE 802.11g physical layer specification. The Matlab program simulates data transmission over awgn communication channel for mandatory data rates defined in specification. Program includes Barker coding, CCK and OFDM implementation for data rates from 1 Mbit/s to 54 Mbit/s. Basic description of the program and results in graphical and numerical form are introduced as a BER to Eb/N0.
Origami
Authors: Jeffrey Plansker
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

The spot opens outside a contemporary building, where a man is wheeling a dolly loaded with what appears to be sleek, high-tech boxes. The man places one box onto the pavement, and it begins to unfold as if it were a piece of living origami. As each box is placed down, one joins the other in an animated origami style until together they form a life-size Acura MDX.
A Brief Review of Studies of Wikipedia in Peer-Reviewed Journals
Authors: Chitu Okoli
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

Since its establishment in 2001, Wikipedia, "the free encyclopedia that anyone can edit" has become a cultural icon of the unlimited possibilities of the World Wide Web. Thus, it has become a serious subject of scholarly study to objectively and rigorously understand it as a phenomenon. This paper reviews studies of Wikipedia that have been published in peer-reviewed journals. Among the wealth of studies reviewed, major sub-streams of research covered include: how and why Wikipedia works; assessments of the reliability of its content; using it as a data source for various studies; and applications of Wikipedia in different domains of endeavour.
Polynomial algorithms for approximating Nash equilibria of bimatrix games
Authors: Spyros C. Kontogiannis, Panagiota N. Panagopoulou, Paul G. Spirakis
Venue: Theoretical Computer Science (2009)

We focus on the problem of computing an @e-Nash equilibrium of a bimatrix game, when @e is an absolute constant. We present a simple algorithm for computing a 34-Nash equilibrium for any bimatrix game in strongly polynomial time and we next show how to extend this algorithm so as to obtain a (potentially stronger) parameterized approximation. Namely, we present an algorithm that computes a 2+@l4-Nash equilibrium, where @l is the minimum, among all Nash equilibria, expected payoff of either player. The suggested algorithm runs in time polynomial in the number of strategies available to the players.
Unsteady Flow Visualization at Part-Load Conditions of a Radial Diffuser Pump: by PIV and CFD
Authors: J. Feng, F.-K. Benra, H. J. Dohmen
Venue: Journal of Visualization (2009)

The present study provides flow visualization on complex internal flows in a radial diffuser pump under part-load conditions by using the three-dimensional Navier-Stokes code CFX-10 with Detached Eddy Simulation (DES) turbulence model. Particle Image Velocimetry (PIV) measurements have been conducted to validate numerical results. The CFD results show good agreements with experimental ones on both the phase-averaged velocity fields and turbulence field. The detailed flow analysis shows that no separation occurs at 0.75Qdes although a low-velocity zone develops on the rear impeller suction side. Steady flow separations are observed on the impeller suction sides at 0.5Qdes but with different onsets and amounts. When reducing the flow rate to 0.25Qdes, CFD predicts different types of back flows in the impeller region, including steady leading edge separations, rotating vortex in the impeller wake region, and back flow on the impeller pressure side.