ppxscal/embedding_network huggingface dataset:
Dematerialised data and human desire: the Internet and copy culture
Authors: Matthew Allen
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Since Licklider in the 1960s [27] influential proponentsof networked computing have envisioned electronicinformation in terms of a relatively small (even singular)number of 'sources', distributed through technologies suchas the Internet. Most recently, Levy writes, in BecomingVirtual, that "in cyberspace, since any point is directlyaccessible from any other point, there is an increasingtendency to replace copies of documents with hypertextlinks. Ultimately, there will only need to be a singlephysical exemplar of the text" [13 p.61]. Hypertextimplies, in theory, the end of 'the copy', and themultiplication of access points to the original. But, inpractice, the Internet abounds with copying, both largeand small scale, both as conscious human practice, andalso as autonomous computer function. Effective andcheap data storage that encourages computer users tokeep anything of use they have downloaded, lest the linksthey have found, 'break'; while browsers don't 'browse'the Internet - they download copies of everything to clientmachines. Not surprisingly, there is significant regulationagainst 'copying' - regulation that constrains ourunderstanding of 'copying' to maintain a legal fiction ofthe 'original' for the purposes of intellectual propertyprotection. In this paper, I will firstly demonstrate, by aseries of examples, how 'copying' is more than justcopyright infringement of music and software, but is adefining, multi-faceted feature of Internet behaviour. I willthen argue that the Internet produces an interactionbetween dematerialised, digital data and humansubjectivity and desire that fundamentally challengesnotions of originality and copy. Walter Benjamin notedabout photography: "one can make any number of prints[from a negative]; to ask for the 'authentic' print makes nosense" [4 p.224]. In cyberspace, I conclude, it makes nosense to ask which one is the copy.
Making model-based UI design practical: usable and open methods and tools
Authors: Hallvard Trætteberg, Pedro J. Molina, Nuno J. Nunes
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Model-based IU is an established discipline. However, it has not been adopted in the software industry with the initial expected success, and it has been kept in the meanwhile in the academia. The main aim of this workshop is to analyze the current problems with model-based UI design approaches and envision the main characteristics and challenges to solve in the next generation of model-based UI tools.
On Load Balancing Approaches for Distributed Object Computing Systems
Authors: Lap-sun Cheung, Yu-kwok Kwok
Venue: The Journal of Supercomputing (2004)

Distributed object computing systems are widely envisioned to be the desired distributed software development paradigm in the near future due to the higher modularity and the capability of handling machine and operating system heterogeneity. Indeed, enabled by the tremendous advancements in processor and networking technologies, complex operations such as object serialization and data marshalling become very efficient, and thus, distributed object systems are being built for many different applications. As the system scales up (e.g., with larger number of server and client objects, and more machines), a judicious load balancing system is required to efficiently distribute the workload (e.g., the queries, messages/objects passing) among different servers in the system. Several such load balancing schemes are proposed recently in the literature. However, while the rationales and mechanisms employed are dramatically different, the relative strengths and weaknesses of these approaches are unknown, making it difficult for a practitioner to choose an appropriate approach for the problem at hand. In this paper, we describe in detail three representative approaches, which are all practicable, and present a quantitative comparison using a real experimental distributed object computing platform. Among these three approaches, namely, JavaSpaces based, request redirection based, and fuzzy decision based, we find that the fuzzy decision-based algorithm outperforms the other two considerably under a wide range of different practical scenarios.
Quasi M-convex and L-convex functions: quasiconvexity in discrete optimization
Authors: Kazuo Murota, Akiyoshi Shioura
Venue: Discrete Applied Mathematics (2003)

We introduce two classes of discrete quasiconvex functions, called quasi M- and L-convex functions, by generalizing the concepts of M- and L-convexity due to Murota (Adv. Math. 124 (1996) 272) and (Math. Programming 83 (1998) 313). We investigate the structure of quasi Mand L-convex functions with respect to level sets, and show that various greedy algorithms work for the minimization of quasi M- and L-convex functions.
Understanding the Offender/Environment Dynamic for Computer Crimes: Assessing the Feasibility of Applying Criminological Theory to the IS Security Context
Authors: Robert Willison
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

