ppxscal/embedding_network huggingface dataset:
Proceedings of the 6th international conference on Electronic commerce
Authors: Marijn Janssen, Henk G. Sol, René W. Wagenaar
Venue: ACM International Conference Proceeding Series; Vol. 60 (2004)

It is our pleasure to welcome you to the Sixth International Conference on Electronic Commerce (ICEC04). The program of ICEC04 is made up of a wide spectrum of high-quality, research papers. We have had more than 140 submissions coming from all continents of our world. This gives the conference a real international context. All papers have been thoroughly reviewed by at least two qualified expert reviewers; most of the papers have been reviewed by three reviewers. ICEC04 features 78 papers of consistently high quality and originality divided over the five tracks. We wish to thank all authors for their dedications, for dealing with the reviewers comments and for their prompt reactions to the conference office.The Internet provides tremendous opportunities for innovation and improvement of businesses. Over the past years developments have led to a shift of more compelling service and customer orientation. The new challenge is to create customer value in service processes and to take the complete architecture from service design to deployment into consideration. The Internet offers unique opportunities for individuals, businesses and government to seek new ways of achieving higher levels of services both qualitatively and quantitatively at substantially lower costs. Many hurdles still need to be taken, and much can be learned from past experience. However, the amount of research in services is still limited. This conference provides a forum to share invaluable experience of good practices and pitfalls in strategy planning, design, development, engineering and implementation of e-services.ICEC'2004 is sponsored by the International Center for Electronic Commerce (ICEC), which has been established in 1996 as a non-profit research organization to become a leading international center for research in technologies, their commercial applications and management, standardization and other basic frameworks related to electronic commerce.
Analysis and improvement of HITS algorithm for detecting Web communities
Authors: Saeko Nomura, Satoshi Oyama, Tetsuo Hayamizu, Toru Ishida
Venue: Systems and Computers in Japan (2004)

This paper discusses Kleinberg's HITS algorithm (hyperlink-induced topic search) that extracts the Web community by Web inherent hyperlink analysis. The problems of the algorithm are analyzed and an improvement is proposed. For this purpose, a tool (Link Viewer) that visualizes the operation process of HITS algorithm was developed. The analysis revealed the following problem of the HITS algorithm: when there exists a page in the base set which is not related to the original topic at all and has a dense link structure, it is impossible to extract the Web community (authority and hub) matched to the original topic (topic drift problem). The authors focused only on the link analysis, and proposed the following modifications: (1) a technique in the eigenvalue calculation to consider the projection on the root subspace; (2) a technique for iterative calculation by extracting only the page from the base set which has link relations to multiple pages in the root set. A technique combining (1) and (2) is also considered. As a result, the topic drift problem is avoided for any topic with a relatively small amount of computation, and the HITS algorithm is improved by using the link information. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(13): 32&ndash;42, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10425
Web Server Software Architectures
Authors: Daniel A. Menasce
Venue: IEEE Internet Computing (2003)

Web site scalability depends on several things, including workload characteristics, security mechanisms, and Web cluster architectures. Another important item that can affect a site's performance and scalability is the Web server software architecture. This column provides a classification of Web server architectures, offers a quantitative analysis of some possible software architectural options, and discusses the importance of software contention on overall response time.
Delay-insensitive computation in asynchronous cellular automata
Authors: Jia Lee, Susumu Adachi, Ferdinand Peper, Shinro Mashiko
Venue: Journal of Computer and System Sciences (2005)

Asynchronous cellular automata (ACA) are cellular automata that allow cells to update their states independently at random times. Because of the unpredictability of the order of update, computing on ACA is usually done by simulating a timing mechanism to force all cells into synchronicity after which well-established synchronous methods of computation can be used. In this paper, we present a more effective method of computation based upon a 4-state two-dimensional ACA with von Neumann neighborhood that is based on the construction in the cellular space of delay-insensitive circuits, a special type of asynchronous circuits, whose operations are robust to arbitrary delays in operators or interconnection lines. We show that this novel ACA model can be used to construct a universal Turing machine, which suffices to prove its computational universality.
Validation of a Perturbed-Continuum Model for Shear Localization
Authors: K. Iyer, S. Schoenfeld, D. Casem, T. Wright
Venue: Proceedings of the 2004 Users Group Conference (2004)

