ppxscal/embedding_network huggingface dataset:
Optimization Modeling and Algorithm of Facility Location Problem in Perishable Commodities Emergency System
Authors: Min Zhang, Jun Yang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this paper, the optimization modeling and algorithm of facility location problem in perishable commodities emergency system is studied. First, transportation cost and perishability loss of the distribution network is computed separately. Then, our problem is modeled as a kind of emergency optimization problem under certain time constraints, and the modeling objective is logistics cost minimization. In order to solve it, a re-marking algorithm is proposed.
Analyzing and Minimizing the Impact of Opportunity Cost in QoS-aware Job Scheduling
Authors: M. Islam, P. Balaji, G. Sabin, P. Sadayappan
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Quality of service (QoS) mechanisms allowing users to request for turn-around time guarantees for their jobs have recently generated much interest. In our previous work we had designed a framework, QoPS, to allow for such QoS. This framework provides an admission control mechanism that only accepts jobs whose requested deadlines can be met and, once accepted, guarantees these deadlines. However, the framework is completely blind to the revenue these jobs can fetch for the supercomputer center. By accepting a job, the super-computer center might relinquish its capability to accept some future arriving (and potentially more expensive) jobs. In other words, while each job pays an explicit price to the system for running it, the system may also be viewed as paying an implicit opportunity cost by accepting the job. Thus, accepting a job is profitable only when the job's price is higher than its opportunity cost. In this paper we analyze the impact such opportunity cost can have on the overall revenue of the supercomputer center and attempt to minimize it through predictive techniques. Specifically, we propose two extensions to QoPS, Value-aware QoPS (VQoPS) and Dynamic Value-aware QoPS (DVQoPS), to provide such capabilities. We present detailed analysis of these schemes and demonstrate using simulation that they not only achieve several factors improvement in system revenue, but also good service differentiation as a much desired side-effect.
Note: A note on the complexity and tractability of the heat equation
Authors: Arthur G. Werschulz
Venue: Journal of Complexity (2007)

We wish to solve the heat equation u"t=@Du-qu in I^dx(0,T), where I is the unit interval and T is a maximum time value, subject to homogeneous Dirichlet boundary conditions and to initial conditions u(.,0)=f over I^d. We show that this problem is intractable if f belongs to standard Sobolev spaces, even if we have complete information about q. However, if f and q belong to a reproducing kernel Hilbert space with finite-order weights, we can show that the problem is tractable, and can actually be strongly tractable.
Bounding L2 gain system error generated by approximations of the nonlinear vector field
Authors: Kin Cheong Sou, Alexandre Megretski, Luca Daniel
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Typical nonlinear model order reduction approaches need to address two issues: reducing the order of the model, and approximating the vector field. In this paper we focus exclusively on the second issue, and present results characterizing the repercussions at the system level of vector field approximations. The error assessment problem is formulated as the L2 gain upper bounding problem of a scaled feedback interconnection. Applying the small gain theorem in the proposed setup, we prove that the L2 gain of the error system is upper bounded by the L2 gain of the vector field approximation error, provided it is small. In addition, the paper also presents a numerical procedure, based on the IQC/LMI approach, to perform the error estimation task with less conservatism. A numerical example is given in this paper to demonstrate the practical implications of the presented results.
Internal Accounting Controls in the Office of the Future
Authors: A. D. Bailey
Venue: Computer (1981)

The law, as well as good business practice, requires adequate internal accounting controls. Modeling and machine analysis of office information systems can ensure compliance.
Application of Particle Swarm Optimization Based BP Neural Network on Engineering Project Risk Evaluating
Authors: Chun-guang Chang, Ding-wei Wang, Ya-chen Liu, Bao-ku Qi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The purpose of this paper is to improve the risk evaluating quality of engineering project. The topology structure of particle swarm optimization (PSO) based BP (PSOBP) neural network is described, the principle of PSOBP neural network is introduced, and the implement step of PSOBP neural network is given. The combination algorithm is applied to risk evaluating for the engineering project, and its result is compared with that of conventional BP neural network. The comparing result shows that PSOBP neural network fits to complex system such as risk evaluating for engineering project, it improves in a certain extent on training speed and precision, it can improve the quality of engineering project risk evaluating, and it fits to solve some problems in which evaluating indexes weights are difficult to be determined or there exists complex non-linear relation among them.
Identifying synonymous concepts in preparation for technology mining
Authors: Cherie Courseault Trumbach, Dinah Payne
Venue: Journal of Information Science (2007)

