ppxscal/embedding_network huggingface dataset:
Configuration change assessment: Genetic optimization approach with fuzzy multiple criteria for part supplier selection decisions
Authors: H. S. Wang
Venue: Expert Systems with Applications: An International Journal (2008)

This paper intends to examine the problem of assessing the configuration change of engineering products with complex structure through the observation of actual case. We aim to come up with an analysis model applicable to a production system, where the parts of products are manifold and any part is available with several suppliers, so as to establish an efficient scheme to select eligible suppliers in case that certain parts need to be replaced. Four steps are involved in the analysis model. In addition to the analysis of component parts with association graph, fuzzy theory and data T transfer are also employed, meanwhile, taking such assessment attributes as cost, quality and time into consideration, in order to effectively assess the efficiency of configuration change schemes. While selection of eligible suppliers has itself been a complex problem, however, time taken into account, multiple recurrences of the problem will make it even more difficult to find solution. Thus, we establish, by dint of genetic algorithms, a model to find solution which enables us to find near-optimal solution within a short period of time. The analysis model as well as the solution model has already been put into the case of TFT-LCD to assess its configuration change. All the potential component suppliers are appraised; all sorts of experiment parameters have been studied. The results suggest that the model can be used to assess configuration change of a complex product which may involve the replacement of several components. Furthermore, it can render a satisfactory solution.
Achieving Predictable Performance with On-Chip Shared L2 Caches for Manycore-Based Real-Time Systems
Authors: Sangyeun Cho, Lei Jin, Kiyeon Lee
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Doubling the number of processing cores on a single processor chip with each technology generation has become conventional wisdom. While future manycore processors promise to offer much increased computational throughput under a given power envelope, sharing critical on-chip resources, such as caches and coreto- core interconnects, poses challenges to guaranteeing predictable performance to an application program. This paper focuses on the problem of sharing on-chip caching capacity among multiple programs scheduled together, especially at the L2 cache level. Specifically, two design aspects of a large shared L2 cache are considered: (1) non-uniform cache access latency and (2) cache contention. We observe that both the aspects have to do with where, among many cache slices, a cache block is mapped to, and present an OS-based approach to managing the on-chip L2 cache memory by carefully mapping data to a cache at the page granularity. We show that a reasonable extension to the OS memory management subsystem and simple architectural support enable enforcing high-level policies to achieve application performance isolation and improve program performance predictability thereof.
A Trust-Based Exchange Framework for Multiple Services in P2P Systems
Authors: Anna Satsiou, Leandros Tassiulas
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

In this paper we propose fully distributed trustbased policies for p2p systems to regulate the exchange of different type of services and discourage misbehaviour. In a system of peers with different service valuations and capabilities, the resource allocation and server selection policies are based on local reputation vectors, whose elements are the reputations of the peers in providing each service of the system. Our studies demonstrate that proposed policies lead to the dynamic formation of coalitions (cooperation) among peers, which mutually profit by the exchange of their services, without pre-existing knowledge of one another's capabilities and values of services. In this way utilities of all peers progressively increase. Only misbehaving (non contributive) peers do not benefit by such a system, as proposed policies efficiently recognize and block misbehaviour.
Binary Tree-Based Clustering Algorithm and Used in Color Image Segmentation
Authors: Yuexiang Shi, Yingying Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

An effective clustering algorithm based on binary tree is proposed in this paper. A roughly extraction of the color image is gotten by constructing the self-adapting binary tree. A C_means clustering algorithm is designed based on the extraction. This algorithm is to improve the segmentation's accuracy of the binary tree's leaves. Experiments have approved that this new method can be implemented efficiently. Experiments show the results of high segmentation accuracy and mass information in origin color image at the same time.
Requirements engineering: In search of the dependent variables
Authors: Tony Gorschek, Alan M. Davis
Venue: Information and Software Technology (2008)

