ppxscal/embedding_network huggingface dataset:
A new class of projection and contraction methods for solving variational inequality problems
Authors: D. Han
Venue: Computers Mathematics with Applications (2006)

This paper presents a new class of projection and contraction methods for solving monotone variational inequality problems. The methods can be viewed as combinations of some existing projection and contraction methods and the method of shortest residuals, a special case of conjugate gradient methods for solving unconstrained nonlinear programming problems. Under mild assumptions, we show the global convergence of the methods. Some preliminary computational results are reported to show the efficiency of the methods.
Texture-Based Simultaneous Registration and Segmentation of Breast DCE-MRI
Authors: Yang Can Gong, Michael Brady
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

We present a registration method for breast dynamic contrast-enhanced(DCE) MRI data based on texture information. The algorithm combines feature and spatial information to propose an image segmentation based on a Hidden Markov Random Measure Field(HMRMF) model using expectation-maximisation(EM) iteration. It can be used to simultaneously estimate parameters in order to segment and register the images iteratively. Global motions are modeled by an affine transformation, while local breast motions are described using free-form deformations(FFD) based on B-splines. Experimental results on real DCE-MRI data are presented to demonstrate the performance of the algorithm.
Attentive Presentation Agents
Authors: Tobias Eichner, Helmut Prendinger, Elisabeth André, Mitsuru Ishizuka
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

The paper describes an infotainment application where life-like characters present two MP3 players in a virtual showroom. The key feature of the system is that the presenter agents analyze the user's gaze-behavior in real-time and may thus adapt the presentation flow accordingly. In particular, a user's (non-)interest in interface objects and also preference in decision situations is estimated automatically by just using eye gaze as input modality. A formal study was conducted that compared two versions of the application. Results indicate that attentive presentation agents support successful grounding of deictic agent gestures and natural gaze behavior.
Automatic Adjustment of Rigs to Extracted Skeletons
Authors: Jorge E. Ramirez, Xavier Lligadas, Antonio Susin
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

In the animation, the process of rigging a character is an elaborated and time consuming task. The rig is developed for a specific character, and it can not be reused in other meshes. In this paper we present a method to automatically adjust a human-like character rig to an arbitrary human-like 3D mesh, using a extracted skeleton obtained from the input mesh. Our method is based on the selection and extraction of feature points, to find an equivalence between an extracted skeleton and the animation rig.
Virtual gratifications of wireless Internet: Is wireless portable Internet reinforced by unrealized gratifications?
Authors: Dong Hee Shin
Venue: Telematics and Informatics (2009)

As wireless broadband is rapidly emerging around the world, this paper investigates the uses and gratifications of wireless portable Internet in Korea. Methodology includes exploratory factor analysis, confirmatory analysis, and multiple regression analysis of subsequent theoretical constructs. Results describe four key dimensions related to consumer use of wireless broadband, including process, content, and social gratifications, as previously found in studies of the Internet, as well as an embedded gratification that is unique to wireless broadband use. All four dimensions of gratification are relevant to managing wireless broadband, and measures developed from the gratification profiles identified here can serve as trait-valid scales in new virtual reality.
Some Notes on Degree Spectra of the Structures
Authors: Iskander Kalimullin
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

In the paper the problem of existence of an algebraic structure with the degree spectra $\{\bf x:\bf x\not\le\bf b\}$ is studied for arbitrary degree b.
Making Quantitative Measurements of Privacy/Analysis Tradeoffs Inherent to Packet Trace Anonymization
Authors: William Yurcik, Clay Woolam, Greg Hellings, Latifur Khan, Bhavani Thuraisingham
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Anonymization provides a mechanism for sharing data while obscuring private/sensitive values within the shared data. However, anonymization for sharing also sets up a fundamental tradeoff --- the stronger the anonymization protection, the less information remains for analysis. This privacy/analysis tradeoff has been descriptively acknowledged by many researchers but no one has yet attempted to quantify this tradeoff. We perform anonymization options on network packet traces and make empirical measurements using IDS alarms as an indicator for security analysis capability. Preliminary results show most packet fields have unexpected complex tradeoffs while only two fields exhibiting the classic zero sum tradeoff.
A Watermarking Scheme in the Encrypted Domain for Watermarking Protocol
Authors: Bin Zhao, Lanjun Dang, Weidong Kou, Jun Zhang, Zan Li, Kai Fan
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

