ppxscal/embedding_network huggingface dataset:
HPRS: A Hybrid P2P Reputation System using File and Peer Rating
Authors: Srinivasan T., Varun Ramachandran, Arun Vedachalam, S. K. Ghosh
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Peer-to-peer file sharing networks have gained a lot of popularity and are burgeoning day by day. The widespread use inevitably produces malicious peers who try to disrupt the network by flooding it with inauthentic files. This necessitates the need for a robust reputation system to identify bad peers and files. The former has been extensively studied and many peer based reputations already exist. In this paper we present a novel framework for a Hybrid P2P Reputation System (HPRS) using peer and file rating. This combined rating enables good peers to judge individual files and thus eliminate any inauthentic downloads. It also helps a peer extract the maximum from the system by enabling him to get those occasional good files from bad peers and reject accidental bad files from good peers. Simulation results illustrate that HPRS significantly improves performance in a network.
The VIVID Symbolic Design System: Current Overview And Future Directions
Authors: C. Rogers
Venue: IEEE Design Test (1986)

VIVID, the vertically integrated VLSI design system developed at the Microelectronics Center of North Carolina, was firstreleased in January 1985. Since that time feedback from wide industrial and academic exposure has been positive, confirmingthe need for symbolic design tools and providing research and development insignts?illuminating insights that should alsobe of interest to the CAD community. Coining a line from Robert Burns poem ?To a Mouse,? the best-laid plans of mice and softwaredesigners are not always implemented. When examining the data, assumptions, and analyses that motivated VIVID, one discoversplanned (but discarded) developments; however, an inclusive overvoew is needed to properly evaluate those data, assumptions,and analyses. Knowing clearly why something was done and how it fits into the overall picture can help us to frame futuredecisions and shape future designs.
Pàtrà: A Novel Document Architecture for Integrating Handwriting with Audio-Visual Information
Authors: G. Harit, V. Mankar, S. Chaudhury
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we present P`atr`a - an integrated docu- ment architecture which incorporates handwritten illustra- tions captured and rendered in a temporal fashion synchro- nized with audio, video, text, and image data. The architec- ture of P`atr`a permits non-linear growth in the form of mul- tiple hierarchically organized play streams. Semantic meta- data is also an integral part of P`atr`a which serves a useful purpose of organizing such documents in a collection. We have developed an email application in which the users are provided with an authoring and rendering environment to compose, view, and reply to messages in the form of P`atr`a.
NFP-aware Semantic Web Services Selection
Authors: Marco Comerio, Flavio De Paoli, Andrea Maurino, Matteo Palmonari
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

The discovery of a Semantic Web Service (SWS) is the act of locating a machine-processable description of a SWS- related resource that may have been previously unknown and that meets certain functional criteria. The increasing availability of services that offer similar functionalities re- quires the discovery process to be enhanced with a selec- tion phase that considers non-functional properties (NFPs) of services. This paper proposes a model to describe these properties and a novel approach to service selection. Our approach is based on the design of matching rules by means of mediators defined by sets of rules stating the condition for successful matches. These rules are based on the on- tological description of objects representing NFPs that are required and offered. In particular, we define a set of rule schemas to support mediation and matching for a class of user-defined NFP-constraints clustered according to speci- fied constraint operators. Rules support matching for both qualitative and quantitative non-functional properties.
Location Prediction for Tracking Moving Objects Based on Grey Theory
Authors: Ying-yuan Xiao, Hua Zhang, Hong-ya Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The traditional predictive methods for tracking moving objects usually assume that moving objects have linear motion patterns. This severely limits their applicability, since in practice movement is usually free and uncertain. In this paper, a novel location prediction model based on grey thory is presented. The proposed location prediction model adopts the grey modeling method to predict the future location of uncertain moving objects. Comparing with the linear prediction model, the proposed prediction model relaxes the limitation to motion pattern of moving objects and the requirement for accuracy of sampling data. The experiment results show the proposed prediction model can provide the more exact prediction than the linear prediction model.
Ridgelet kernel regression
Authors: Shuyuan Yang, Min Wang, Licheng Jiao
Venue: Neurocomputing (2007)

