ppxscal/embedding_network huggingface dataset:
Knowing a tree from the forest: art image retrieval using a society of profiles
Authors: Kai Yu, Wei-Ying Ma, Volker Tresp, Zhao Xu, Xiaofei He, HongJiang Zhang, Hans-Peter Kriegel
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper aims to address the problem of art image retrieval (AIR), which aims to help users find their favorite painting images. AIR is of great interests to us because of its application potentials and interesting research challenges---the retrieval is not only based on painting contents or styles, but also heavily based on user preference profiles. This paper describes the collaborative ensemble learning, a novel statistical learning approach to this task. It at first applies probabilistic support vector machines (SVMs) to model each individual user's profile based on given examples, i.e. liked or disliked paintings. Due to the high complexity of profile modelling, the SVMs can be rather weak in predicting preferences for new paintings. To overcome this problem, we combine a society of users' profiles, represented by their respective SVM models, to predict a given user's preferences for painting images. We demonstrate that the combination scheme is embedded in a Bayesian framework and retains intuitive interpretations---like-minded users are likely to share similar preferences. We report extensive empirical studies based on two experimental settings. The first one includes some controlled simulations performed on 4533 painting images. In the second setting, we report evaluations based on user preferences collected through an online web-based survey. Both experiments demonstrate that the proposed approach achieves excellent performance in terms of capturing a user's diverse preferences.
Towards Knowledge Discovery through Context Explication
Authors: Stefan Kremer, Stefan Smolnik, Lutz Kolbe
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

More and more knowledge does play a decisive role as a factor of production besides the classic factors work, raw materials, and capital. Companies get a competitive advantage from a lead of knowledge and the capability to transform superior knowledge into market-drivenbusiness processes. The consistent orientation towards customers and their processes requires the customization of intra-corporate processes and systems. Customer process oriented portals support the collaboration of customers, employees, and suppliers. They integrate companies' systems and provide transparent access to information objects stored in these systems. One key problem is to find relevant information objects in continuously growing and distributed systems. Necessary conditions for the core processes of knowledge identification and knowledge use are mechanisms of navigation and linking as well as functionalities for extensive searches and investigations. A decisive challenge is to make knowledge available at the right time and the right place. Therefore, the implicit context ofinformation has to be explicated to fill knowledge gaps'. In this paper, we will introduce a continuum of context explication, which comprises different relations between information objects and its contexts by means of their degree and ease of context explication. Furthermore, we will evaluate different approaches for knowledge discovery in customer process oriented portals, provide patterns when to apply which approach, and present twosmall cases for knowledge discovery in such portals.
Multi-Enterprise Collaborative Enterprise Resource Planning and Decision Support Systems
Authors: Farzad Shafiei, David Sundaram
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Enterprise Resource Planning (ERP) and Decision Support Systems (DSS) have independently evolved and prospered in the marketplace as well as in academia. More recently, ERP and related systems such as Customer Relationship Management (CRM) and Supply Chain Management (SCM) are incorporating decision support tools and technologies.These include Business Intelligence, Customer Intelligence, Supply Chain Intelligence, and Business Analytics. At the same time, DSS are taking advantage of the data resident in ERP systems.This emerging convergence has motivated us to look at the integration of ERP and DSS. The integration of ERP and DSS provides firms with a number of advantages. First, they are able to maximise their Intelligence Density. Second, they are able to improve the quality and visibility of their information. Finally, they can form a solid foundation from which they can achieve multi-enterprise collaboration. Over the years, researchers and practitioners have proposed frameworks and architectures for ERP and DSS exclusively. However, there is little in the way of academic literature, frameworks, architectures, and implementations that integrate ERP and DSS in a coherent fashion.We address this area of research by first conducting a review of the independent and combined literature in the fields of ERP and DSS. This literature review paves the way for the proposal of a Multi-Enterprise Collaborative conceptual ERP-DSS framework that considers SCM, Enterprise Management, and CRM as components. This framework brings together the ERP and DSS integrated solutions offered by a host of well-known vendors in the marketplace. We then combine our own insight with respect to multiple-enterprise collaboration via the integration of ERP and DSS to propose a set of high-level and medium-level system frameworks. These system frameworks depict the mechanisms behind the integration of ERP and DSS both within the firm, and in a Multi-Enterprise Collaborative context.
The SACSO methodology for troubleshooting complex systems
Authors: Finn V. Jensen, Uffe Kjærulff, Brian Kristiansen, Helge Langseth, Claus Skaanning, Jiří Vomlel, Marta Vomlelová
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