In most watermarking schemes for copyright protection, a seller always knows the embedded watermark identifying a buyer. However, it incurs both repudiation issue and framing issue. To solve these problems, many watermarking protocols have been proposed based on watermarking schemes in the encrypted domain. In this paper, we enhance an existing watermarking scheme and discuss public key cryptosystems used in watermarking protocols. Then, a new watermarking scheme in the encrypted domain with flexible watermarking capacity is proposed for watermarking protocol. It improves the robustness of watermarked image against JPEG compression after decryption and enables image tampering detection. The blind watermark extracting employs the same threshold criterion and secret keys as watermark embedding. Experimental results demonstrate that the enhanced scheme reduces computing overload and increases effective watermarking capacity, and that the proposed watermarking scheme in the encrypted domain outperforms a previous scheme.
Performance, Benchmarking and Sizing in Developing Highly Scalable Enterprise Software
Authors: Xiaoqing Cheng
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

Performance and scalability are essential characteristics of large-scale enterprise software. This paper presents the technologies behind the processes implemented at SAP. During the specification, design and implementation phases, Performance Design Patterns are used as guidelines, which also define the Key Performance Indicators (KPI) for performance and scalability tests. With proven scalability of software applications, SAP's Sizing Process enables the transformation of business requirements into hardware requirements. It also allows SAP's customers to flexibly configure their specific applications, on operating system (OS), database (DB), and hardware platforms of their choice. The SAP Standard Application Benchmarks are developed and executed to test the scalability in extremely high load situations and to verify the sizing statements from the sizing process. They are also used for SAP internal regression tests across releases, and by SAP's hardware partners for platform tests. Besides the response time centric performance testing, analysis and optimization, SAP follows a KPI-focused approach which permits potential performance problems to be reliably predicted already in simple and easy-to-execute tests. The SAP NetWeaver Portal Benchmark is used to demonstrate how to conduct performance and scalability tests using single user tests and load tests. We will introduce the KPIs used for Java memory analysis and optimization. Finally, this paper shows how the results of these tests can be used in hardware sizing in customer implementation projects. 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
Technological intersubjectivity and appropriation of affordances in computer supported collaboration
Authors: Daniel D. Suthers
Venue:  (2007)

This dissertation investigates two specific research questions related to the effects of culture on appropriation of affordances and on technological intersubjectivity. Socio-technical affordances are conceptualized as action-taking possibilities and meaning-making opportunities in a socio-technical system relative to an actor. Technological intersubjectivity (TI) is a technology-mediated interactional social relationship between two or more participants. The basic premise of this research is that social affordances of technologies vary along cultural dimensions. To empirically evaluate this premise, an experimental study was conducted. The experimental study design consisted of three independent groups of dyads from similar or different cultures (Anglo-American, Chinese) doing collaborative problem-solving in a knowledge-mapping learning environment. Participants interacted through an asynchronous computer interface providing multiple tools for interaction (diagrammatic workspace, embedded notes, threaded discussion) as they worked on an intellectually challenging problem of identifying the cause of a disease outbreak. The analytical focus of the experimental study was to determine the influence of culture on the appropriation of affordances by individual participants in an online learning environment. The theoretical objective of the study was to inform the notion of technological intersubjectivity. Based on theories of culture and empirical findings in cultural psychology documenting cross-cultural variations in behavior, communication and cognition, several research hypotheses were advanced. Empirical data were collected using demographic, culture and usability instruments; participants' self-perception and collaborative peer-perception instruments; screen recordings and software logs of experimental sessions. Statistical results showed that members of different cultures appropriated the resources of the interface differently in their interaction, and formed differential impressions of each other. For example, on average, Anglo-American participants of the experimental study created more evidential relation links, made more individual contributions and were more likely to explicitly discuss information sharing and knowledge organization strategies than their Chinese counterparts. The primary contributions of this dissertation is a preliminary empirical demonstration of a systemic cultural variation in the phenomena of technological intersubjectivity and appropriation of affordances in socio-technical environments, an empirically informed notion of technological intersubjectivity, and a methodological approach for the systematic study of appropriation of affordances.
Combining Data Integration and IE Techniques to Support Partially Structured Data
Authors: Dean Williams, Alexandra Poulovassilis
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

A class of applications exists where the information to be stored is partially structured: that is, it consists partly of some structured data sources each conforming to a schema and partly of information left as free text. While investigating the requirements for querying partially structured data, we have encountered several limitations in the currently available approaches and we describe here three new techniques which combine aspects of Information Extraction with data integration in order to better exploit the data in these applications.
Computational Efficiency of Intermolecular Gene Assembly
Authors: Tseren-Onolt Ishdorj, Remco Loos, Ion Petre
Venue: Fundamenta Informaticae (2008)

