ppxscal/embedding_network huggingface dataset:
Numerical methods for the '80s
Authors: Roger Firestone
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

After more than a decade of emphasis on commercial applications, scientific computing is again emerging as an important area. This session will present two papers, one dealing with methods for making use of the new parallel architectures now being marketed, and the other presenting a language which makes matrix computations accessible to the scientist or casual programmer. The panel discussion will examine a number of issues of current concern in scientific computation and numerical analysis. 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
Improved Constant Storage Self-healing Key Distribution with Revocation in Wireless Sensor Network
Authors: Qingyu Xu, Mingxing He
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

Recently, Dutta et al. [1] proposes a constant storage self-healing key distribution with revocation in wireless sensor network. The advantage of [1] is that it requires constant storage of personal keys for each user. In this paper, we show that Dutta's scheme is insecure against the proposed attack, whereby users can access any other's secret keys and session keys which they should not know according to Dutta's scheme. Moreover, we proposed two kinds of improved schemes which are resistant to this kind of attack. The first scheme is unconditional secure and we analyze it in the security framework of [1]. The second scheme is in the model of computational secure. In the end, we analyze the second scheme and show that it is a self-healing key distribution scheme with revocation and achieves both forward and backward secrecy.
Towards a Highly Interactive Web Exploration of Spatial and Historical Aggregations from Data Marts
Authors: Sonia Fernandes Silva
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

With the recent advances in the area of WebGIS and Spatial OLAP, new approaches include geographical display and navigation during the explorative analysis of multidimensional data. Such geographical displays can be enriched with visual diagrams for effective data exploration for decision-making. Within this context, we developed a web tool which provides visual interaction with geo-referenced multidimensional data. The implementation of such tool is based on a new approach that puts together some existing techniques in the literature for data exploration and optimization. As a consequence, the tool enables the end-user to remotely create and explore several interactive visual reports of summarized data almost instantaneously. In this paper, we introduce this integrated approach and show its use for interactive web exploration of spatial and historical aggregations from data marts.
Admission Control and QoS Negotiations for Soft-Real Time Applications
Authors: Wonjun Lee, Bikash Sabata
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Systems are increasingly supporting a new class of multimedia applications that allow degradation of the application quality so that they use reduced amounts of resources. Management of such applications require new mechanisms to be developed for admission control, negotiation, allocation and scheduling. In this paper we present a new admission control algorithm that exploits the degradability property of applications to improve the performance of the system. The algorithm is based on setting aside a portion of the resources as reserves and managing it intelligently so that the total utility of the system is maximized.The mixed greedy and predictive strategy leads to an efficient protocol that also improves the performance of the system. We use the constructs of application benefit functions and resource demand functions in the integrated admission control and negotiation protocol. Extensive simulation experiments are presented in the paper to evaluate the performance of the novel mechanisms and compare it to some of the other methods used in the past.
Customer evaluation for order acceptance using a novel class of fuzzy methods based on TOPSIS
Authors: I. Chamodrakas, N. Alexopoulou, D. Martakos
Venue: Expert Systems with Applications: An International Journal (2009)

Customer evaluation plays an important role as a part of the order acceptance process of suppliers in optimally allocating resources and prioritizing orders accordingly. In this paper, a new class of fuzzy methods for evaluating customers is applied. Firstly, our approach tackles the issue of uncertainty that is inherent in the problem of customer evaluation that involves qualitative criteria by employing the method proposed by Yong [Yong, D. (2006). Plant location selection based on fuzzy TOPSIS. International Journal of Advanced Manufacturing Technology, 28(7-8), 839-844] in order to efficiently transform linguistic assessments of the weights of criteria and of the ratings of customers into crisp numbers. Secondly, the TOPSIS method is modified in order to integrate the behavioral pattern of the decision maker into its ''principle of compromise''. In this context, a new model for the aggregating function of TOPSIS that is based on a fuzzy set representation of the closeness to the ideal and the negative ideal solution is applied. In particular, we use the class of intersection connectives proposed by Yager [Yager, R. R. (1980). On a general class of fuzzy connectives. Fuzzy Sets and Systems, 4(3), 235-242] that enables a formal definition of the relation between the closeness to the ideal solution and the closeness to the negative ideal solution. Thus, a class of methods is formulated whose different instances correspond to different behavioral patterns of the decision makers, e.g. with preference to customers that make as much profit as possible but also avoid as much risk as possible or to customers that are performing well in at least one of the profit and risk criteria. A numerical example, illustrating the application of this class of methods to customer evaluation is given.
Four-Color Theorem and Level Set Methods for Watershed Segmentation
Authors: Erlend Hodneland, Xue-Cheng Tai, Hans-Hermann Gerdes
Venue: International Journal of Computer Vision (2009)

