ppxscal/embedding_network huggingface dataset:
A Model for Assured Software Download on Mobile Terminals
Authors: Serwah Sabetghadam, Mahdi Niamanesh, Javad Esmaeili
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Over-the-air (OTA) software download is a key enabling technology for terminal reconfigurations. With increasing the number of network protocols, variety of software products with different software providers and new software threats, it becomes important to download and install assured software on the mobile terminals. Most of the related research works on downloading assured software, focus on software validation after download, and mainly on the terminal. In this paper, a model is proposed in which an Assurance Agency is exploited. This agency is responsible for performing software examination and validations. Unlike related work, examination and validation operations are centrally performed in the network before downloading the software. Based on a cost analysis, it is shown that the overhead of using the assurance agency in downloading scenario is acceptable.
Multimedia Content Management - Provision of Validation and Personalization Services
Authors: Katherine Curtis, Oliver Draper
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

In the converging worlds of telecommunications, broadcasting and the internet, multimedia content management is a key factor in promoting efficient and effective delivery of end user services. This paper introduces some of the fundamental concepts of content management and describes the role that content metadata can play within the management system. Automation of routine content handling techniques is extremely important in order to maintain and update large scale interactive applications. We examine the requirements for two system components that will provide automatic personalisation and validation services. Prototype designs and implementations are presented as candidates for inclusion in a content management system.
A discriminator variety of Gödel algebras with operators arising in quantum computation
Authors: Roberto Giuntini, Hector Freytes, Antonio Ledda, Francesco Paoli
Venue: Fuzzy Sets and Systems (2009)

In order to appropriately model the strong quantum computational logic of Cattaneo et al., we introduce an expansion of ^' quasi-MV algebras by lattice operations and a Godel-like implication. We call the resulting algebras Godel quantum computational algebras, and we show that every such algebra arises as a pair algebra over a Heyting-Wajsberg algebra. After proving a standard completeness theorem, we prove that Godel quantum computational algebras form a discriminator variety and we point out some consequences thereof.
Stable, circulation-preserving, simplicial fluids
Authors: Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, Mathieu Desbrun
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Visual quality, low computational cost, and numerical stability are foremost goals in computer animation. An important ingredient in achieving these goals is the conservation of fundamental motion invariants. For example, rigid and deformable body simulation benefits greatly from conservation of linear and angular momenta. In the case of fluids, however, none of the current techniques focuses on conserving invariants, and consequently, they often introduce a visually disturbing numerical diffusion of vorticity. Visually just as important is the resolution of complex simulation domains. Doing so with regular (even if adaptive) grid techniques can be computationally delicate. In this paper, we propose a novel technique for the simulation of fluid flows. It is designed to respect the defining differential properties, i.e., the conservation of circulation along arbitrary loops as they are transported by the flow. Consequently, our method offers several new and desirable properties: arbitrary simplicial meshes (triangles in 2D, tetrahedra in 3D) can be used to define the fluid domain; the computations involved in the update procedure are efficient due to discrete operators with small support; and it preserves discrete circulation avoiding numerical diffusion of vorticity.
Analyzing privacy and security issues in the information age
Authors: Ji-Xuan Feng, Janet Hughes
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Associated with expanding using ICT across the global, there is more and more concern about privacy and security issues. Today, people find that their personal information is hard to protect. Results from a literature review, from a survey and from a case study all indicate a clear solution: the key is people. It is people who develop ICT, and people who decide the different ways that ICT is used. Therefore education about international law and ethics, and education to develop an understanding of cultural differences will provide a positive attitude to promote the improvement of the privacy and security situation in the information age. Finally, there is a discussion about how to establish a vibale security culture environment.
Overview of the computer architecture area
Authors: Wesley Chu
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

In the architecture area, the following six important topics are included: supercomputer systems, data base machine and issues on database management systems (DBMS) standards, intelligent memory, architecture for local area networks, network data access support technology, and survivability criterion for the distributed data processing (DPP) networks. 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
An Engineering Framework and Service Portal for the Integration of Cooperative Engineering Processes
Authors: Jai-Kyung Lee, Seong-Whan Park, Hyeon Soo Kim, Seung Hak Kuk
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

