ppxscal/embedding_network huggingface dataset:
Research on the Preventive Strategy of Credit Risk in On-Line Auction Market
Authors: Qinghua Zhang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Along with the swift development of on-line auction, credit problem has become a focus attracting increasing attention of people. Information flow, capital flow and logistics exist in both traditional business transaction and on-line auction. Only when all of the above three factors finish backflow, could it be regarded as the completion of transaction. Therefore, carrying out strict supervision on the three factors could thoroughly solve the credit problems in on-line auction. Therefore, the following will analyze the credit mechanism in on-line auction from three aspects of transaction rule, credit index and payment tool. It's believed that, if only such three sections are perfected, could we realize the objective of establishing perfect credit mechanism very soon. Surely, the on-line auction will develop in a healthy, orderly and rapid way under perfect mechanism. Finally, the thesis put forward the relevant Preventive Strategy of Credit Risk.
An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms
Authors: Leo Liberti, Constantinos C. Pantelides
Venue: Journal of Global Optimization (2006)

Many nonconvex nonlinear programming (NLP) problems of practical interest involve bilinear terms and linear constraints, as well as, potentially, other convex and nonconvex terms and constraints. In such cases, it may be possible to augment the formulation with additional linear constraints (a subset of Reformulation-Linearization Technique constraints) which do not affect the feasible region of the original NLP but tighten that of its convex relaxation to the extent that some bilinear terms may be dropped from the problem formulation. We present an efficient graph-theoretical algorithm for effecting such exact reformulations of large, sparse NLPs. The global solution of the reformulated problem using spatial Branch-and Bound algorithms is usually significantly faster than that of the original NLP. We illustrate this point by applying our algorithm to a set of pooling and blending global optimization problems.
Modelling Mobility with UML2.0 and PEPA Nets
Authors: Leila Kloul, Juliana Kuster-Filipe
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

We show how UML2.0 together with PEPA nets can be used to model dynamic aspects of mobile applications. UML2.0 provides a new form of high-level description of interactions called interaction overview diagram. The combination of interaction overview diagrams and sequence diagrams is naturally translated into PEPA nets, a performance modelling language. In this way, the designers using UML can analyse their models formally using available tools for PEPA nets.
A Chaotic UWB System for Home networks
Authors: Kwonhyung Lee, Soocheol Kyeong, Jaehyon Kim, Younghwan Kim, Hyuncheol Park
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Emerging wireless technologies will play an important role in home network applications. Chaotic UWB technology has several inherent properties that are suited to home networks. In particular, applications have been focused such as low power consumption, low complexity, and low cost. In this paper, we describe the chaotic signal based UWB systems and the optimum sample number to minimize the bit error rate of the chaotic on-off keying. Moreover, we propose new scheme using the optical orthogonal code based chaotic on-off keying in an asynchronous channel for simultaneously operating piconets environment: all users are allowed to transmit their signal at any time, and moreover there is usually no network synchronization or coordinator among users.
Data storage and delivery protocols to support interactive high-resolution image browsing on a PC-cluster based image-wall
Authors: J. C. Beyer, D. H. C. Du
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We present a data storage, retrieval, and communications system capable of supporting high-resolution image browsing on an inexpensive PC cluster based image-wall system. The data is first partitioned and then strategically written both onto a single hard disk and then across multiple hard disks. After presenting the data allocation scheme, we present schemes for retrieving the data from the hard disks and neighboring renderers. The optimality of the storage and retrieval mechanisms is proved and analytical results are presented for an initial implementation.
An adaptive plan-based dialogue agent: integrating learning into a BDI architecture
Authors: Anh Nguyen, Wayne Wobcke
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We consider the problem of dialogue adaptation in our Smart Personal Assistant (SPA), which uses a plan-based dialogue model. We present a novel way of integrating learning into a BDI architecture so the agent can learn to select the most suitable plan amongst those applicable, enabling the SPA to tailor its responses according to the conversational context and the user's physical context, device and preferences.
Generating semantic annotations for frequent patterns with context analysis
Authors: Qiaozhu Mei, Dong Xin, Hong Cheng, Jiawei Han, ChengXiang Zhai
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on developing efficient algorithms to discover various kinds of frequent patterns, but little attention has been paid to the important nextstep - interpreting the discovered frequent patterns. Although some recent work has studied the compression and summarization of frequent patterns, the proposed techniques can only annotate a frequent pattern with non-semantical information (e.g. support), which provides only limited help for a user to understand the patterns.In this paper, we propose the novel problem of generating semantic annotations for frequent patterns. The goal is to annotate a frequent pattern with in-depth, concise, and structured information that can better indicate the hidden meanings of the pattern. We propose a general approach to generate such anannotation for a frequent pattern by constructing its context model, selecting informative context indicators, and extracting representative transactions and semantically similar patterns. This general approach has potentially many applications such as generating a dictionary-like description for a pattern, finding synonym patterns, discovering semantic relations, and summarizing semantic classes of a set of frequent patterns. Experiments on different datasets show that our approach is effective in generating semantic pattern annotations.
Development of measures of online privacy concern and protection for use on the Internet
Authors: Tom Buchanan, Carina Paine, Adam N. Joinson, Ulf-Dietrich Reips
Venue: Journal of the American Society for Information Science and Technology (2007)