A marker-controlled and regularized watershed segmentation is proposed for cell segmentation. Only a few previous studies address the task of regularizing the obtained watershed lines from the traditional marker-controlled watershed segmentation. In the present formulation, the topographical distance function is applied in a level set formulation to perform the segmentation, and the regularization is easily accomplished by regularizing the level set functions. Based on the well-known Four-Color theorem, a mathematical model is developed for the proposed ideas. With this model, it is possible to segment any 2D image with arbitrary number of phases with as few as one or two level set functions. The algorithm has been tested on real 2D fluorescence microscopy images displaying rat cancer cells, and the algorithm has also been compared to a standard watershed segmentation as it is implemented in MATLAB. For a fixed set of markers and a set of challenging images, the comparison of these two methods shows that the present level set formulation performs better than a standard watershed segmentation.
Growth and characterisation of dilute antimonide nitride materials for long-wavelength applications
Authors: L. Buckle, S. D. Coomber, T. Ashley, P. H. Jefferson, D. Walker, T. D. Veal, C. F. McConville, P. A. Thomas
Venue: Microelectronics Journal (2009)

The addition of small amounts of nitrogen to III-V semiconductors leads to a large degree of band gap bowing, giving rise to band-gaps smaller than in the associated binary materials. The incorporation of active nitrogen has been previously demonstrated for InNxSb1-x (x≤0.7%) and GaNxSb1-x (x≤1.75%) material; however, the as-grown carrier concentrations precluded incorporation into a device structure. Here we report the reduction in the as-grown carrier concentration in InNSb by annealing, whilst retaining the active nitrogen content. FTIR absorption measurements show the first direct experimental evidence of narrowing of the InSb bandgap due to nitrogen incorporation. As an alternative route to defect reduction and device compatible material we report on the growth of Ga1-yInyNxSb 1-x with 0≤y≤30% and x=1.6±0.2% and demonstrate near lattice matching of the material to GaSb.
Fault tolerance by means of external monitoring of computer systems
Authors: Algirdas Avižienis
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

A frequently suggested solution to the problem of increasing the reliability of an already existing computer system (to be called the object machine [OM]) is to employ a functionally and physically separate monitor computer (to be called the monitor machine [MM]) that probes the operation of the OM in real time. The purpose of the monitoring is to assure that the functional performance of the OM does not deviate from the behavior specified by its design and by the programs being executed. This paper systematically assesses the architectural and fault-tolerance issues that have to be resolved to effectively implement the monitoring process. The goal of the implementation is to create an integrated and uniformly fault-tolerant OM/MM complex, beginning with a given OM design. Four principal problems are addressed in the subsequent sections: (1) implementation of the monitor machine; (2) implementation of the monitoring (OM/MM) interface; (3) specification of the monitoring function; and (4) the cost and effectiveness of monitoring. The paper concludes with examples of model technical specifications for the architectural properties needed by the OM and the MM to attain a fault-tolerant implementation of the monitoring process.
Iterated Belief Revision in the Face of Uncertain Communication
Authors: Yoshitaka Suzuki, Satoshi Tojo, Stijn Saeger
Venue: Declarative Agent Languages and Technologies VI: 6th International Workshop, DALT 2008, Estoril, Portugal, May 12, 2008, Revised Selected and Invited Papers (2008)