This paper presents an engineering framework and engineering service portal to support complex engineering design problems that consist of cooperative engineering processes. It aims at providing an integrated design environment to support the integration of personnel, design activities and engineering resources. The engineering framework automates and integrates various engineering processes that require huge amounts of information processing and problem solving, using the agent technology and a software wrapping method. The web-based engineering service portal provides a user interface for the engineering framework, and shares the results between engineers participating in the engineering design problems. To validate its usefulness, several industrial applications were applied to the framework. A performance analysis and shape modeling process of pump design is chosen as a case study.
Linear Properties of Zero-Safe Nets with Debit Tokens
Authors: Michael Köhler-Bußmeier, Manfred Kudlek
Venue: Fundamenta Informaticae (2008)

In this contribution we study an extension of zero-safe nets that allows to model cooperation scenarios. Since zero-safe nets cannot be represented as finite nets in general, we study an extension of the firing rule having a close connection to blind counter automatons and the theory of semi-flows. As a main result we obtain, that a representation can always be given as a finite P/T net - although our firing rule is an extension of the original one - i.e. it preserves all the events that have been allowed before.
Measuring knowledge management performance using a competitive perspective: An empirical study
Authors: Mu-Yen Chen, Mu-Jung Huang, Yu-Chen Cheng
Venue: Expert Systems with Applications: An International Journal (2009)

This paper proposes an approach of measuring a technology university's knowledge management (KM) performance from competitive perspective. The approach integrates analytical network process (ANP), which is a theory of multiple criteria decision-making and is good at dealing with tangible and intangible information, with balanced scorecard (BSC) that contains four perspectives, including customer perspective, internal business perspective, innovation and learning perspective, and financial perspective, being adopted as the indicators of KM performance measurement (KMPM). This paper makes three important contributions: (1) it propose a methodology of comparing an organization's knowledge management performance with its major rivals to offer effective information for improving KM, increasing decision-making quality, and obtaining clear effort direction of attaining competitive advantage; (2) it explores the case involving a lot of findings that present the positions of the case organization against it major rivals and imply that the technology university has to reinforce knowledge creation and accumulation to catch up with its competitive rivals; and (3) it is generic in nature and applicable to benefit an organization. The results prove the proposed method can act as a measurement tool for the entire KM of an organization.
Intelligent Vehicle Simulation and Debugging Environment Based on Physics Engine
Authors: Feng Luo, Chu Liu, Zechang Sun
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

In order to improve the development efficiency of the embedded intelligent vehicle system and replace the inefficient traditional embedded system debugging method, a simulation and debugging environment is developed for intelligent vehicles which are able to detect black tracks on white routes and realize fast automatic driving. OpenGL graphics engine is integrated in this system, which constructs simulated routes and vehicles, performs the whole scene and displays objects on the screen. ODE physics engine is introduced to the environment for the simulation of rigid body dynamics, and makes vehicle drive and interact with other scene objects. Algorithm and other user defined functions are compiled into an algorithm library on the PC and can be debugged directly by the simulation environment, which eases the code transplant process. By using this environment, it will be more convenient to guarantee the stability and robustness of the software of intelligent vehicles. In the meantime, high performance software code can be produced for precise steer control and safe driving, and the intelligent vehicles are able to run stably on any provided course at a high speed. Test results show that the intelligent vehicle simulation and debugging environment could actually improve the development efficiency and speed up the development progress significantly.
Bandwidth guaranteed routing with fast restoration against link and node failures
Authors: Randeep S. Bhatia, Murali Kodialam, T. V. Lakshman, Sudipta Sengupta
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