We investigate here the computational efficiency of gene rearrangement found in ciliates (unicellular organisms). We show how the so-called guided recombination systems, which model this gene rearrangement, can be used as problem solvers. Specifically, these systems can uniformly solve SAT with time complexity O(n &middot; m) for a Boolean formula of m clauses over n variables.
Petri net plans: a formal model for representation and execution of multi-robot plans
Authors: V. A. Ziparo, L. Iocchi, D. Nardi, P. F. Palamara, H. Costelha
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

The aim of this paper is to describe a novel representation framework for high level robot and multi-robot programming, called Petri Net Plans (PNP), that allows for representing all the action features that are needed for describing complex plans in dynamic environments. We provide a sound and complete execution algorithm for PNPs based on the semantics of Petri nets. Moreover, we show that multi-robot PNPs allow for a sound and complete distributed execution algorithm, given that a reliable communication channel is provided. PNPs have been used for describing effective plans for actual robotic agents which inhabit dynamic, partially observable and unpredictable environments, and experimented in different application scenarios.
A Comparison of Different Rating Based Collaborative Filtering Algorithms
Authors: Fabián P. Lousame, Eduardo Sánchez
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In this paper we present a preliminary work in which different rating based collaborative filtering algorithms are compared in terms of scalability and recommendation quality. Algorithms are tested using a reference database and results show that the selection of one or other algorithm depends on two factors: the scalability of the algorithms and the recommendation quality.
FormatShield: A Binary Rewriting Defense against Format String Attacks
Authors: Pankaj Kohli, Bezawada Bruhadeshwar
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

Format string attacks allow an attacker to read or write anywhere in the memory of a process. Previous solutions designed to detect format string attacks either require source code and recompilation of the program, or aim to defend only against write attempts to security critical control information. They do not protect against arbitrary memory read attempts and non-control data attacks. This paper presents FormatShield, a comprehensive defense against format string attacks. FormatShield identifies potentially vulnerable call sites in a running process and dumps the corresponding context information in the program binary. Attacks are detected when malicious input is found at vulnerable call sites with an exploitable context. It does not require source code or recompilation of the program and can defend against arbitrary memory read and write attempts, including non-control data attacks. Also, our experiments show that FormatShield incurs minimal performance overheads and is better than existing solutions.
Improved Bacterial Foraging Algorithms and Their Applications to Job Shop Scheduling Problems
Authors: Chunguo Wu, Na Zhang, Jingqing Jiang, Jinhui Yang, Yanchun Liang
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Bacterial foraging algorithm is a novel evolutionary computation algorithm proposed four years ago, which is based on the foraging behavior ofE.coli bacteria living in human intestine. In this paper an improved operation, individual-based search, is presented with regard to the important component (Chemotaxi) of bacterial foraging algorithm. The improved algorithm is applied to job shop scheduling benchmark problems. Numerical experiments show the effectiveness of the improved algorithm.
MRI Reconstruction Using SVD in the Least Square Sense
Authors: Fadi Yaacoub, Antoine Abche, Elie Karam, Yskandar Hamam
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Magnetic Resonance Imaging is a very powerful tool for imaging structures or organs of the human body in a non-invasive manner. Having collected the raw data and discretized in the k-space, Fourier methods are the natural choice to reconstruct the MRI images. In this paper, a technique to reconstruct MRI images is presented. It does not perform the inverse Fourier transform directly on the k-space images. It is based on the SVD decomposition in the least square sense. This approach is compared with other existing approaches using different criteria such as the Root Mean Square and the performance test. The results show that the proposed approach is much better.
A Method of Counting Pedestrians in Crowded Scenes
Authors: Byeoung-Su Kim, Gwang-Gook Lee, Ja-Young Yoon, Jae-Jun Kim, Whoi-Yul Kim
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