This paper offers a formalization of iterated belief revision for multiagent communication using the logic of communication graphs introduced in [15]. In this study we consider an agent (i.e., information source) capable of sending two types of message. In the first type, he tells that he knows a proposition, but in the second type, he tells that he believes a proposition. Consequently, iterated belief revision is brought about through a sequence of communication events (i.e., a history), and we propose a variation of the AGM rational postulates for history based belief revision. As we will show, a representation theorem is verified only for a class of restricted communication graphs. We consider this result to be a weak point in the application of the AGM postulates to multiagent communication, and propose a viable alternative.
An Adaptive Multi-agent Routing Algorithm Combining AntNet and Interconnected Learning Automata
Authors: Z. Farhadpour, M. R. Meybodi
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Learning Automata (LA) is an abstract model which can be used to guide action selection at any stage of a system by past actions and environment responses to improve some overall performance function. The use of intelligent algorithms based on learning automata can be efficient for traffic control. However, these learning schemes have been focused only to unimodal routing problem in connection oriented networks. The field of Ant Colony Optimization (ACO) models real ant colony behavior using artificial ant algorithms and find its application in a whole range of optimization problems. Ant algorithms experimentally prove to work very well in static and dynamic optimization problems and match perfectly with some model of interconnected LA. In this paper, an adaptive multi-agent routing algorithm called LA-AntNet is proposed for both source and non-source routing in communication networks. In this algorithm, mobile ant agents form AntNet routing system (Dicaro & Dorigo 1998) are combined to a system of static distributed LA agents, statically connected to the network nodes and directly responsible for routing decisions. The mobile ant agents improve local decisions of LA and adapt it with network conditions by moving over the network and colleting information about traffic distribution. In this algorithm the decision policy of LA is modified to involve a heuristic parameter which is a suggestion coming from ACO field and can guide learning process and improve convergence results. The proposed algorithm is implemented on several topologies to obtain performance metrics namely, throughput and total delay. The results are compared to the ones obtained from AntNet and a learning automata technique .
An algorithm for constructing mixed-level k-circulant supersaturated designs
Authors: Min-Qian Liu, Li Zhang
Venue: Computational Statistics Data Analysis (2009)

Supersaturated design (SSD) has received much interest because of its potential in factor screening experiments. Recently, Chen and Liu [Chen, J., Liu, M.Q., 2008a. Optimal mixed-level k-circulant supersaturated designs. J. Statist. Plann. Inference 138, 4151-4157] explored the construction of E(f"""N"""O"""D)-optimal mixed-level SSDs using k-cyclic generators. As an extension, this paper further studies how to construct optimal mixed-level k-circulant SSDs under the @g^2(D) criterion. A sufficient condition under which the generator vector produces a @g^2(D)-optimal SSD is obtained, and some other properties of the resulting SSDs are investigated. Note that, the construction of optimal mixed-level k-circulant SSDs under the @g^2(D) criterion is much more complicated than that under E(f"""N"""O"""D). Hence, an algorithm for finding generators of (nearly) @g^2(D)-optimal designs is provided, and many (nearly) @g^2(D)-optimal mixed-level SSDs are then constructed.
Mapping Bitemporal XML Data Model to XML Document
Authors: Na Tang, Yong Tang
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

XML documents will be modified as time goes by. The successive versions of an XML document are expressed by temporal XML document in an incremental fashion, which provides us a high effective method for version management, so the topics of representing, querying and updating temporal XML documents have been received increasing attention. This paper presents an XML data model for tracking historical information in an XML document. This model can present the temporally ungrouped information. Two different ways of mapping this model to a (bitemporal) XML document are discussed and compared in the paper.
A systems engineering process supporting the development of operational requirements driven federations
Authors: Andreas Tolk, Thomas G. Litwin, Robert H. Kewley
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper proposes a systems engineering process utilizing the conceptual artifacts of the Model Driven Architecture (MDA) describing platform independent views of models to capture operational requirements, to derive essential tasks, and to combine these tasks into scenarios and vignettes with attributed metrics. This model-independent mission description is then used to identify supporting simulation services that implement the identified military means and capabilities to perform the tasks in the given context. Once the services are identified, the necessary simulation middleware to federate the services is identified and the interfaces are configured using the technical artifacts of the MDA describing platform specific views of systems. This systems engineering process provided support for simulation development for the US Army's Program Executive Office -- Soldier.
Curriculum reform for accommodating multi-core technology in Shantou University
Authors: T. John Koo, Zhi Xiong, Jianqin Qu
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

Multi-core technology is revolutionizing the the development of concurrent and computational intensive applications deemed impossible in the recent past. Due to the breath and depth of the impacts introduced by the technology, computing education in China is facing unprecedented challenges. The objective of this paper is to address the current education challenges in accommodating multi-core technology in the core curriculum of the Department of Computer Science in Shantou University, for educating future generations of engineers for the rapidly evolving multi-core industry.
Design Improvement for Tor against Low-Cost Traffic Attack and Low-Resource Routing Attack
Authors: Liu Xin, Wang Neng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Tor is the second generation Onion Router, supporting the anonymous transport of TCP streams over the Internet. Its low latency makes it very suitable for common Internet communication applications. So Tor has become the most successful public anonymity communication service in the Internet. In this paper, we investigate Tor design weaknesses. An adversary can use these weaknesses to attack Tor network such as low-cost traffic attack, low-resource routing attack and so on. Based on the investigation we propose tuning mechanisms to overcome the above-mentioned problems. The tuning mechanisms include establishing evaluation system and optimizing Tor node store and output mode. In addition we also present a theoretical analysis to the tuning mechanisms in terms of anonymity and performance. Through our theoretical analysis, we think with our tuning mechanisms, we can promote Tor network anonymity dramatically, and promote Tor network overall performance to the extent.
Direct adaptive neural control for affine nonlinear systems
Authors: Indrani Kar, Laxmidhar Behera
Venue: Applied Soft Computing (2009)