An important feature of MPLS networks is local restoration where detour paths are set-up a priori. The detour is such that failed links or nodes can be bypassed locally from the first node that is upstream from the failures. This local bypass activation from the first detection point for failures permits much faster recovery than end-to-end path based mechanisms that require failure information to propagate to the network edges. However, local restoration of bandwidth guaranteed connections can be expensive in the additional network capacity needed. Hence, it is important to minimize and share restoration capacity. The problem of routing with local restoration requirements has been studied previously in a dynamic on-line setting. However, there are no satisfactory algorithms for the problem of preprovisioning fast restorable connections when the aggregate traffic demands are known (as would be the case when a set of routers are to be interconnected over an optical network or for pre-provisioned ATM over MPLS overlays). The contribution of this paper is a fast combinatorial approximation algorithm for maximizing throughput when the routed traffic is required to be locally restorable. To the best of our knowledge, this is the first combinatorial algorithm for the problem with a performance guarantee. Our algorithm is a Fully Polynomial Time Approximation Scheme (FPTAS), i.e., for any given Ε > 0, it guarantees (1 + Ε)-factor closeness to the optimal solution, and runs in time polynomial in the network size and 1/Ε. We compare the throughput of locally restorable routing with that of unprotected routing and 1+1-dedicated path protection on actual US/European ISP topologies taken from the Rocketfuel project [14].
A modeling method based on CCS for workflow
Authors: Li Zhao, Qing Li, Xiaoli Liu, Nanshan Du
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

Workflow model is used to generate a computerized definition of a business process and help the designer to design, test and validate workflow process. Convenient for verification and optimization, formalized technologies on modeling receive large attentions for their strong theoretic bases. However, none of the existing methods can meet complicated requirements in current business environments. In this paper, we introduce a new modeling method based on the Calculus of Communicating Systems (CCS) to describe behaviors between processes in intricate workflows, by adding dependent constraints and parameters into activity expressions. We provide a specification language to establish a formal model and capture its relevant graphical model in succession. The modeling method is explicated through an example as a case study.
Formation of e-satisfaction and repurchase intention: Moderating roles of computer self-efficacy and computer anxiety
Authors: Heeseok Lee, Sue Young Choi, Young Sik Kang
Venue: Expert Systems with Applications: An International Journal (2009)

The exploration of online customer satisfaction (called e-satisfaction hereafter) and repurchase becomes increasingly important in e-commerce. Yet, the process of e-satisfaction and repurchase formation and the context under which this process may vary have not been investigated rigorously. In order to fill this knowledge gap, this paper attempts to develop a conceptual model to decipher how e-satisfaction is formed. Furthermore, it investigates how computer-related individual differences such as computer self-efficacy and computer anxiety moderate this formation. The analysis results from a survey of 274 online buyers confirm that our antecedents play key roles in forming e-satisfaction and repurchase and the proposed moderators are important.
Universally Composable RFID Identification and Authentication Protocols
Authors: Mike Burmester, Tri Van Le, Breno De Medeiros, Gene Tsudik
Venue: ACM Transactions on Information and System Security (TISSEC) (2009)

As the number of RFID applications grows, concerns about their security and privacy become greatly amplified. At the same time, the acutely restricted and cost-sensitive nature of RFID tags rules out simple reuse of traditional security/privacy solutions and calls for a new generation of extremely lightweight identification and authentication protocols. This article describes a universally composable security framework designed especially for RFID applications. We adopt RFID-specific setup, communication, and concurrency assumptions in a model that guarantees strong security, privacy, and availability properties. In particular, the framework supports modular deployment, which is most appropriate for ubiquitous applications. We also describe a set of simple, efficient, secure, and anonymous (untraceable) RFID identification and authentication protocols that instantiate the proposed framework. These protocols involve minimal interaction between tags and readers and place only a small computational load on the tag, and a light computational burden on the back-end server. We show that our protocols are provably secure within the proposed framework.
JPEG2000: A New Standard for Still Image Compression
Authors: Maryline Charrier
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