In this research, the development of a `concept-clumping algorithm' designed to improve the clustering of technical concepts is demonstrated . The algorithm developed first identifies a list of technically relevant noun phrases from a cleaned extracted list and then applies a rule-based algorithm for identifying synonymous terms based on shared words in each term. An assessment of the algorithm found that the algorithm has an 89&#x2014;91% precision rate, was successful in moving technically important terms higher in the term frequency list, and improved the technical specificity of term clusters.
Policy-driven autonomic management of multi-component systems
Authors: Raphael M. Bahati, Michael A. Bauer, Elvis M. Vieira
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Policies have been proposed as a means to express required or desired behavior of systems and applications, and possible management actions for resolving violations, to an autonomic manager. In multi-component systems, such as e-commerce systems, independent sets of policies often deals with managing the behavior of the individual components. In turn, the autonomic management system uses the policies to make decisions on what actions to take per component when a policy is violated. During operation of these multi-component systems, however, these independent sets of policies may yield multiple directives from which the autonomic manager must select one or more appropriate actions. In this work we look at heuristics that an autonomic manager might use to select an action. We outline the design and implementation of an autonomic manager making use of these heuristics and describe our experiences with it in a dynamic Web server. Experimental results are reported comparing the effectiveness of the heuristics.
Ant colony optimisation for generation of conformance testing sequences using a characterising set
Authors: Chiou Peng Lam, Jitian Xiao, Huaizhong Li
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Protocol conformance testing generally involves cheching whether the protocol under test conforms to the given specification. The generation of test sequences in an efficient and effective way that achieves the required fault detection coverage is highly desirable. This paper proposed an approach that formulates the problem of finding shorter test sequences based on the Wp method into one of finding the shortest tour in the asymmetric travelling salesman problem (ATSP). In the formulation of the ATSP, the approach excludes redundant test segments, employs the concepts of overlap to reduce test sequence length and concatenation without linking cost ito the test sequence generation technique. The approach recast a Software Engineering problem as a search-based problems using Ant Colony Optimization to find the shortest will maintain the same fault detection capability as those of the Wp method. The approach is applicable to every minimal FSM as each one of them possesses a characterising set.
Group-based Coordinated Checkpointing for MPI: A Case Study on InfiniBand
Authors: Qi Gao, Wei Huang, Matthew J. Koop, Dhabaleswar K. Panda
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

As more and more clusters with thousands of nodes are being deployed for high performance computing (HPC), fault tolerance in cluster environments has become a critical requirement. Checkpointing and rollback recovery is a common approach to achieve fault tolerance. Although widely adopted in practice, coordinated checkpointing has a known limitation on scalability. Severe contention for bandwidth to storage system can occur as a large number of processes take a checkpoint at the same time, resulting in an extremely long checkpointing delay for large parallel applications. In this paper, we propose a novel group-based checkpointing design to alleviate this scalability limitation. By carefully scheduling the MPI processes to take checkpoints in smaller groups, our design reduces the number of processes simultaneously taking checkpoints, while allowing those processes not taking checkpoints to proceed with computation. We implement our design and carry out a detailed evaluation with micro-benchmarks, HPL, and the parallel version of a data mining toolkit, MotifMiner. Experimental results show our group-based checkpointing design can reduce the effective delay for checkpointing significantly, up to 78% for HPL and up to 70% for MotifMiner.
Extremal Optimization with Local Search for the Circular Packing Problem
Authors: Wenqi Huang, Jian Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Extremal optimization (EO) is a heuristic nature- inspired algorithm and has been applied to solve some discrete combinatorial optimization problems. In this paper, a continuous version of EO, called EO with local search (EOLS), is presented to solve the problem of packing unequal circles into a larger circular container. First, an equivalent physical model of the problem is adopted to handle the constraints. In order to optimize the continuous energy function of the model, EOLS performs an additional local search procedure after every update step of the original EO. The approach combines the power of conventional gradient method to find local minima and that of EO method in global optimization. The computational results on some problem instances ta- ken from the previous literatures show that the proposed approach produces high-quality solutions within reason- able runtime. It should be noted that for all but two instances we found new lower bounds missed in previous papers.
Using Agents for Detection of Frauds in Municipal Taxes
Authors: Claudio Henrique C. Sampaio, Osevaldo da Faria, Sofiane Labidi
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This article presents the stages of software development based on agents used to achieve the main goal of this article, which is the detection of frauds in municipal taxes. In the stages of analysis and design of the system, the methodology MAS- CommonKADS and the ontology ONTOMADEM were used. A generic user model, obtained from historical data from actions of the users, and inference functions of behavior are proposed. The results obtained from tests in São Luís municipal government, Maranhão state, in Brazil, are also reported here.
Color Space Selection for Moving Shadow Elimination
Authors: Yong Shan, Fan Yang, Runsheng Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Moving shadow elimination is an important step in many applications of video. And pixels belonging shadow region are often misclassified as object during segmentation and tracking. There are many algorithms that deal with shadow in different color spaces in literatures. However, it is difficult to determine the optimal color space in which to remove shadow. In this paper, we study the features of moving object and shadow in different color spaces to solve the problem, and a moving object detecting model is given by using grey and gradient of shadow.
The impact of the brand in the success of a mobile game: comparative analysis of three mobile J2ME racing games
Authors: Björn Stenbacka
Venue: Computers in Entertainment (CIE) (2008)

A short value chain, strong brand, strong game concept, broad porting, strong language support (EFIGS, i.e., English, French, Italian, German and Spanish), combined with short time to market and powerful global distribution machinery, are key components in building a successful mobile game and gaming business. But which of these components and factors affect success when success is defined as high revenue per download and high download volumes of the game? Or does the combination of all these factors decide the outcome? These are two central research questions in this study. We specifically describe the effects of using a brand in the mobile games' value chain. The comparative analysis of three J2ME-branded racing games points to the fact that the brand has a significant impact on the value chain and the success of a game. The stronger the brand the shorter the value chain, and the higher the revenue per download and the download volume. To some extent, a strong brand compensates for a lack in game quality, and even game porting. The other way around, we find that if the brand is weak even a good-quality game and very broad porting cannot compensate for the negative impact of a weak brand.
Text-Independent Writer Identification and Verification on Offline Arabic Handwriting
Authors: M. Bulacu, L. Schomaker, A. Brink
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, we evaluate the performance on Arabic handwriting of the text-independent writer identification methods that we developed and tested on Western script in recent years. We use the IFN/ENIT data in the experiments reported here and our tests involve 350 writers. The results show that our methods are very effective and the conclu- sions drawn in previous studies remain valid also on Arabic script. High performance is achieved by combining textu- ral features (joint directional probability distributions) with allographic features (grapheme-emission distributions).
A P2PSIP Demonstrator Powered by OverSim
Authors: Ingmar Baumgart, Bernhard Heep, Stephan Krause
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

A fundamental problem in studying peer-to-peer networks is the evaluation of new protocols. This commonly involves both the simulation of the protocol in a large-scale network as well as the testing of the protocol in connection with real applications in networks like PlanetLab. To facilitate these tasks we developed the overlay simulation framework OverSim [1]. It was designed to fulfill a number of requirements that have been partially neglected by existing simulation frameworks. In our demonstrator we show how OverSim can not only be used to simulate overlay protocols in large-scale networks, but also demonstrate its real-world capabilities by means of a P2PSIP testbed.
Immune Algorithms for Multi-solution Based on Partition and Local Recombination
Authors: Meiyi Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Dealing with multi-solution problems by intelligent computations is a new research focus. Searching multi-solution has wide-ranging practical background and broad applied significance, and it also is a very difficult problem. The relation between multi-solution and diversity is inherent. Diversity feature of immunity has advantages in searching multi-solution. Methods of partition and local recombination are designed in order to effectively increase number of solutions and decrease the computational expensiveness of algorithms. Then a suitable or reasonable algorithm model for multi-solution problems based on immunities with partition and local recombination is present. Finally simulation experiments prove the feasibility of the method.
Collision-Free Access Control for Computer Communication Bus Networks
Authors: K. P. Eswaran
Venue: IEEE Transactions on Software Engineering (1981)

This paper considers access control for local area computer communication networks. We propose two distributed access control schemes for a bus network. The schemes are simple and asynchronous, and provide for collision-free communication among ports. In addition, one of the schemes provides a bounded, guaranteed time to transmisidon for each port. We also show that this scheme is efficient in the use of the bus bandwidth, in the sense that there is only a small fraction of time during which the bus is idle when there is at least one packet available for transmission.
P2P-IM: A P2P Presence System for the Internet
Authors: Ravi Rao, Sandeep K. Singhal
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Traditional instant messaging applications rely on central server infrastructure to broker user information. The cost and complexity of this infrastructure makes it difficult for developers to build and deploy lightweight presence and instant messaging systems within their own applications. In this paper, we describe P2P-IM, a peer-to-peer instant messaging client that does not rely on any hosted server infrastructure. The system provides the rich facilities available from traditional client-server systems but enables easy deployment and integration with existing applications. The solution provides simplified identity generation, connectivity, and rich per-application data publication.
Managing Behaviour Trust in Grids Using Statistical Methods of Quality Assurance
Authors: Elvis Papalilo, Bernd Freisleben
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

In this paper, an approach for managing behaviour trust of participants in Grid computing environments is presented. By considering the interaction process among participants in Grid environments similar to an industrial production process, we argue that through the use of statistical methods of quality assurance it is possible to monitor the behaviour of Grid participants and discover deviations in order to assess the behaviour trust of the participants.
Procedural Neural Network Based on Statistical Features
Authors: Jiuzhen Liang, Chunlan Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper deals with a novel model which called procedural neural network model based on some statistical features of temporal data set. As large amount of information included in spatio-temporal data problem, computational complexity is a key issue for procedural neural networks. Some statistical features, such as expectation, variation, play important roles in expression a series of variable data with respect to time. So these statistical features are introduced as aggregation mapping from a temporal domain to vector space in procedural neural networks instead of calculating each input data on temporal axes. By this strategy, computational complexity in the procedural neural networks is reduced down deeply as that of the traditional static neural networks. Also learning algorithm for this kind of procedural neural network is proposed and a stock price prediction problem is given as a test example for this model.
Sharing information and building trust through value congruence
Authors: Joseph A. Cazier, Benjamin B. Shao, Robert D. Louis
Venue: Information Systems Frontiers (2007)

This study explores how value congruence contributes to the formation of trust in e-businesses, and how trust and value congruence influence consumers to share personal information. It is hypothesized that the perceived values of organizations regarding moral, social, environmental and political causes can have an effect on the trusting beliefs of e-commerce consumers and their willingness to disclose private personal information. A total of 775 subjects rated their perceived value congruence with organizations, their trusting beliefs, and the types of information they would be willing to disclose. This study finds that value congruence not only plays a role in mediating the trust of consumers for the organizations, but it also has a strong effect on determining their willingness to disclose personal information. In some cases, the influence of value congruence is greater than that of trust, even though trust has been touted in the literature as one of the most important factors in e-commerce. This research expands prior work by using structural equation modeling to test the relative strength of the effect of value congruence on each dimension of trust and the overall trust level, as well as its direct effect on behavioral intentions in terms of information sharing for non-profit and for-profit organizations.
A Novel Hierarchical Classification Scheme for Online Tamil Character Recognition
Authors: S. Sundaram, A. Ramakrishnan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper we propose a novel three level hierarchical classification scheme for online character recognition for Tamil, a classical Indian language. We make use of the prior knowledge of the writing rules of a Tamil character to build the first level of the classifier for which we outline two methods. The first method utilizes the quantized slope information while the other relies on the trajectory of pen motion for grouping. The number of strokes in the preprocessed character is used for classification at the second level while a k-Nearest Neighbor classifier is employed at the final level. The method that uses the trajectory of the pen motion information is not sensitive to the length of the character and therefore outperforms the method using quantized slope information at the first level of the classifier thereby leading to an increase in the final classification accuracy at the third level from 85% to 96%.
Fuzzy Integrative Performance Evaluation for Supply Chain System
Authors: Jianhua Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Based on the balanced scorecards proposed by Kaplan and Norton, it is developed in this paper the enhanced balanced scorecards and their novel application field regarding society environment and future development, which includes construction of performance evaluation index system from five aspects such as finance, customer service, intra flow process, learning and development, and society development within supply chain. Another original point of this paper is that the Logarithm Triangular Fuzzy Number- AHP method (LTFN--AHP) is creatively used to evaluate the integrative performance evaluation index system. This special AHP method can overcome some disadvantages that experts can directly give definite numbers when the traditional AHP method is used to value certainty and evaluate the qualitative index. More important, LTFN-AHP is a scientific qualitative and quantitative evaluation tool. Then the real cases are researched based on all discussions above.