As the Internet grows in importance, concerns about online privacy have arisen. The authors describe the development and validation of three short Internet-administered scales measuring privacy-related attitudes (Privacy Concern) and behaviors (General Caution and Technical Protection). In Study 1, 515 people completed an 82-item questionnaire from which the three scales were derived. In Study 2, scale validity was examined by comparing scores of individuals drawn from groups considered likely to differ in privacy-protective behaviors. In Study 3, correlations between the scores on the current scales and two established measures of privacy concern were examined. The authors conclude that these scales are reliable and valid instruments suitable for administration via the Internet, and present them for use in online privacy research. &copy; 2007 Wiley Periodicals, Inc.
A Functional Neuroimaging Description of Two Deep Dyslexic Patients
Authors: C. J. Price, D. Howard, K. Patterson, E. A. Warburton, K. J. Friston, R. S. J. Frackowiak
Venue: Journal of Cognitive Neuroscience (1998)

Deep dyslexia is a striking reading disorder that results from left-hemisphere brain damage and is characterized by semantic errors in reading single words aloud (e.g., reading spirit as whisky ). Two types of explanation for this syndrome have been advanced. One is that deep dyslexia results from a residual left-hemisphere reading system that has lost the ability to pronounce a printed word without reference to meaning. The second is that deep dyslexia reflects right-hemisphere word processing. Although previous attempts to adjudicate between these hypotheses have been inconclusive, the controversy can now be addressed by mapping functional anatomy.In this study, we demonstrate that reading by two deep dyslexic patients (CJ and JG) involves normal or enhanced activity in spared lefthemisphere regions associated with naming (Broca's area and the left posterior inferior temporal cortex) and with the meanings of words (the left posterior temporo-parietal cortex and the left anterior temporal cortex). In the right-hemisphere homologues of these regions, there was inconsistent activation within the normal group and between the deep dyslexic patients. One (CJ) showed enhanced activity (relative to the normals) in the right anterior inferior temporal cortex, the other (JG) in the right Broca's area, and both in the right frontal operculum. Although these differential right-hemisphere activations may have influenced the reading behavior of the patients, their activation patterns primarily reflect semantic and phonological systems in spared regions of the left hemisphere. These results preclude an explanation of deep dyslexia in terms of purely right-hemisphere word processing.
The Design and Implementation of the Transatlantic Mission-Oriented Production and Experimental Networks
Authors: Harvey Newman, Dimitri Bourilkov, Julian Bunn, Richard Cavanaugh, Iosif Legrand, Steven Low, Shawn McKee, Dan Nae, Sylvain Ravot, Conrad Steenberg, Xun Su, Michael Thomas, Frank van Lingen, Yang Xia
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In this paper we present the design and implementation of the mission-oriented USLHCNet for HEP research community and the UltraLight network testbed. The design philosophy for these networks is to help meet the data-intensive computing challenges of the next generation of particle physics experiments with a comprehensive, network-focused approach. Instead of treating the network as a static, unchanging and unmanaged set of intercomputer links, we are developing and using it as a dynamic, configurable, and closely monitored resource that is managed from end-to-end. In this paper we will present our work in the various areas of the project including infrastructure construction, protocol research and application development. Our goal is to construct a next-generation global system that is able to meet the data processing, distribution, access and analysis needs of the particle physics community.
Lee-Associator-a chaotic auto-associative network for progressive memory recalling
Authors: Raymond S. T. Lee
Venue: Neural Networks (2006)

In the past few decades, neural networks have been extensively adopted in various applications ranging from simple synaptic memory coding to sophisticated pattern recognition problems such as scene analysis and robot vision. Moreover, current studies on neuroscience and physiology have reported that in a typical scene segmentation problem our major senses of perception (e.g. vision, olfaction, etc.) are highly chaotic and involved non-linear neural dynamics and oscillations. In this paper, the author proposes an innovative chaotic neural oscillator-namely the Lee-oscillator (Lee's Chaotic Neural Oscillator) to provide a chaotic neural coding and information processing scheme. To illustrate the capability of Lee-oscillators upon pattern association, a chaotic auto-associative network, namely Lee-Associator (Lee's Chaotic Auto-associator) is constructed. Different from classical auto-associators such as the celebrated Hopfield network, which provides time-independent and static pattern association scheme, the Lee-Associator provides a remarkable progressive memory association scheme (what the author called 'Progressive Memory Recalling Scheme, PMRS') during the chaotic memory association. This is exactly consistent with the latest research in psychiatry and perception psychology on dynamic memory recalling schemes, as well as the implications and analogues to human perception as illustrated by the remarkable Rubin-vase experiment on visual psychology.
Matrix-valued subdivision schemes for generating surfaces with extraordinary vertices
Authors: Charles K. Chui, Qingtang Jiang
Venue: Computer Aided Geometric Design (2006)

Subdivision templates of numerical values are replaced by templates of matrices in this paper to allow the introduction of shape control parameters for the feasibility of achieving desirable geometric shapes at those points on the subdivision surfaces that correspond to extraordinary control vertices. Formulation of the matrix-valued subdivision surface is derived. Based on refinable bivariate spline function vectors for matrix-valued subdivisions, the notion of characteristic map introduced by Reif is extended from (scalar) surface subdivisions to matrix-valued subdivisions. The C1 - and Ck-continuity of Reif and Prautzsch for matrix-valued subdivisions are discussed. To illustrate the general theory, the smoothness of matrix-valued triangular subdivision schemes for extraordinary vertices with valences 3 and 4 is analyzed. The issue of effective choices of the shape control parameters will also be discussed in this paper.
A new simulation model for expressway weaving sections evaluation
Authors: Sun Jian, Yang Xiaoguang, Ma Yunlong
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simulation of traffic flow is an effective tool for traffic system management, control and optimization, particularly in congested urban areas. TESS is an object oriented traffic simulation model with detailed representation of vehicles and their interactions. This paper presents the TESS simulator including the car-following model and new lane-changing procedures. Four weaving sections are simulated in TESS platform using field data come from Traffic Information Collecting System in Shanghai China. Compared with the CORSIM model, good results are obtained after using the calibrated TESS model in simulating weaving sections.
A petri net system: an overview
Authors: Zbigniew Suraj, Barbara Fryc, Zofia Matusiewicz, Krzysztof Pancerz
Venue: Fundamenta Informaticae (2006)

Petri nets are one of well established tools in both theoretical analysis and practical modelling of concurrent systems as well as approximate reasoning. However, practical usage of Petri nets is limited by the lack of computer tools which would allow to handle large and complex nets in a comfortable way. Three things are essential for modelling and analyzing by means of Petri nets - a good editor, a simulator and a powerful analysis engine. Moreover, a program should have a graphical user interface providing an opportunity to work directly with the graphical representations of Petri nets and should be able to read and write data in formats of other popular simulators of Petri Nets.This paper presents a set of integrated graphical Petri net tools called Petri Net system (PN-system, in short).PN-system is a follow - up on PN-tools. This system can be used for constructing, editing and analyzing of different classes of Petri nets. PN-system is enhanced with fuzzy and adaptive fuzzy Petri nets' modules which allow to perform fuzzy reasoning automatically. It has got a graphical user interface. Moreover, PN-system can cooperate with the ROSECON system which is an original software tool for discovering concurrent models from data tables.PN-system runs on IBM PC platform under MS Windows operating system.
A Framework for Web-Based Interactive Applications of High-Resolution 3D Medical Image Data
Authors: Danzhou Liu, Kien A. Hua, Kiminobu Sugaya
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

With the advances in medical imaging devices, large volumes of high-resolution 3D medical image data have been produced. These high-resolution 3D data are very large in size, and severely stress storage systems and networks. Most existing Web-based 3D medical image interactive applications therefore deal with only low- or medium-resolution image data. While it is possible to download the whole 3D highresolution image data from the server and perform the image visualization and analysis at the client site, such an alternative is infeasible when the high-resolution data are very huge, and many users concurrently access the server. In this paper, we propose a novel framework for Web-based interactive applications of high-resolution 3D medical image data. Specifically, we first partition the whole 3D data into buckets, and then compress each bucket separately. We also propose an indexing structure for these buckets to efficiently support typical queries such as 3D slicer and region of interest (ROI), and only the relevant buckets are transmitted instead of the whole highresolution 3D medical image data. Furthermore, in order to better support concurrent accesses and to improve the average response time, we also propose some techniques for bucket group access on the server side and incremental transmission. Our experimental study based on a human brain MRI data set indicates that the proposed framework can significantly reduce storage and communication requirements, and can enable real-time interaction with remote highresolution 3D medical image data for many concurrent users.
FAME: Adding Multi-Level Authentication to Shibboleth
Authors: Aleksandra Nenadic, Ning Zhang, Jay Chin, Carole Goble
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The paper describes the design of FAME (Flexible Access Middleware Extension) architecture aimed at providing multi-level user authentication service for Shibboleth, which is endorsed by the Joint Information Systems Committee (JISC) as the next generation authentication and authorisation infrastructure for the UK Higher Education community. FAME derives authentication assurance level based upon the strength of the authentication token and protocol used by the user when authenticating and feeds it to the PERMIS authorisation decision engine via Shibboleth to enable more fine-grained access control. In this way, access to resources is controlled according to the strength of the authentication method so that more sensitive resources may require users to identify themselves using a higher level of authentication.
Template Matching Based on the L_p Norm Using Sufficient Conditions with Incremental Approximations
Authors: Federico Tombari, Stefano Mattoccia, Luigi Di Stefano
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper proposes a novel algorithm aimed at speeding-up template matching based on the L_p norm. The algorithm is exhaustive, i.e. it yields the same results as a Full Search (FS) template matching process, and is based on the deployment of tight lower bounds that can be derived by using together the triangular inequality and partial evaluations of the L_p norm. In order to deploy this, template and image subwindows are properly partitioned. The experimental results prove that the proposed algorithm allows speeding-up the FS process and also (when applied to the L_2 norm) the exhaustive approach based on the Fast Fourier Transform.
ESL and Learning Technologies in Fast Developing China: Creativity and Innovation toward Beijing Olympics 2008
Authors: Rody R. Klein, P. Clint Rogers, Zhang Yong
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

Metis Global Network is involved in ESL Education, toward Humanistic Beijing Olympics 2008. East meets West with ESL in China. It is an important experimental context for intercultural relations. In this paper we use the context of a private Chinese experimental school attached to Beijing University as an interesting setting to capture the complex nature of educational technologies in China, both the positive and the negative. This case study will describe some of the dynamics the relationships between the students, teachers, administrators, and emerging technologies.
Geometrically Invariant Watermark Using Fast Correlation Attacks
Authors: Dan Wang, Peizhong Lu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper proposes a novel geometrical invariant watermark scheme based on fast correlation attacks of stream ciphers. The binary bit sequences of watermark as the initial state are fed into the LSFR, and the output m-sequence is embedded into the triangles that are obtained according to the scale-space Harris feature points and Delaunay tessellations. During the detection, the embedded watermark will be extracted based on the fast correlation attacks technique. Owing to its powerful error-correcting capability, the robustness against both geometrical distortion and common signal processing can be readily obtained. Simulation results show that the proposed scheme is highly robust against all kinds of geometrical attacks even including RBA in the StirMark.
Collaboration between MAC Policies and IDS based on a Meta-Policy approach
Authors: M. Blanc, J. Briffaut, C. Toinard
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

This paper1 presents a new infrastructure based on a novel meta-policy approach. This solution allows to deploy a MAC kernel within a distributed system. It is a completely decentralized solution that has strong fault tolerance properties. Despite a local control of the updates, each local policy satisfies global security properties. Our IDS approach add new security properties. It prevents any accidental or malicious update of the local policies. Moreover, the collaboration between the meta-policy and our IDS system enables to detect illegal sequences of legal operations.
Future of simulation in biotechnology industry
Authors: Prasad V. Saraph
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In the 21st century, the Biotechnology industry has the potential to inspire a number of management tools and theories, just as the Automobile industry did in the 20th century. This paper explores the opportunities for simulation in Biotechnology over the next few years and provides structure for the panel discussion in Biotechnology and HealthCare track. We detail the structure for Biotechnology industry, review status and opportunities for simulation and present gap analysis of opportunities and tools available. The purpose of the panel discussion is to discuss the role for simulation community in Biotechnology industry over the next few years and identify key areas where simulation can add value.