A ridgelet kernel regression method is presented in this paper to approximate multi-dimensional functions, especially those with certain kinds of spatial inhomogeneities. This method is based on ridgelet theory, kernel and regularization techniques from which we can deduce a regularized kernel regression form. By representing this form with quadratic programming and taking the obtained solution to define a fitness function, we use particle swarm optimization to optimize the directions of ridgelets. The properties of ridgelet can guarantee the stability of this method in approximating multi-dimensional functions, as well as its superiority for functions with linear singularities. Additionally, the regularized technique employed in this model leads to smaller generalization error. Experiments in the tasks of regression and classification show its effectiveness.
Modeling human interaction resources to support the design of wearable multimodal systems
Authors: Tobias Klug, Max Mühlhäuser
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Designing wearable application interfaces that integrate well into real-world processes like aircraft maintenance or medical examinations is challenging. One of themain success criteria is how well the multimodal interaction with the computer system fits an already existing real-world task. Therefore, the interface design needs to take the real-world task flow into account from the beginning. We propose a model of interaction devices and human interaction capabilities that helps evaluate how well different interaction devices/techniques integrate with specific real-world scenarios. The model was developed based on a survey of wearable interaction research literature. Combining this model with descriptions of observed real-world tasks, possible conflicts between task performance and device requirements can be visualized helping the interface designer to find a suitable solution.
The Application of Multi-sensors Fusion in Vehicle Transmission System Fault Diagnosis
Authors: Xiaobing Wu, Shuangzhe Liu, Dharmendra Sharma
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Multi-sensors fusion technology is adopted for fault diagnosis of vehicle transmission system. By using hybrid pattern fusion based on artificial neural networks (ANN), the robustness of the diagnosing system is improved greatly. This hybrid fusion pattern avoids working with a great deal of original data from sensors, while it has the advantage of less information lost. At the same time, the diagnosis effect is improved by using feature-level and decision-level vibration data and original-level lube data.
Product Profile
Venue: Computer (1973)

Information on the products and services advertised in PRODUCT PROFILE may be obtained by writing the product listing's number (in parenthesis at the beginning of each listing) on the postage-paid reader service card this issue. 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
Cellular Neural Network Based Urinary Image Segmentation
Authors: Zanchao Zhang, Shunren Xia, Huilong Duan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

A novel approach for urinary image segmentation based on cellular neural network (CNN) was presented in this paper. Before the image segmentation, a preprocessing by stretching the difference between every pixel and the local gray mean value for eliminating the disequilibrium of illumination and enhancing the edges of objects is considered here. The experiment results with more than 100 clinical urinary images show that this approach provides more accurate objects detection compared with conventional threshold based ones.
Using advanced transaction and workflow models in composing web services
Authors: Juha Puustjärvi
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

A useful feature of Web services is that new and more complex Web services can be composed of other Web services. However, in many cases composed web services are useful only if they can be processed atomically. The (semantic) atomicity of composed Web services is ensured in a similar way as with advanced transaction models which use compensating transactions to undo the effects of successfully executed subtransactions. However, a problem of such compensation is that it has two contradicting semantics: from local point of view the subtransaction is like any single transaction while from global point of view it is a subtransaction of a distributed transaction having the mutual atomicity dependencies. As a result executing compensating transaction may cause problems, e.g., the cancellation of the hotel reservation may give rise for a special charge. In order to achieve shared understanding of transactions' semantics we have developed a transaction ontology to be used in the Web. In this paper we explain how it should be used in information exchange between Web services. In addition we present our developed CWS-Transaction model (Composed Web Service Transaction model), which censures the atomicity of composed Web services but does not use compensating transactions at all. We also illustrate how CWS-transactions can be processed by a workflow engines based on BPEL4WS-code.
A User-Centric Resource Sharing Architecture for Virtual Personal Computing
Authors: Faqun Jiang, Jintao Li, Xiaoli Su, Jian Ye, Zhenmin Zhu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

As innovative technologies like ubiquitous computing and grid computing continue to emerge and become more popular, the amount of resource available on them has come to an extreme extend. However, traditional provider-centric resource sharing architecture focuses on defining service interfaces so that users must know exactly where and how to explicitly ask for resources. This method can not satisfy user's personalized task requirements. To solve the problem, this paper puts forward a usercentric resource sharing architecture which called URSA. The U-RSA mainly focuses on abstracting the currently personal computing environment from user's perspective. This paper also discusses the key technologies of our architecture.
Tutorial Series 6 Structured Programming
Authors: R. W. Jensen
Venue: Computer (1981)