This paper proposes a method to automatically count the number of pedestrians in a video input of a crowed scene. The method proposed in this paper improves on our previous pedestrian counting method which estimates the number of pedestrians by accumulating low-level features (foreground pixels and motion vectors) on a virtual gate. To handle crowded scenes, the pedestrian counting process in this paper is weighted by the ratio of foreground pixels in the scene. The relationship between crowdedness and weighting factor is learned from 10,000 simulation images. Tests on real video sequences show that this method can successfully estimate the number of pedestrians with an accuracy of about 95%. Also, when compared to the previous method, the accuracy was increased by about 5% for highly crowded scenes. Moreover, the proposed method runs at an average rate of around 60 fps on a standard PC, which makes the algorithm realistic for multi-camera systems.
Generic Multimedia Database Architecture Based upon Semantic Libraries
Authors: Omara Abdul Hamid, Muhammad Abdul Qadir, Nadeem Iftikhar, Mohib Ur Rehman, Mobin Uddin Ahmed, Imran Ihsan
Venue: Informatica (2007)

Semantic-based storage and retrieval of multimedia data requires accurate annotation of the data. Annotation can be done either manually or automatically. The retrieval performance of the manual annotation based approaches is quite good, as compared to approaches based on automatic annotation. However, manual annotation is time consuming and labor extensive. Therefore, it is quite difficult to apply this technique on huge volume of multimedia data. On the other hand, automatic annotation is commonly used to annotate the multimedia data based on low level features, which obviously lacks the semantic nature of the multimedia data. Yet, we have not come across with any such system which automatically annotate the multimedia data based on the extracted semantics accurately. In this paper, we have performed automatic annotation of the images by extracting their semantics (high level features) with the help of semantic libraries. Semantic libraries use semantic graphs. Each graph consists of related concepts along with their relationships. We have also demonstrated with the help of a case study that our proposed approach ensures an improvement in the semantic based retrieval of multimedia data.
Selection of Histograms of Oriented Gradients Features for Pedestrian Detection
Authors: Takuya Kobayashi, Akinori Hidaka, Takio Kurita
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

Histograms of Oriented Gradients (HOG) is one of the well-known features for object recognition. HOG features are calculated by taking orientation histograms of edge intensity in a local region. N.Dalal et al. proposed an object detection algorithm in which HOG features were extracted from all locations of a dense grid on a image region and the combined features are classified by using linear Support Vector Machine (SVM). In this paper, we employ HOG features extracted from all locations of a grid on the image as candidates of the feature vectors. Principal Component Analysis (PCA) is applied to these HOG feature vectors to obtain the score (PCA-HOG) vectors. Then a proper subset of PCA-HOG feature vectors is selected by using Stepwise Forward Selection (SFS) algorithm or Stepwise Backward Selection (SBS) algorithm to improve the generalization performance. The selected PCA-HOG feature vectors are used as an input of linear SVM to classify the given input into pedestrian/non-pedestrian. The improvement of the recognition rates are confirmed through experiments using MIT pedestrian dataset.
Weighted Distributed Systems and Their Logics
Authors: Benedikt Bollig, Ingmar Meinecke
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We provide a model of weighted distributed systems and give a logical characterization thereof. Distributed systems are represented as weighted asynchronous cellular automata. Running over directed acyclic graphs, Mazurkiewicz traces, or (lossy) message sequence charts, they allow for modeling several communication paradigms in a unifying framework, among them probabilistic shared-variable and probabilistic lossy-channel systems. We show that any such system can be described by a weighted existential MSO formula and, vice versa, any formula gives rise to a weighted asynchronous cellular automaton.
From Microscopy Images to Models of Cellular Processes
Authors: Yoav Freund
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

The advance of fluorescent tagging and of confocal microscopy is allowing biologists to image biochemical processes at a level of detail that was unimaginable just a few years ago. However, as the analysis of these images is done mostly by hand, there is a severe bottleneck in transforming these images into useful quantitative data that can be used to evaluate mathematical models.One of the inherent challenges involved in automating this transformation is that image data is highly variable. This requires a recalibration of the image processing algorithms for each experiment. We use machine learning methods to enable the experimentalist to calibrate the image processing methods without having any knowledge of how these methods work. This, we believe, will allow the rapid integration of computer vision methods with confocal microscopy and open the way to the development of quantitative spatial models of cellular processes.For more information, see http://seed.ucsd.edu/ yfreund/NewHomePage/ Applications/Biomedical Imaging.html
A Neural Network Solution on Data Least Square Algorithm and Its Application for Channel Equalization
Authors: Jun-Seok Lim
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Using the neural network model for oriented principal component analysis (OPCA), we propose a solution to the data least squares (DLS) problem, in which the error is assumed to lie in the data matrix only. In this paper, We applied this neural network model to channel equalization. Simulations show that DLS outperforms ordinary least square in channel equalization problems.