This paper presents a direct adaptive neural control scheme for a class of affine nonlinear systems which are exactly input-output linearizable by nonlinear state feedback. For single-input-single-output (SISO) systems of the form x@?=f(x)+g(x)u, the control problem is comprehensively solved when both f(x) and g(x) are unknown. In this case, the control input comprises two terms. One is an adaptive feedback linearization term and the other one is a sliding mode term. The weight update laws for two neural networks, which approximate f(x) and g(x), have been derived to make the closed loop system Lyapunov stable. It is also shown that a similar control approach can be applied for a class of multi-input-multi-output (MIMO) systems whose structure is formulated in this paper. Simulation results for both SISO- and MIMO-type nonlinear systems have been presented to validate the theoretical formulations.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network, Enhanced (Networking (Course Technology)), 1 edition
Authors: Jason Eckert, M. John Schitka, Brian T. McCann
Venue:  (2008)

This full-color hands-on guide book has been enhanced to make learning even easier by offering more detailed lab setup instructions, expanded chapter summaries, and new practice exams that will reinforce the skills learned.
Application-Level QoS: Improving Video Conferencing Quality through Sending the Best Packet Next
Authors: Ian McDonald, Richard Nelson
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

In a traditional network stack, data from an application is transmitted in the order that it is received. An algorithm is proposed where information about the priority of packets and expiry times is used by the transport layer to reorder or discard packets at the time of transmission to optimise the use of available bandwidth. This can be used for video conferencing to prioritise important data. This scheme is implemented and compared to unmodified Datagram Congestion Control Protocol (DCCP). This algorithm is implemented as an interface to DCCP and tested using traffic modelled on video conferencing software. The results show improvement can be made to video conferencing during periods of congestion - substantially more audio packets arrive on time with the algorithm, which leads to higher quality video conferencing. In many cases video packet arrival rate also increases and adopting the algorithm gives improvements to video conferencing that are better than using unmodified queuing for DCCP. The algorithm proposed is implemented on the server only, so benefits can be obtained on the client without changes being required to the client.
Context-aware multimedia streaming service for smart home
Authors: Chin-Feng Lai, Yueh-Min Huang
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This paper presents a context-aware multimedia seamless streaming system where the context is transmitted by a Zigbee-based sensor network. In the system, we employ Open Systems Gateway Initiative (OSGi) framework to provide the communication service of DLNA and Zigbee devices. By the system, a user's preferences for the multimedia service, such as media title, audio volume, video brightness/contrast and time stamp, will be carried by the Zigbee network to enable the identical atmosphere at where the user roamed. The DLNA player retrieves the media and plays out based on those preferences. The system aims at providing an identical seamless multimedia streaming service in a future smart home.
Simulation and Analysis of Electrical Discharge Machine Based on Virtual Prototype
Authors: Xiaobo Lou, Baorong Qin, Chun Zheng
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

In this study the working principle and characteristics of electrical discharge machining was introduced and in order to resolve the kinematic and dynamic research problems. The part simulation method was used by means of ADAMS based on the virtual prototype technique. The data has been changed by using Mechpro. The virtual prototype model was set up. The kinetic and dynamic simulation was conducted analytically and was verified by simulation in ADAMS. The analysis was done for different parts and as a result the velocity, acceleration, force and displacement of gantry and slide carriage were obtained. The results are according with the real conditions which means that the virtual prototype model is reasonable and the simulation is believable. Results achieved from aforementioned analysis can be used in finite element analysis, fatigue life calculation and optimization of these components.
The wind turbine
Authors: José De Jesús Rubio Avila, Andrés Ferreira Ramírez, Genaro Deloera Flores, Martín Salazar Pereyra, Fernando Baruch Santillanes Posada
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper we present the modeling of a wing turbine, using the Euler Lagrange method and circuits theory. We get the mathematical equation (modeling) that describes the wind turbine and we simulate it using the mathlab program.