Material failure through microscale shear localization is a significant parameter in design of applications involving high deformation rates. Experiments and continuum analysis (Wright, 2002) have shown sudden stress collapse via shear localization may be related to velocity or strain rate perturbations in the vicinity of shear band initiation. This paper examines the validity of a recently developed perturbed-continuum model for predicting the timing of stress collapse. Perturbed-continuum models for rationalizing and predicting localization are highly desirable because they do not require direct modeling of microstructural defects or full numerical resolution of localized flow-for realistic problems, both would require computational resources that are well beyond current capabilities. The present work consists of split Hopkinson bar experiments and finite element analyses of stress collapse in a novel specimen geometry with controlled geometric perturbations, i.e., tilted cuboidal specimens. Experimental observationsof the onset of stress collapse are compared with predictions that rely on the local strain rate field obtained with a normal finite element mesh for quantifying the theoretical perturbation.
Real-Time Tracking with Multiple Cues by Set Theoretic Random Search
Authors: Cheng Chang, Rashid Ansari
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Conventional treatment of visual tracking has been to optimize an objective function in a probabilistic framework. In this formulation, efficient algorithms employing simple prior distributions are usually insufficient to handle clutters (e.g., Kalman filter). On the other hand, distributions that are complex enough to incorporate all a priori knowledge can make the problem computationally intractable (e.g., Particle filter (PF)). This paper proposes a new formulation of visual tracking where every piece of information, be it from a priori knowledge or observed data, is represented by a set in the solution space and the intersection of these sets, the feasibility set, represents all acceptable solutions. Based on this formulation, we propose an algorithm whose objective is to find a solution in the feasibility set. We show that this set theoretic tracking algorithm performs effective face tracking and is computationally more efficient than standard PF-based tracking.
Text Classification without Labeled Negative Documents
Authors: Gabriel Pui Cheong Fung, Jeffrey Xu Yu, Hongjun Lu, Philip S. Yu
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

This paper presents a new solution for the problem of building a text classifier with a small set of labeled positive documents (P) and a large set of unlabeled documents (U). Here, the unlabeled documents are mixed with both of the positive and negative documents. In other words, no document is labeled as negative. This makes the task of building a reliable text classifier challenging. In general, the existing approaches for solving this kind of problem use a two-step approach: i) extract the negative documents (N) from U; and ii) build a classifier based on P and N. However, none of the reported studies tries to further extract any positive documents (P¿) from U. Intuitively, extracting P¿ from U will increase the reliability of the classifier. However, extracting P¿ from U is difficult. A document in U that possesses some of the features exhibited in P does not necessarily mean that it is a positive document, and vice versa. It is very sensitive to extract positive documents, because those extracted positive samples may become noises. The very large size of U and the very high diversity exhibited there also contribute to the difficulty of extracting any positive documents. In this paper, we propose a partitionbased heuristic which aims at extracting both of the positive and negative documents in U. Extensive experiments based on three benchmarks are conducted. The favorable results indicated that our proposed heuristic outperforms all of the existing approaches significantly, especially in the case where the size of P is extremely small.
Assessing the Performance of an Automated Video Ground Truthing Application
Authors: Scott K. Ralph, John Irvine, Mark R. Stevens, Magnus Snorrason, David Gwilt
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Present methods of quantifying the performance of ATR algorithms involves the use of large video datasets that must be truthed by hand, frame-by-frame, requiring vast amounts of time. To reduce this cost, we have developed an application that significantly reduces the cost by only requiring the operator to grade a relatively sparse number of data "keyframes". A correlation-based template matching algorithm computes the best position, orientation and scale when interpolating between keyframes. We demonstrate the performance of the automated truthing application, and compare the results to those of a series of human operator test subjects. The START-generated truth is shown to be very close to the mean truth data given by the human operators. Additionally the savings in labor producing the results is also demonstrated.
Emphasizing symmetry issues in business interaction analysis and IOS
Authors: Ulf Melin, Karin Axelsson
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