Structured programming is based on the stepwise refinement process a method ofproblem decomposition common to all engineering disciplines and the physical, chemical, and biological sciences.
Rotary Kiln Intelligent Control Based on T-S Fuzzy Neural Network and Rough Sets
Authors: Jie-sheng Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Based on the idea of the knowledge reduction of the rough sets (RS) theory and the nonlinearity mapping of Takagi-Sugeno fuzzy neural network (FNN), a kind of RS-FNN intelligent control method is presented and applied in the rotary kiln sintering process due to its nonlinearities in the dynamics and the large dimensionality of the problem. Firstly, fuzzy c-means (FCM) clustering method based on a new cluster validity index is used to obtain the optimal discrete values of the continuous attributes. Then, RS theory is adopted to obtain the reductive rules using industrial history datum and corresponding FNN model has better topology configuration. Finally, the structure parameters of T-S fuzzy model are fine-tuned by a hybrid algorithm integrating the gradient descent method with least-squares estimation. The results of simulation as well as temperature control for an industrial rotary kiln furnace of iron ore oxidized pellets sintering process were performed to demonstrate the feasibility and effectiveness of the proposed scheme.
Trend Feature Mining Algorithm Based on Financial Time Series
Authors: Chi Xie, Hua Tan, Xiang Yu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, we transform shares time series into price rate of change (ROC) time series based on the characteristics of Financial Time Series, improving the trend feature algorithm and clustering algorithm, and providing a new corresponding feature similarity measure, therefore we can forecast time series into the detection of frequent and effective sets, which can help us to make data mining forecasts. Experimental results indicate that the proposed method is effective in event forecasting.
Five Enablers for Mobile 2.0
Authors: William G. Griswold
Venue: Computer (2007)

Mobile 2.0's power lies in computing the here and now.
A Fuzzy Ontology and Its Application to Computer Games
Authors: Yun Ling, Hua-Mao Gu, Xun Wang, Jin-Qin Shi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper presents a fuzzy ontology taken as a common understanding and unequivocal sharing of the domain knowledge in computer game community. For better representing knowledge in computer game, we have explored the uncertainty information useful for property computing and incorporated it into ontology. After an investigation, we defined two fuzzy relations: damage effectiveness and armor effectiveness, both playing vital roles in property calculating. To build such a fuzzy ontology, we also introduce a use-case based fuzzy ontology constructing (UFOC) methodology that includes use-case analysis and fuzzification processes, and a way of representing fuzzy information with ontology description language.
Mixed-integer nonlinear programming: some modeling and solution issues
Authors: J. Lee
Venue: IBM Journal of Research and Development (2007)

We examine various aspects of modeling and solution via mixed-integer nonlinear programming (MINLP). MINLP has much to offer as a powerful modeling paradigm. Recently, significant advances have been made in MINLP solution software. To fully realize the power of MINLP to solve complex business optimization problems, we need to develop knowledge and expertise concerning MINLP modeling and solution methods. Some of this can be drawn from conventional wisdom of mixed-integer linear programming (MILP) and nonlinear programming (NLP), but theoretical and practical issues exist that are specific to MINLP. This paper discusses some of these, concentrating on an aspect of a classical facility location problem that is well-known in the MILP literature, although here we consider a nonlinear objective function.
Image Analysis Using Hahn Moments
Authors: Pew-Thian Yap, Raveendran Paramesran, Seng-Huat Ong
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

This paper shows how Hahn moments provide a unified understanding of the recently introduced Chebyshev and Krawtchouk moments. The two latter moments can be obtained as particular cases of Hahn moments with the appropriate parameter settings, and this fact implies that Hahn moments encompass all their properties. The aim of this paper is twofold: 1) To show how Hahn moments, as a generalization of Chebyshev and Krawtchouk moments, can be used for global and local feature extraction, and 2) to show how Hahn moments can be incorporated into the framework of normalized convolution to analyze local structures of irregularly sampled signals.
Covering Algorithm Based on Neighborhood Search and its Applications
Authors: Tao Wu, Junjun Mao, Liang Gao, Ling Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The theory and applications of artificial neural networks have developed rapidly since the mathematical model of neuron was presented, but the design of network structure for a certain problem was a roadblock over a long period of time. In 1990s, the covering algorithm for forward neural network was put forward, this algorithm is a constructive machine learning method, it designs network with sphere neighborhoods built upon sample data. The theoretical analysis indicates that the general ability of this algorithm is in the inverse ratio of the number of covering domains. Some techniques is performed while constructing the sphere neighborhood set to simplify the network, such as changing the sphere neighborhoods center to the barycentre of points covered by a domain, deleting the points covered by a sphere neighborhood. In this paper, a new constructive algorithm which combines the covering algorithm and neighborhood search is presented and applied to some databases on the web site of UCI and text categorization, the results show that the algorithm can reduce the number of sphere neighborhoods with higher degree of classifying accuracy.
The Ada Compiler Validation Capability
Authors: J. B. Goodenough
Venue: Computer (1981)