When software development teams modify their requirements engineering process as an independent variable, they often examine the implications of these process changes by assessing the quality of the products of the requirements engineering process, e.g., a software requirements specification (SRS). Using the quality of the SRS as the dependent variable is flawed. As an alternative, this paper presents a framework of dependent variables that serves as a full range for requirements engineering quality assessment. In this framework, the quality of the SRS itself is just the first level. Other higher, and more significant levels, include whether the project was successful and whether the resulting product was successful. And still higher levels include whether or not the company was successful and whether there was a positive or negative impact on society as a whole.
Ontology-Based Automatic Classification and Ranking for Web Documents
Authors: Jun Fang, Lei Guo, XiaoDong Wang, Ning Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The process of web document classification involves calculating similarities between documents and categories by using the information extracted from them. In recent years, ontology-based web documents classification method is introduced to solve the problem of classifier training and not considering semantic relations between words in traditional Machine Learning algorithms. However, previous works on ontology-based web documents classification miss some important issues of automatic ontology construction and ranking of classified documents. In order to solve these problems, this paper proposes an ontology-based web documents classification and ranking method. Firstly, weighted terms set are extracted from web documents, and ontology is build up by using an effective ontology construction method which clarifies and augments an existent ontology; then similarity score between documents and ontology is computed based on WordNet by using Earth Mover's Distance (EMD) method; finally, web documents are assigned to categories according to the similarity score, and a simple ranking method is used to sort the documents in the same categories. The experiment result shows our classification algorithm achieves better precision and recall compare with adaptive KNN method, and is competitive with SVM method, the ranking method also has good performance.
Computational Forensics: Towards Hybrid-Intelligent Crime Investigation
Authors: Katrin Franke, Sargur N. Srihari
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In recent years, mathematical, statistical and computer science methods have found extensive application in developing new procedures for crime investigation, prosecution and the enforcement of law. Computer-based methods have also become important tools for performing certain forensic functions. Yet, knowledge and intuition of the human expert plays a central role. This paper gives a brief overview of the potential of computational methods in forensics. The state of the art is described, some practical examples are given and a viewpoint is expressed that the methods can be extended to functions that currently rely only on expert knowledge.
WIC: a general-purpose algorithm for monitoring web information sources
Authors: Sandeep Pandey, Kedar Dhamdhere, Christopher Olston
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The Web is becoming a universal information dissemination medium, due to a number of factors including its support for content dynamicity. A growing number of Web information providers post near real-time updates in domains such as auctions, stock markets, bulletin boards, news, weather, roadway conditions, sports scores, etc. External parties often wish to capture this information for a wide variety of purposes ranging from online data mining to automated synthesis of information from multiple sources. There has been a great deal of work on the design of systems that can process streams of data from Web sources, but little attention has been paid to how to produce these data streams, given that Web pages generally require "pull-based" access. In this paper we introduce a new general-purpose algorithm for monitoring Web information sources, effectively converting pull-based sources into push-based ones. Our algorithm can be used in conjunction with continuous query systems that assume information is fed into the query engine in a push-based fashion. Ideally, a Web monitoring algorithm for this purpose should achieve two objectives: (1) timeliness and (2) completeness of information captured. However, we demonstrate both analytically and empirically using real-world data that these objectives are fundamentally at odds. When resources available for Web monitoring are limited, and the number of sources to monitor is large, it may be necessary to sacrifice some timeliness to achieve better completeness, or vice versa. To take this fact into account, our algorithm is highly parameterized and targets an application-specified balance between timeliness and completeness. In this paper we formalize the problem of optimizing for a flexible combination of timeliness and completeness, and prove that our parameterized algorithm is a 2- approximation in all cases, and in certain cases is optimal.
A Reliable Approach of Establishing Trust for Wireless Sensor Networks
Authors: Guangjie Han, Deokjai Choi, Wontaek Lim
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Wireless Sensor Networks (WSNs), which consist of spatially distributed autonomous sensing and computing devices to monitor physical conditions such as temperature and motion. Under a hostile military environment, sensor networks can be easily attacked by malicious nodes and hostile nodes using the natural cooperation of WSNs. In this paper, we introduce the trust mechanism in the human society into WSNs and propose a more overall trust model without a central trust authority, which provides a reliable approach to establish trust for WSNs. The approach combines all kinds of trust values together, including the direct trust and indirect trust value of nodes. The simulation results show that our trust model can efficiently defend against the attacks of the malicious nodes.
New Experiments and Analysis in Bragg-Diffraction Imaging
Authors: G. Wade
Venue: IEEE Transactions on Computers (1975)

System performance is substantially enhanced by using good attenuators in the system and employing a pulsing mode of operation. Spurious image elements, due to multiple reflections of the ultrasound in the acoustic cell and due to echoes from elements in the system which are not part of the object plane being imaged, can be eliminated in this fashion. In addition, depth discrimination can be substantially improved, in agreement with theory.
Linear Automata Approximation Problem
Authors: A. Paz
Venue: IEEE Transactions on Computers (1974)