There is currently a paucity of literature focusing on the relationship between the actual actions of staff members, who perpetrate some form of computer abuse, and the organisational environment in which such actions take place. A greater understanding of such a relationship may complement existing security practices by possibly highlighting new areas for safeguard implementation. In addition, if insights are afforded into the actions of dishonest staff, prior to the actual perpetration of a crime, then organisations may be able to expand theirpreventive scope, rather than relying solely on technical safeguards to stop the actual commission of some form of computer abuse. To help facilitate a greater understanding of theoffender/environment dynamic, this paper assesses the feasibility of applying criminological theory to the IS security context. More specifically, three theories are advanced, which focus on the offender's behaviour in a criminal setting. After opening with a description of the theories, the paper provides an account of the Barings Bank collapse. Events highlighted in the case study are used to assess whether concepts central to the theories are supported by the data. The paper concludes by summarising the major findings and discussing future research possibilities.
Machine Printed Text and Handwriting Identification in Noisy Document Images
Authors: Yefeng Zheng, Huiping Li, David Doermann
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, we address the problem of the identification of text in noisy document images. We are especially focused on segmenting and identifying between handwriting and machine printed text because: 1) Handwriting in a document often indicates corrections, additions, or other supplemental information that should be treated differently from the main content and 2) the segmentation and recognition techniques requested for machine printed and handwritten text are significantly different. A novel aspect of our approach is that we treat noise as a separate class and model noise based on selected features. Trained Fisher classifiers are used to identify machine printed text and handwriting from noise and we further exploit context to refine the classification. A Markov Random Field-based (MRF) approach is used to model the geometrical structure of the printed text, handwriting, and noise to rectify misclassifications. Experimental results show that our approach is robust and can significantly improve page segmentation in noisy document collections.
Fuzzy set based initial placement for IC layout
Authors: M Razaz, J Gan
Venue: Proceedings of the conference on European design automation (1990)

Three novel fuzzy algorithms for constructing initial placement of integrated circuits are introduced. These algorithms are based on the use of fuzzy set theory and show superior performance to conventional placement algorithms. One of these algorithms, namely the fuzzy clustering method, has inherent potential for placement of large and very large scale integrated circuits due to its comparative efficiency, flexibility and hierachical structure. Placement examples for all three algorithms are presented and comparedwith conventional approaches.
A geographic redirection service for on-line games
Authors: Chris Chambers, Wu-chi Feng, Wu-chang Feng, Debanjan Saha
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

For many on-line games, user experience is impacted significantly by network latency. As on-line games and on-line game servers proliferate, the ability to discover and connect to nearby servers is essential for maintaining user satisfaction. In this paper, we present a redirection service for on-line games based on the geographic location of players relative to servers. As our results show, the service better meets client demand, saving each client and the Internet as a whole, thousands of miles of networking inefficiency.
Clustering analysis of microarray gene expression data by splitting algorithm
Authors: Ruye Wang, Lucas Scharenbroich, Christopher Hart, Barbara Wold, Eric Mjolsness
Venue: Journal of Parallel and Distributed Computing (2003)

A clustering method based on recursive bisection is introduced for analyzing microarray gene expression data. Either or both dimensions for the genes and the samples of a given microarray dataset can be classified in an unsupervised fashion. Alternatively, if certain prior knowledge of the genes or samples is available, a supervised version of the clustering analysis can also be carried out. Either approach may be used to generate a partial or complete binary hierarchy, the dendrogram, showing the underlying structure of the dataset. Compared to other existing clustering methods used for microarray data analysis (such as hierarchical and K-means), the method presented here has the advantage of much improved computational efficiency while retaining effective separation of data clusters under a distance metric, a straightforward parallel implementation, and useful extraction and presentation of biological information. Clustering results of both synthesized and experimental microarray data are presented to demonstrate the performance of the algorithm.
Linear sufficiency and linear admissibility in a continuous time Gauss--Markov model
Authors: P. Ibarrola, A. Pérez-Palomares
Venue: Journal of Multivariate Analysis (2003)

This paper considers the problem of estimation in a linear model when a stochastic process instead of a random vector is observed. Estimators obtained as integrals of the observed process are studied. Characterizations of linear sufficiency and admissibility similar to those given in the classical linear model are obtained in this context. Moreover, a definition of generalized ridge estimators in continuous time is introduced and also a characterization of such estimators is given.
A Framework to Capture Dynamic Data Structures in Pointer-Based Codes
Authors: Francisco Corbera, Rafael Asenjo, Emilio L. Zapata
Venue: IEEE Transactions on Parallel and Distributed Systems (2004)