The paper describes the task of performing efficient decision-theoretic troubleshooting of electromechanical devices. In general, this task is NP-complete, but under fairly strict assumptions, a greedy approach will yield an optimal sequence of actions, as discussed in the paper. This set of assumptions is weaker than the set proposed by Heckerman et al. (1995). However, the printing system domain, which motivated the research and which is described in detail in the paper, does not meet the requirements for the greedy approach, and a heuristic method is used. The method takes value of identification of the fault into account and it also performs a partial two-step look-ahead analysis. We compare the results of the heuristic method with optimal sequences of actions, and find only minor differences between the two.
Social support and leaving intention among computer professionals
Authors: Patrick Chang Boon Lee
Venue: Information and Management (2004)

Although prior studies have established a number of reasons why computer professionals leave their organizations, they have rarely suggested that lack of social support may be one reason. This study attempted to explain why social support is salient to computer professionals' leaving intention. It developed a model that posits that (i) social support is positivey related to job satisfaction, (ii) social support is negatively related to leaving intention, and (iii) social affiliation needs moderate the relationship between social support and leaving intention. The model was tested using data from a questionnaire. The restults indicated that social support from supervisor and colleagues were negatively related to leaving intention for computer professionals with high social affiliation needs, and that job satisfaction mediated the relationship between social support and leaving intention. Social support from family and friends was not related to leaving intention, but it was positively related to job satisfaction.
Transport properties of TaS3 and NbSe3 crystals of nanometer-scale transverse dimensions
Authors: S. V. Zaitsev-Zotov
Venue: Microelectronic Engineering (2003)

The finite-size effect in transport properties of quasi-one-dimensional conductors TaS3 and NbSe3 with the charge-density wave (CDW) has been studied in crystals having the room-temperature unit length resistance R(300 K)/L up to 105 Ω/µm, which corresponds to the transverse sizes of the crystals around 10 nm. The transition from room-temperature metallic behavior (dR/dT>0) to nonmetallic one (dR/dT<0) accompanied by disappearance of the Peierls transition is observed in crystals having R/L∼10 kΩ/µm, in agreement with the earlier observations. Further, sample size reduction leads to substantial modification of the shape of R(T) curves. Possible physical mechanisms of the phenomena, including growth of CDW fluctuations, transition to the commensurable CDW, development of the Luttinger-liquid-like behavior, surface effects, impurity effects, 1D Friedel oscillations, etc. are analyzed.
Automating XML document structure transformations
Authors: Paula Leinonen
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

This paper describes an implementation for syntax-directed transformation of XML documents from one structure to another. The system is based on the method which we have introduced in our earlier work. That work characterized certain general conditions under which a semi-automatic transformation is possible.The system generates semi-automatically a transformation between two structures of the same document class. The system gets source and target DTDs as an input. There is a tool for a user to define a label association between the elements of the DTDs. From the two DTDs and from the label association, the system generates the transformation specification semi-automatically. The system has a tool to help the user to select a correct translation if the target DTD produces several possible structures.Implementation of the transformation is based on the top-down tree transducer. From the transformation specification the system produces an XSLT script automatically.
A judgmental reconstruction of modal logic
Authors: Frank Pfenning, Rowan Davies
Venue: Mathematical Structures in Computer Science (2001)

We reconsider the foundations of modal logic, following Martin-L&ouml;f's methodology of distinguishing judgments from propositions. We give constructive meaning explanations for necessity and possibility, which yields a simple and uniform system of natural deduction for intuitionistic modal logic that does not exhibit anomalies found in other proposals. We also give a new presentation of lax logic and find that the lax modality is already expressible using possibility and necessity. Through a computational interpretation of proofs in modal logic we further obtain a new formulation of Moggi's monadic metalanguage.
A note on heat kernel and approximation
Authors: Alexandre Trovon, Yanlin Yu
Venue: Applied Numerical Mathematics (2003)

We consider the local behavior of the heat kernel on a closed Riemannian manifold and give an estimate of the residual.
Simulation of local mechanical stresses in lines on substrate
Authors: Audrey Loubens, Roland Fortunier, René Fillit, Olivier Thomas
Venue: Microelectronic Engineering (2003)

Stress in line-substrate systems can be simulated with two different approaches: Hu's model, which is analytical, and finite element simulation, which is numerical. The two approaches are compared. A universal curve of the average stress as a function of KL/h is given, K being a function of the elastic constants of materials, L the line width and h the thickness. The finite element simulation shows that stress varies along the thickness of the line, contrary to Hu's hypothesis. In order to validate the models, average stresses from literature measured by X-ray diffraction or bending measurement are presented.
Understanding How the Requirements Are Implemented in Source Code
Authors: Wei Zhao, Lu Zhang, Yin Liu, Jing Luo, Jiasu Sun
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