ACVC tests, tools, procedures, and documentation represent a forward-looking, detailed strategy for enforcing conformance to the Ada standard when it really counts before widespread implementation.
Some thoughts on security after ten years of qmail 1.0
Authors: Daniel J. Bernstein
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

The qmail software package is a widely used Internet-mail transfer agent that has been covered by a security guarantee since 1997. In this paper, the qmail author reviews the history and security-relevant architecture of qmail; articulates partitioning standards that qmail fails to meet; analyzes the engineering that has allowed qmail to survive this failure; and draws various conclusions regarding the future of secure programming.
Aggressive or conservative, general or specific? A study of organizations adopting different learning strategies in an artificial world
Authors: Te-Tsai Lu, Jong-Chen Chen, Guo-Xun Liao
Venue: Expert Systems with Applications: An International Journal (2008)

An increasing growth of keen competitions among global industries greatly challenges present organizations (companies). The purpose of this study is to construct a computer simulation system for investigating the effects of organizations adopting different learning strategies on the change in consumer market share. The system constructed is an abstract model that captures some general features of consumers and organizations as well as their interactions in the real world, which constitutes an artificial world. It has four major modules: consumers, organizations, fitness evaluation, and organizational learning. These modules, including their interactions, are linked through the discrete-event simulation techniques. Experimental results show that different organizational learning strategies are better suited for different environments or the same environment at different times. Organizational learning provides organizations a chance of undergoing transformation to better meet consumers' needs. However, it is risky to blindly adopt an aggressive learning strategy when the environment (market) is not stable. Instead, it may be better to adopt a conservative learning strategy.
Summarizing Scientific Texts: Experiments with Extractive Summarizers
Authors: Pedro Paulo Balage Filho, Thiago Alexandre Salgueiro Pardo
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper we present experiments on scientific text summarization. From a complete text, we produce a shorter version containing all the main parts of the research. Having in mind the sophisticated structure of such texts, we show that good results can be achieved using simple extractive summarizers with some obvious improvements that consider the specificity of the text genre. Specifically, we enhance the summarization process with the ability to detect and appropriately treat the text structure.
Experiments on the Knee Criterion in a Multiprogrammed Computer System
Authors: T. Nishigaki
Venue: IEEE Transactions on Software Engineering (1983)

Although the effectiveness of the knee criterion [7] as a virtual memory management strategy is widely accepted, it has been impossible to take advantage of it in a practical system, because little information is available about the program behavior of executing jobs.
Network: A Multiprocessor Program
Authors: P. B. Hansen
Venue: IEEE Transactions on Software Engineering (1978)

This paper explores the problems of implementing arbitrary forms of process communication on a multiprocessor network. It develops a Concurrent Pascal program that enables distributed processes to communicate on virtual channels. The channels cannot deadlock and will deliver all messages within a finite time. The operation, structure, text, and performance of this program are described. It was written, tested, and described in two weeks and it worked immediately.
Genetic algorithms, path relinking, and the flowshop sequencing problem
Authors: Colin R. Reeves, Takeshi Yamada
Venue: Evolutionary Computation (1998)

In a previous paper, a simple genetic algorithm (GA) was developed for finding (approximately) the minimum makespan of the n-job, m-machine permutation flowshop sequencing problem (PFSP). The performance of the algorithm was comparable to that of a naive neighborhood search technique and a proven simulated annealing algorithm. However, recent results have demonstrated the superiority of a tabu search method in solving the PFSP. In this paper, we reconsider the implementation of a GA for this problem and show that by taking into account the features of the landscape generated by the operators used, we are able to improve its performance significantly.