This paper argues for the need to thoroughly understand the issue of symmetry and asymmetry, when analysing business interaction supported by inter-organisational information systems (IOS). Business interaction can be defined as consisting of business communication and exchange of value. Business action theory (BAT) divides business processes into six generic phases encompassing generic, interactive actions between a seller and a buyer. Different types of exchange occur in these phases. However, the BAT phases do not, in the present version, take the issue of symmetry and asymmetry (power between suppliers and customers) into enough account. In this paper, we elaborate the concepts of symmetry and asymmetry in business interaction in order to reach a better understanding of different types of relationships. We also highlight IOS as an important means that can both facilitate symmetry and cause asymmetry in a business interaction. The aim of the paper is to enhance the applicability of BAT for business interaction analysis by including and emphasising the notion of symmetry and asymmetry.
A Secure Modular Exponential Algorithm Resists to Power, Timing, C Safe Error and M Safe Error Attacks
Authors: Chih-Chung Lu, Shau-Yin Tseng, Szu-Kai Huang
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper proposes a method for protecting public key schemes from timing and fault attacks. In general, this is accomplished by implementing critical operations using "branch-less" path routiness. More particularly, the proposed method provides a modular exponentiation algorithm without any redundant computation does not have a store operation with non-certain destination so that it can protect the secret key from many known attacks.
Part-Based Statistical Models for Object Classification and Detection
Authors: Elliot Joel Bernstein, Yali Amit
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose using simple mixture models to define a set of mid-level binary local features based on binary oriented edge input. The features capture natural local structures in the data and yield very high classification rates when used with a variety of classifiers trained on small training sets, exhibiting robustness to degradation with clutter. Of particular interest are the use of the features as variables in simple statistical models for the objects thus enabling likelihood based classification. Pre-training decision boundaries between classes, a necessary component of non-parametric techniques, is thus avoided. Class models are trained separately with no need to access data of other classes. Experimental results are presented for handwritten character recognition, classification of deformed LATEX symbols involving hundreds of classes, and side view car detection.
Design of a meta model for integrating enterprise systems
Authors: Chin-Bin Wang, Tsung-Yi Chen, Yuh-Min Chen, Hui-Chuan Chu
Venue: Computers in Industry (2005)

In the rapidly changing environment of the knowledge economy, an enterprise must respond to potential future changes when developing and implementing enterprise systems, which must be thus flexible and integrateable. The paper presents a method for integrating distributed Relational Database Management Systems (RDBMS) with the backend of enterprise systems developed by various software vendors. This method, with a Meta Model as the core integration technology, will enable enterprise systems to meet the demands of system integration, and to achieve, based on XML document standards, information integration. The method of integration is sufficiently flexible and expandable to integrate existing enterprises systems as well as systems that may be introduced into enterprises in the future. The study, which takes an on-line purchase system for electronic commerce as an example of the use of the proposed Meta Model, addresses the integration of enterprise resource planning (ERP) systems to achieve enterprise resources sharing, shorten purchase time and lower operation cost.
An A Posteriori Error Estimate for the Local Discontinuous Galerkin Method Applied to Linear and Nonlinear Diffusion Problems
Authors: Rommel Bustinza, Gabriel N. Gatica, Bernardo Cockburn
Venue: Journal of Scientific Computing (2005)

In this paper we present a new residual-based reliable a posteriori error estimator for the local discontinuous Galerkin approximations of linear and nonlinear diffusion problems in polygonal regions of R2. Our analysis, which applies to convex and nonconvex domains, is based on Helmholtz decompositions of the error and a suitable auxiliary polynomial function interpolating the Dirichlet datum. Several examples confirming the reliability of the estimator and providing numerical evidences for its efficiency are given. Furthermore, the associated adaptive method, which considers meshes with and without hanging nodes, is shown to be much more efficient than a uniform refinement to compute the discrete solutions. In particular, the experiments illustrate the ability of the adaptive algorithm to localize the singularities of each problem.
Towards the issues in architectural support for protection of software execution
Authors: Weidong Shi, Hsien-Hsin S. Lee, Chenghuai Lu, Mrinmoy Ghosh
Venue: ACM SIGARCH Computer Architecture News (2005)

Recently, there is a growing interest in the research community to employ tamper-resistant processors for software protection. Many of these proposed systems rely on a specially tailored secure processor to prevent 1) illegal software duplication, 2) unauthorized software modification, and 3) unauthorized software reverse engineering. Most of these works primarily focus on the feasibility demonstration and design details rather than trying to elucidate many fundamental issues that are either "elusive" or "confusing" to the architecture researchers. Furthermore, many proposed systems have been built on assumptions whose security implications have not been well studied or understood. Instead of proposing yet another new secure architecture model, in this paper, we will try to answer some of these fundamental questions with respect to using hardware-based cryptography for protecting software execution. Those issues include, 1) Is hardware cryptography necessary? 2) Is per-process single cryptography key enough to provide the flexibility, inter-operability, and compatibility required by today's complex software system? 3) Is OTP (one-time-pad) in combination with "lazy" authentication secure enough to protect software confidentiality? 4) Is there way to protect software integrity using less hardware resource? Finally, the paper defines the difference between off-line and on-line attacks and presents a very low overhead security enhancement technique that can improve protection on software integrity over on-line attacks by several magnitudes.
The amateur creator
Authors: Stephen Boyd Davis, Magnus Moar
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