For software maintenance and evolution, a commonproblem is to understand how each requirement isimplemented in the source code. The basic solution of thisproblem is to find the fragment of source code that iscorresponding to the implementation of each requirement.This can be viewed as a requirement-slicing problem --slicing the source code according to each individualrequirement. In this paper, we present an approach tofind the set of functions that is corresponding to eachrequirement. The main idea of our method is to combinethe information retrieval technology with the staticanalysis of source code structures. First, we retrieve theinitial function sets through some information retrievalmodel using functional requirements as the queries andidentifier information (such as function names, parameternames, variable names etc.) of functions in the sourcecode as target documents. Then we complement eachretrieved initial function set by analyzing the call graphextracted from the source code. A premise of ourapproach is that programmers should use meaningfulnames as identifiers. Furthermore, we perform anexperimental study based on a GNU system. We use twobasic metrics: precision and recall (which are thecommon practice in the information retrieval field), toevaluate our approach. We also compare the resultsdirectly acquired from information retrieval with thosethat are complemented through static source codestructure analysis.
Competitive Bidding Behavior in Uniform-Price Auction Markets
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Profit-maximizing bidding in uniform price auction markets involves bidding above marginal cost. It therefore is not surprising that such behavior is observed in electricity markets. This incentive to bid above marginal cost is not the result of coordinated action among the bidders. Rather, each bidder is independently selecting its bid to maximize profits based on its estimate of the residual demand curve it faces. The supplier bids a price for its energy capacity to optimize its marginal tradeoff between higher prices and lower quantities. Price response from either demand or other suppliers prevents the supplier from raising its bid too much. Profitmaximizing bidding should be expected and encouraged by regulators. It is precisely this profit maximizing behavior that guides the market toward long-run efficient outcomes.
Combining Multiple Strategies for Effective Monolingual and Cross-Language Retrieval
Authors: Jacques Savoy
Venue: Information Retrieval (2004)

This paper describes and evaluates different retrieval strategies that are useful for search operations on document collections written in various European languages, namely French, Italian, Spanish and German. We also suggest and evaluate different query translation schemes based on freely available translation resources. In order to cross language barriers, we propose a combined query translation approach that has resulted in interesting retrieval effectiveness. Finally, we suggest a collection merging strategy based on logistic regression that tends to perform better than other merging approaches.
Malware month
Authors: Hal Berghel
Venue: Communications of the ACM (2003)

August 2003: SoBig, W32/Blaster, and the malware month of the millennium.
Artificial opal structures for 3D-optoelectronics
Authors: Michail I. Samoilovich, Svetlana M. Samoilovich, Andrey V. Guryanov, Michail Yu. Tsvetkov
Venue: Microelectronic Engineering (2003)