The problem of approximating a linear automaton (LA) over the field of real numbers by an automaton over the field of rationals is considered. "Strong" and "weak" types of approximation are defined and investigated. Necessary and sufficient conditions for an automaton to be approximable are given. The strong approximation method enables rational computation in irrational linear systems which is suited for computer use.
Eliminating impedance mismatch in C++
Authors: Joseph (Yossi) Gil, Keren Lenz
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Recently, the C# and the VISUAL BASIC communities were tantalized by the advent of LINQ [18]---the Language INtegrated Query technology from Microsoft. LINQ represents a set of language extensions relying on advanced (some say hard to understand) techniques drawn from functional languages such as type inference, &lambda;-expressions and most importantly, monads. The 3rd edition of C# just as the 9th of VISUAL BASIC allow programmer to directly access relational and XML-based databases from within the programming language. We show that very similar capabilities can be achieved in the C++ programming language without relying on any language extensions, compiler modifications, external processing tools, or any other vendor specific machinery: ARATAT is a C++ template library whose objective is type safe generation of SQL statements for access relational database systems. Learning curve is minimal since ARARAT resembles relational algebra, which is at the core of SQL.
New Tensorial Representation of Color Images: Tensorial Morphological Gradient Applied to Color Image Segmentation
Authors: Leticia Rittner, Franklin Flores, Roberto Lotufo
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

This paper proposes a new Tensorial Representation of HSI color images, where each pixel is a 2 × 2 second order tensor, that can be represented by an ellipse. A proposed tensorial morphological gradient (TMG) is defined as the maximum dissimilarity over the neighborhood determined by a structuring element, and is used in the watershed segmentation framework. Many tensor dissimilarity functions are tested and other color gradients are compared. The comparison uses a new methodology for qualitative evaluation of color image segmentation by watershed, where the watershed lines of the n most significant regions are overlaid on the original image for visual comparison. Experiments show that the TMG using Frobenius norm dissimilarity function presents superior segmentation results, in comparison to other tested gradients.
Beyond Secrecy: New Privacy Protection Strategies for Open Information Spaces
Authors: Daniel J. Weitzner
Venue: IEEE Internet Computing (2007)

Weitzner considers present-day privacy challenges to see whether basic privacy goals are well served by protection through secrecy.
Using Modem Design Practices to Upgrade Aging Software Systems
Authors: R. N. Britcher
Venue: IEEE Software (1986)

Modifying 100,000 lines of 20-year-old code, IBM-FSD successfully applied its software engineering principles to modernization of the FAA'S air traffic control system.
Research and Realization of Transaction Concurrency Control in Grid Database
Authors: Qiuyu Zhang, Sanjun Sui, Jingrong Li
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The information time brings the need for lots of information, while the grid developments in recent years have provided enhanced support for the exchange and share of information of heterogeneous platforms and databases in large-scale domains, but how to get efficiently the information in databases in grid is still a problem. This paper discusses transaction concurrency control algorithm based on Grid Databases, and proposes a transaction concurrency control scheme to solve the problem with the algorithm of CAOTSAO (the combination algorithm of the Optimized Timestamp Method and the Optimistic Method). The test of implement of the scheme proves to be that this scheme is more efficient than 2PL protocol to process volumes of transactions in the transaction concurrency control in Grid Database System.
Special Feature: Software Theft
Authors: R. L. Glass
Venue: IEEE Software (1985)