Abstract--To successfully exploit all the possibilities of current computer/multicomputer architectures, optimization compiling techniques are a must. However, for codes based on pointers and dynamic data structures, these optimization techniques have to be necessarily carried out after identifying the characteristics and properties of the data structure used in the code. In this paper, we describe the framework and the analyzer we have implemented to capture complex data structures generated, traversed, and modified in codes based on pointers. Our method assigns a Reduced Set of Reference Shape Graph (RSRSG) to each statement to approximate the shape of the data structure after the execution of such a statement. With the properties and operations that define the behavior of our RSRSG, the method can accurately detect complex recursive data structures such as a doubly linked list of pointers to trees where the leaves point to additional lists. Several experiments are carried out with real codes to validate the capabilities of our analyzer.
MPEG-7 video automatic labeling system
Authors: Ching-Yung Lin, Belle L. Tseng, Milind Naphade, Apostol Natsev, John R. Smith
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this demo, we show a novel end-to-end video automatic labeling system, which accepts MPEG-1 sequence inputs and generates MPEG-7 XML metadata files. Detections are based on the prior established anchor models. This system has two parts: model training process and labeling process. They are comprised of seven modules: Shot Segmentation, Region Segmentation, Annotation, Feature Extraction, Model Learning, Classification, and XML Rendering.
A framework for intelligent service discovery
Authors: Robert Bram, Jana Dospisil
Venue: Practicing software engineering in the 21st century (2003)

The claim of improved efficiency and reliability of networking technology provides for a framework of service discovery, where clients connect to services over the network based on a comparison of the client's requirements with the advertised capabilities of those services. Many service directory technologies exist to provide this middleware functionality; each with their own default set of service attributes that may be used for comparison and each with their own default search algorithms. Because the most expressive search ability might not be as important as robustness for directory services, the search algorithms provided are usually limited when compared to a service devoted entirely to intelligent service discovery.This paper proposes a framework of intelligent service discovery running alongside a service directory that allows the search service to have available a range of search algorithms. The most appropriate algorithm may be chosen for a search according to the data types found in the search criteria. A specific implementation of this framework will be presented as a Jini service, using a constraint satisfaction problem-solving architecture that allows different algorithms to be used as library components.
Order-Based Backorders and Their Implications in Multi-Item Inventory Systems
Authors: Jing-Sheng Song
Venue: Management Science (2002)

In a multi-item inventory system, such as an assemble-to-order manufacturing system or an online-retailing system, a customer order typically consists of several different items in different amounts. The average order-based backorders are the average number of customer orders that are not yet completely filled. While this is an important measure of customer satisfaction, it has not been widely studied in the operations management literature. This is largely because its evaluation involves the joint distribution of inventory levels of different items and other intricate relations, which is computationally dreadful. Taking a novel approach, this paper develops a tractable way of evaluating this measure exactly. We also develop easy-to-compute bounds, which require the evaluation of item-based backorders only. Numerical experiments indicate that the average of the lower and upper bounds is very effective.The exact results show surprisingly simple structures, which shed light on how system parameters affect the performance. Using these results, we study several examples to gain managerial insights. Questions addressed include: What are the implications of item-based inventory planning decisions on the order-based performance? What is the impact of introducing common components on inventory and service trade-offs? Would order-delivery performance be improved if we restrict the number of choices in product configurations?
Evidential Paradigm: The Logical Aspect
Authors: A. V. Lyaletski
Venue: Cybernetics and Systems Analysis (2003)

This paper is devoted to the description of a logical formalism, which is a part of the so-called evidential paradigm proposed by academician V. M. Glushkov in the form of a complex program of works called "Evidence Algorithm." Basic sequential calculi, their distinctive features, and results on their soundness and completeness are given. These calculi were used as a result of implementation of a system of automated deduction (SAD).
Sentiment Analyzer: Extracting Sentiments about a Given Topic using Natural Language Processing Techniques
Authors: Jeonghee Yi, Tetsuya Nasukawa, Razvan Bunescu, Wayne Niblack
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We present Sentiment Analyzer (SA) that extracts sentiment(or opinion) about a subject from online text documents.Instead of classifying the sentiment of an entire documentabout a subject, SA detects all references to the givensubject, and determines sentiment in each of the referencesusing natural language processing (NLP) techniques. Oursentiment analysis consists of 1) a topic specific featureterm extraction, 2) sentiment extraction, and 3) (subject,sentiment) association by relationship analysis. SA utilizestwo linguistic resources for the analysis: the sentiment lexiconand the sentiment pattern database. The performanceof the algorithms was verified on online product review articles("digital camera" and "music" reviews), and moregeneral documents including general webpages and newsarticles.
Failure-Detecting Arithmetic Convolutional Codes and an Iterative Correcting Strategy
Authors: G. Robert Redinbo
Venue: IEEE Transactions on Computers (2003)