A production technology for ordered packings from monodisperse silica particles is developed thereby enabling the production of new material types--three-dimensional superlattices, including the so-called 'photonic crystals' or photonic band gap materials. Experiments to fill an interglobular space with semiconductors, superconductors, ferromagnetic substances and other materials have been carried out using specially developed strategies. We report here on unique three-dimensional nanosystems, which exhibit quantum-dimensional and other nanoscale effects such as, for example, non-linear interaction between individual electron-photon nanocluster subsystems.
Generation of interactive multi-level video summaries
Authors: Frank Shipman, Andreas Girgensohn, Lynn Wilcox
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we describe how a detail-on-demand representation for interactive video is used in video summarization. Our approach automatically generates a hypervideo composed of multiple video summary levels and navigational links between these summaries and the original video. Viewers may interactively select the amount of detail they see, access more detailed summaries, and navigate to the source video through the summary. We created a representation for interactive video that supports a wide range of interactive video applications and Hyper-Hitchcock, an editor and player for this type of interactive video. Hyper-Hitchcock employs methods to determine (1) the number and length of levels in the hypervideo summary, (2) the video clips for each level in the hypervideo, (3) the grouping of clips into composites, and (4) the links between elements in the summary. These decisions are based on an inferred quality of video segments and temporal relations those segments.
Stereo Reconstruction from Multiperspective Panoramas
Authors: Yin Li, Heung-Yeung Shum, Chi-Keung Tang, Richard Szeliski
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been constrained to planar concentric circles. We resample regular perspective images to produce a set of multiperspective panoramas and then compute depth maps directly from these resampled panoramas. Our panoramas sample uniformly in three dimensions: rotation angle, inverse radial distance, and vertical elevation. The use of multiperspective panoramas eliminates the limited overlap present in the original input images and, thus, problems as in conventional multibaseline stereo can be avoided. Our approach differs from stereo matching of single-perspective panoramic images taken from different locations, where the epipolar constraints are sine curves. For our multiperspective panoramas, the epipolar geometry, to the first order approximation, consists of horizontal lines. Therefore, any traditional stereo algorithm can be applied to multiperspective panoramas with little modification. In this paper, we describe two reconstruction algorithms. The first is a cylinder sweep algorithm that uses a small number of resampled multiperspective panoramas to obtain dense 3D reconstruction. The second algorithm, in contrast, uses a large number of multiperspective panoramas and takes advantage of the approximate horizontal epipolar geometry inherent in multiperspective panoramas. It comprises a novel and efficient 1D multibaseline matching technique, followed by tensor voting to extract the depth surface. Experiments show that our algorithms are capable of producing comparable high quality depth maps which can be used for applications such as view interpolation.
Finite element level set formulations for modelling multiphase flows
Authors: S. V. Shepel, S. Paolucci
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this work, we present two Finite Element formulations of the Level Set method: the Streamline-Upwind/Petrov-Galerkin (SUPC) and the Runge-Kutta Discontinuous Galerkin (RKDC) schemes. Both schemes are constructed in such a way as to minimize the numerical diffusion inherently present in the discretized Level Set equations. In developing the schemes, special attention is given to the issues of mass-conservation and robustness. The RKDG Level Set formulation is original and represents the first attempt to apply the discontinuous Galerkin FE method to interface tracking. The performances of the two formulations are demonstrated on selected two-dimensional problems: the broken-dam benchmark problem and a mold-filling simulation. The problems are solved using unstructured triangulated meshes. We also provide comparison of our results with those obtained using the Volume-of-Fluid (VOF) method.
The co-adaptive neural network approach to the Euclidean travelling salesman problem
Authors: E. M. Cochrane, J. E. Beasley
Venue: Neural Networks (2003)

In this paper we consider the Euclidean Travelling Salesman Problem (ETSP). This is the problem of finding the shortest tour around a number of cities where the cities correspond to points in the Euclidean plane and the distances between cities are given by the usual Euclidean distance metric.We present a review of the literature with respect to neural network (NN) approaches for the ETSP, and the computational results that have been reported. Based upon this review we highlight two areas that are, in our judgement, currently neglected/lacking in the literature. These are: • failure to make significant use of publicly available ETSP test problems in computational work • failure to address co-operation between neurons.Drawing upon our literature survey this paper presents a new Self-Organising NN approach, called the Co-Adaptive Net, which involves not just unsupervised learning to train neurons, but also allows neurons to co-operate and compete amongst themselves depending on their situation. Our Co-Adaptive Net algorithm also includes a number of algorithmic mechanisms that, based upon our literature review, we consider to have contributed to the computational success of previous algorithms.Results for 91 publicly available standard ETSP's are presented in this paper. The largest of these problems involves 85,900 cities. This paper presents: • the most extensive computational evaluation of any NN approach on publicly available ETSP test problems that has been made to date in the literature • a NN approach that performs better, with respect to solution quality and/or computation time, than other NN approaches given previously in the literature.Drawing upon computational results produced as a result of the DIMACS TSP Challenge, we highlight the fact that none of the current NN approaches for the ETSP can compete with state of the art Operations Research heuristics. We discuss why we consider continuing to study and develop NN approaches for the ETSP to be of value.
Axial representations of 3d shapes
Authors: David Mumford
Venue:  (2003)

Many shapes can be described very well in terms of an axis. Examples are the stick figure drawings of man and animals from ancient times. We would like to give a natural definition of axis for cylindrical shapes. For 2D shapes, the medial axis is a good candidate, though it is sensitive to perturbations. For 3D shapes, the medial scaffold is often complicated surfaces and does not match people's intuitions very well. In the first part of the thesis, we give a new definition of axis for generalized cylinders. This approach uses a regression point of view, defining the axis as a minimization point of a global energy function. We prove the existence of the minimization point and give the differential equations of it. We also apply the definition to some real and artificial examples. The second part of the thesis is about an application to potsherds, the symmetric axis and profile curve estimation of axially symmetric pots from small fragments. This problem is of great archaeological importance to the study of the hundreds and thousands of sherds found at excavation sites. The method is based on the special geometric properties of surfaces of revolution. We also use bootstrap method to find confidence bounds for the axis and the profile curve. These confidence bounds are essential if the estimations are used for the assembly of the full pot from multiple sherds.