Modular decomposition offers a way to ascertain a software theft. Morevoer, the method is straightforward enough for a software-illiterate judge or jury to understand
Content Based Image Retrieval using a Descriptors Hierarchy
Authors: Raquel E. Patino-Escarcina, Jose Alfredo F. Costa
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Content based image retrieval (CBIR), a technique which tries to find a set of images similar to a given example. Low level descriptors can be used to represent and index images. The main problem of CBIR is the gap between these descriptors and abstract concepts. The proposal present in this paper resembles the search process within a set of objects. First, objects can be found in a collection by looking general features and discarding those objects that do not fit into these features to reduce the search space. Next, another more specific feature can help to find these objects in the reduced search space. This work proposes the arrangement of low level descriptors into a hierarchy. This arrangement has to be done considering the detail of information that descriptor gives. Finally, descriptors on each level of the hierarchy are used to index images in the search space and a filter to reduce it has to be executed. This process is repeated until the low level of the hierarchy is reached. Experiments demonstrate the effectiveness of the proposed approach compared with the traditional ones and reveal it as a good option to implement CBIR systems.
Surface Segmentation through Concentrated Curvature
Authors: Mohammed Mostefa Mesmoudi, Emanuele Danovaro, Leila De Floriani, Umberto Port
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Curvature is one of the most relevant notions that links the metric properties of a surface to its geometry and to its topology (Gauss-Bonnet theorem). In the literature, a variety of approaches exist to compute curvatures in the discrete case. Several techniques are computationally intensive or suffer from convergence problems. In this paper, we discuss the notion of concentrated curvature, introduced by Troyanov [24]. We discuss properties of this curvature and compare with a widely-used technique that estimates the Gaussian curvatures on a triangulated surface. We apply our STD method [13] for terrain segmentation to segment a surface by using different curvature approaches and we illustrate our comparisons through examples.
ALIS: A Geographical Information System for Urban Research
Authors: Sachio Kubo
Venue: IEEE Computer Graphics and Applications (1984)

Computer graphics can help solve urban problems. The ALIS geographic information system presents up-to-date, detailed information in a form planners can use: the interactive map. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
API-Evolution Support with Diff-CatchUp
Authors: Zhenchang Xing, Eleni Stroulia
Venue: IEEE Transactions on Software Engineering (2007)

Refactoring is an important activity in the evolutionary development of object-oriented software systems. Several IDEs today support the automated application of some refactorings; at the same time, there is substantial on-going research aimed at developing support for deciding when and how software should be refactored and for estimating the effect of the refactoring on the quality requirements of the software. On the other hand, understanding the refac-torings in the evolutionary history of a software system is essential in understanding its design rationale, which might be very helpful in assisting future maintenance and evolution tasks. The JDEvAn tool supports a comprehen-sive refactoring-analysis process, including the extraction of logical-design elements and relations from the system's code, the recovery of design-level changes from one version to the next, the identification of refactorings as compo-sitions of such changes, and the interactive visualization and analysis of the recovered changes. In this paper, we discuss JDEvAn' method and argue for its effectiveness with two case studies on realistic open-source object-oriented software, in the context of which we show how the recovered refactoring knowledge may be used to guide future development.
Kansei games: entertaining your emotions
Authors: Benjamin Salem, Ryohei Nakatsu
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Essentially Kansei Games are a new concept of games that focus on delivering a constructive positive experience to the game player. We wish to do this by addressing the player needs, requirements and desires. We propose a Needs Requirements and Desires (NRD) model where the self is at the centre, and all needs requirements and desires radiate from it. It is an egocentric, egoistic and hedonistic model. In which, needs relates to the essentials, requirements to the necessary and desires to the optional. While playing a game, it is possible to assess its usage in terms of its effect on the player's NRD. We believe that the fulfilment of the NRD would yield a positive game experience. We would like to propose an approach that addresses user's NRD and results in enrichment, positive affect and inner balance for the user.
Zoom*UserViews: querying relevant provenance in workflow systems
Authors: Olivier Biton, Sarah Cohen-Boulakia, Susan B. Davidson
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In this demonstration, we present the ZOOM*UserView system, and focus on the module which generates a "user view" based on what tasks the user perceives to be relevant in the workflow specification. We will show how user views can be used to reduce the amount of information returned by provenance queries, while focusing on information the user finds relevant. User views are based on the notion of composite tasks, and induce a higher-level specification of a workflow.
Modified SMC method of blind multiuser detection for DS-CDMA systems over fading channels
Authors: Qian Yu, Guoan Bi, Liren Zhang
Venue: Wireless Personal Communications: An International Journal (2007)

This paper presents the application of sequential Monte Carlo (SMC) methodology for blind detection in wireless direct sequence code division multiple access (DS-CDMA) systems over fading channels. It is known that the conventional SMC method requires a high-computational complexity that grows exponentially with the number of active users. This paper proposes a solution to this problem by employing Cholesky factorization to decompose the observed data into separate components for each user and then the parameters of each user are estimated with the SMC inference method under the decision feedback framework. Based on these concepts, an efficient blind decision feedback SMC (DF-SMC) receiver is developed for differentially encoded DS-CDMA systems. Simulation results demonstrate the promising performance of the proposed receiver for both flat fading and frequency-selective fading channels.