With the increasing use of multimedia technologies, image compression requires higher performance as well as new functionality. To address this need in the specific area of still image encoding, a new standard is currently being designed: JPEG2000. We will see in this paper what the exact goals are of this future standard, which applications it addresses and the current standardisation process. Then we will show through the descriptions of two available demonstrations what kind of results are already reachable with the current status of the standard. The first demonstration describes a JAVA implementation of the future standard, details the advantages of such an implementation and compares the performance of JPEG2000 with that of JPEG. The second demonstration describes how JPEG2000 can be used in domains were the transmission bandwidth is very restricted, taking advantages of new functions such as the definition of Regions Of Interest and progressive transmission.
Activity Based Links as a Ranking Factor in Semantic Desktop Search
Authors: Julien Gaugaz, Stefania Costache, Paul-Alexandru Chirita, Claudiu Firan, Wolfgang Nejdl
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

Existing desktop search systems, developed as a reaction to the rapidly increasing storage capacities of our hard disks, are an important step towards more efficient personal information management, yet they offer an incomplete solution. The industrial ones are capable of indexing a vast amount of file types, and the research prototypes can add very comprehensive metadata to increase recall. However, they all rely only on basic ranking techniques, as TFxIDF, which are comparable to the first generation of web search engines. In this paper we propose to connect semantically related desktop items by exploiting activity information about accesses to local resources. We investigate and evaluate in detail the possibilities to translate this information into a desktop linkage structure, and we propose several algorithms that exploit these newly created links in order to efficiently rank desktop items. Finally, we show that the ranking results based on the user activity links surpass both TFxIDF ranking scores, as well as the rankings generated using the schema based approaches we devised in our previous work.
A Fuzzy Estimation Theory for Available Operation of Extremely Complicated Large-Scale Network Systems
Authors: Kazuo Horiuchi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we shall describe about a fuzzy estimation theory based on the concept of set-valued operators, suitable for available operation of extremely complicated large-scale network systems. Fundamental conditions for availability of system behaviors of such network systems are clarified in a form of β-level fixed point theorem for system of fuzzy-set-valued operators. Here, the proof of this theorem is accomplished in a weak topology introduced into the Banach space.
Empowering decision support with simulation technology: scenario navigator
Authors: E. C. Valentin, R. A. Bijlsma, V. de Gast
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The commercial simulation environments that are available today focus primarily on the development of simulation models. They are designed for a single user. They provide animation during the simulation run and in most cases they provide outcomes of the simulation run in reports. Our experience in developing computer based simulation models with different commercial and noncommercial simulation software packages and found that these packages do not offer sufficient support in: performing experiments with large complex models, performing experiments with multiple users, managing experiment data and results, analyzing the experiment results and comparing them. The items that are summarized above are a necessity to bring simulation technology to a wider use. Simulation technology could be very well used as an operational decision support tool. In order to meet this demand we have developed Scenario Navigator, a client-server based application that allows multiple users to create, populate, run, analyze and compare experiments.
Queryll: Java database queries through bytecode rewriting
Authors: Ming-Yee Iu, Willy Zwaenepoel
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

When interfacing Java with other systems such as databases, programmers must often program in special interface languages like SQL. Code written in these languages often needs to be embedded in strings where they cannot be error-checked at compile-time, or the Java compiler needs to be altered to directly recognize code written in these languages. We have taken a different approach to adding database query facilities to Java. Bytecode rewriting allows us to add query facilities to Java whose correctness can be checked at compile-time but which don't require any changes to the Java language, Java compilers, Java VMs, or IDEs. Like traditional object-relational mapping tools, we provide Java libraries for accessing individual database entries as objects and navigating among them. To express a query though, a programmer simply writes code that takes a Collection representing the entire contents of a database, iterates over each entry like they would with a normal Collection, and choose the entries of interest. The query is fully valid Java code that, if executed, will read through an entire database and copy entries into Java objects where they will be inspected. Executing queries in this way is obviously inefficient, but we have a special bytecode rewriting tool that can decompile Java class files, identify queries in the bytecode, and rewrite the code to use SQL instead. The rewritten bytecode can then be run using any standard Java VM. Since queries use standard Java set manipulation syntax, Java programmers do not need to learn any new syntax. Our system is able to handle complex queries that make use of all the basic relational operations and exhibits performance comparable to that of hand-written SQL.