Errors due to failures in data processing algorithms may be detected and even corrected by employing systematic convolutional codes defined over the fixed-point arithmetic structures supporting the computations. A new class of arithmetic convolutional codes using symbols from the finite ring associated with normal signed arithmetic is based on binary burst-correcting codes and a code's performance in the larger context exceeds that of an underlying basis code. When failures satisfy the usual guard band requirements for the binary code, error correction is possible using an iterative feedback decoder processing syndromes that are defined over the integers modulo a power of two. A class of high rate burst-correcting codes is discussed in more detail and their properties guarantee the detection of the onset of errors. The corrector also contains failure error-detecting capabilities.
Corner sequence: a P-admissible floorplan representation with a worst case linear-time packing scheme
Authors: Jai-Ming Lin, Yao-Wen Chang, Shih-Ping Lin
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Floorplanning/placement allocates a set of modules into a chip so that no two modules overlap and some specified objective is optimized. To facilitate floorplanning/placement, we need to develop an efficient and effective representation to model the geometric relationship among modules. In this paper, we present a P-admissible representation, called corner sequence (CS), for nonslicing floorplans. CS consists of two tuples that denote the packing sequence of modules and the corners to which the modules are placed. CS is very effective and simple for implementation. Also, it supports incremental update during packing. In particular, it induces a generic worst case linear-time packing scheme that can also be applied to other representations. Experimental results show that CS achieves very promising results for a set of commonly used MCNC benchmark circuits.
Extending xQuery with transformation operators
Authors: Emmanuel Bruno, Jacques Le Maitre, Elisabeth Murisasco
Venue: Proceedings of the 2003 ACM symposium on Document engineering (2003)

In this paper, we propose to extend XQuery - the XML query language - with a set of transformation operators which will produce a copy of an XML tree in which some subtrees will be inserted, replaced or deleted. These operators - very similar to the ones proposed for updating an XML document - greatly simplify the expression of some queries in making it possible to express only the modified part of a tree instead of its whole reconstruction. We compare the expressivity of XQuery extended in this way with XSLT.
Constructing a bowling information system with video content analysis
Authors: Wen Wen Hsieh, Arbee L.P. Chen
Venue: Proceedings of the 1st ACM international workshop on Multimedia databases (2003)

In this paper, we present a design and implementation of a bowling information system. This system contains three types of bowling game information including the bowling video content information, the game-related information and the player information. The MPEG-7 Description Schemes are used to describe these types of information and the relationships among them. This information is obtained through an annotator by which manual conceptual feature annotation (for the player and game-related information) and automatic perceptual feature extraction (for the video content information) are integrated. Several interesting events in the video such as strikes and the important frames are determined by automatically analyzing the video content. With an interactive user interface, users' queries are transformed into XQuery to retrieve needed information about the bowling games to learn the skills of bowling. In addition to the implementation of the system, we also perform experiments to show the effectiveness of the automatic video content information extraction.
Generative model-based clustering of directional data
Authors: Arindam Banerjee, Inderjit Dhillon, Joydeep Ghosh, Suvrit Sra
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

High dimensional directional data is becoming increasingly important in contemporary applications such as analysis of text and gene-expression data. A natural model for multi-variate directional data is provided by the von Mises-Fisher (vMF) distribution on the unit hypersphere that is analogous to the multi-variate Gaussian distribution in Rd. In this paper, we propose modeling complex directional data as a mixture of vMF distributions. We derive and analyze two variants of the Expectation Maximization (EM) framework for estimating the parameters of this mixture. We also propose two clustering algorithms corresponding to these variants. An interesting aspect of our methodology is that the spherical kmeans algorithm (kmeans with cosine similarity) can be shown to be a special case of both our algorithms. Thus, modeling text data by vMF distributions lends theoretical validity to the use of cosine similarity which has been widely used by the information retrieval community. As part of experimental validation, we present results on modeling high-dimensional text and gene-expression data as a mixture of vMF distributions. The results indicate that our approach yields superior clusterings especially for difficult clustering tasks in high-dimensional spaces.
A method of investigating a significance of input variables in non-linear high-dimensional systems
Authors: Izabela Rejer, Andrzej Piegat
Venue: Artificial intelligence and security in computing systems (2003)

This article introduces a new method of investigating a significance of input variables in non-linear multi-dimensional systems. The main advantage of the proposed method, in comparison to other widely used methods, is that it allows to investigate the significance of input variables in larger subspaces of analysed system. The article presents not only theoretical basis of the proposed method but also a practical example which aim is to build a ranking of significance for a 19-dimensional system of an unemployment rate in Poland in years 1992 - 1999.