Important design problems are raised in developing software for amateur users, a group distinguished here from novices. The authors argue that these design problems can be approached by understanding how systems for amateurs are derived from those for skilled users, through a combination of transformations we describe as foregrounding, backgrounding, automation, integration and constraining. Useful comparisons are offered with popular product designs. A broader, partly historical, context is then described in which media technologies propagate from use by specialists to use by these amateurs, and the latter change from consumers to creators. The discussion is focused by a description of difficulties with existing software encountered in the course of a creative schools-based project, intended to enable young users both to explore virtual worlds and to design and populate them with their own avatars. The authors argue that HCI design would benefit from a clearer grasp of the special characteristics of designing for amateur users and of transforming existing software for their use.
Values at play: design tradeoffs in socially-oriented game design
Authors: Mary Flanagan, Daniel C. Howe, Helen Nissenbaum
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Significant work in the CHI community has focused on designing systems that support human values. Designers and engineers have also become increasingly aware of ways in which the artifacts they create can embody political, social, and ethical values. Despite such an awareness, there has been little work towards producing practical methodologies that systematically incorporate values into the design process. Many designers struggle to find a balance between their own values, those of users and other stakeholders, and those of the surrounding culture. In this paper, we present the RAPUNSEL project as a case study of game design in a values-rich context and describe our efforts toward navigating the complexities this entails. Additionally, we present initial steps toward the development of a systematic methodology for discovery, analysis, and integration of values in technology design in the hope that others may both benefit from and build upon this work.
Evaluation of Effects of Pair Work on Quality of Designs
Authors: Hiyam Al-Kilidar, Peter Parkin, Aybuke Aurum, Ross Jeffery
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

Quality is a key issue in the development of software products. Although the literature acknowledges the importance of the design phase of software lifecycle and the effects of the design process and intermediate products on the final product, little progress has been achieved in addressing the quality of designs. This is partly due to difficulties associated in defining quality attributes with precision and measurement of the many different types and styles of design products, as well as problems with assessing the methodologies utilized in the design process. In this research we report on an empirical investigation that we conducted to examine and evaluate quality attributes of design products created through a process of pair-design and solo-design. The process of pair-design methodology involves pair programming principles where two people work together and periodically switch between the roles of driver and navigator. The evaluation of the quality of design products was based on ISO/IEC 9126 standards. Our results show some mixed findings about the effects of pair work on the quality of design products.
A probability estimate for not exceeding the unknown threshold by the Robbins-Monro algorithm
Authors: T. P. Krasulina, Yu. O. Yatel
Venue: Automation and Remote Control (2005)

The one-sided convergence of the modified Robbins-Monro process is studied [1]. A method for choosing the algorithm constants is designed such that the probability for not exceeding the unknown root of the regression equation is arbitrarily close to 1.
Automatic Test Case Optimization: A Bacteriologic Algorithm
Authors: Benoit Baudry, Franck Fleurey, Jean-Marc Jezequel, Yves Le Traon
Venue: IEEE Software (2005)

Finding the best test cases for software component testing can be expensive and labor intensive.A bacteriological algorithm can automatically generate and optimize test cases.
NTUplace: a ratio partitioning based placement algorithm for large-scale mixed-size designs
Authors: Tung-Chieh Chen, Tien-Chang Hsu, Zhe-Wei Jiang, Yao-Wen Chang
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this paper, we present a hierarchical ratio partitioning based placement algorithm for large-scale mixed-size designs. The placement algorithm consists of three steps: global placement, legalization,and detailed placement; it works in a hierarchical manner and integrates net-weighting partitioning, whitespace management, look-ahead bipartitioning, and fast legalization to handle the large-scale mixed-size placement problems. Unlike the traditional partitioning-based technique that is based on balanced partitioning, we apply ratio partitioning in each level. Further, applying the look-ahead bipartitioning technique in each level, we can evaluate the feasibility of the placement for sub-partitions more accurately. Therefore, we can find better ratios for the partitions, leading to easier legalization for the global placement result and finally a better detailed placement solution. Experimental results show the efficiency and effectiveness of our algorithm.