ppxscal/embedding_network huggingface dataset:
Implementation of Mechanisms for Concurrent 3D Design and Visualization
Authors: David Sánchez Crespillo, Antonio Francisco Bennasar Obrador
Venue: Proceedings of the International Conference on Information Visualisation (2000)

To perform 3D editing in a cooperative environment presents problems that do not exist in other environments. To maintain the consistency among all the replicated instances of the scene being edited is the key problem. In this paper, we present the mechanisms to solve these problems such as collaborative operations on multiple scenes, cooperative copy and paste operations, and the ability of reversing actions (undo) in a cooperative editing environment. A brief introduction to a cooperative 3D editing and visualization tool is presented. The protocol to ensure its memory consistency is discussed. The data structures, as well as the techniques used to manipulate the data to realize the mechanisms are described.
Development of a Systems Architecting Process for Computer Based Systems
Authors: David Rowe, John Leaney, David Lowe
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The need to address system architecture within the computer systems development process is well accepted. Despite this, the process of architecting is still not well understood. In this paper we discuss the need for an architecting process which goes beyond specific architecting methods in order to address issues such as architecture evaluation and tailoring of architectures to specific system requirements. Based on these needs we propose an architecting process which selects from existing methods, bases and performance indices to produce a verifiable architecture. This process provides a framework within which we can develop an architecture which has the maximum (measurable) likelihood of satisfying both functional and nonfunctional system requirements upon implementation.
STRUCTURED AUTOMATIC DIFFERENTIATION
Authors: ARUN VERMA
Venue:  (1998)

Differentiation is one of the fundamental problems in numerical mathemetics. The solution of many optimization problems and other applications require knowledge of the gradient, the Jacobian matrix, or the Hessian matrix of a given function. Many large scale optimization applications (e.g., inverse problems) are very complex in nature. It becomes impractical to consider the function evaluation of such problems as a ``black-box'''' function, since the computation is structured in some manner, going through a set of defined structured steps, i.e., problem structure. It pays to expose the problem structure in the computation to be able to compute the derivatives efficiently thus making the solution procedure practical. Automatic differentiation (AD) can compute fast and accurate derivatives of any degree computationally via propagating Taylor series coefficients using the chain rule. AD doesn''t incur any truncation error and to compute the derivatives efficiently thus making the problem solution practical. would yield exact results if the calculations were done in real arithmetic; in other words the derivatives obtained are accurate to machine precision. This thesis is concerned with the efficient application of AD to large (and complex) optimization problems. The major theme is the structure exploitation of the user problem. We present methodologies which allow AD to exploit problem structure. An important idea is the exploitation of sparsity in the Jacobian matrices: We present a scheme which combines the forward and reverse modes of AD. Problem structure can be viewed in many different ways; one way is to look at the granularity of the operations involved. For example, differentiation carried out at the matrix-vector operations can lead to great savings in the time as well as space requirements. Figuring out the {\em kind} of computation is another way to view structure, e.g., partially separable or composite functions whose structur e can be exploited to get performance gains. In this thesis we develop a general structure framework which can be viewed hierarchically and allows for structure exploitation at various levels. For example, for time integration schemes employing stencils it is possible to exploit structure at both the stencil level and the timestep level. We also present some advanced structure exploitation ideas, e.g., parallelism in structured computations and using structure in implicit computations. The use of AD as a derivative computing engine naturally automates all the methodologies presented in this work -we present ways to make the design of numerical optimization software very transparent, and the presentation of problems by the user as easy as possible.
Towards deception in agents
Authors: Derrick Ward, Henry Hexmoor
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We have implemented a test-bed with agents who collaborate and communicate, potentially with deceptive information. Agents range from benevolent to selfish. They also have differing trustworthiness levels. Deception handling can vary from agents with mood swings about being deceived, to agents who react minimally to being deceived. We show the effects of different trustworthiness values in different scenarios on group performance. Our agents are designed in BDI paradigm and implement a possible-world semantics.
Characterization of multispecies living ecosystems with cellular automata
Authors: Xin-She Yang
Venue: Proceedings of the eighth international conference on Artificial life (2002)

A multispecies artificial ecosystem is formulated using cellular automata with species interactions and food chain hierarchy. The constructed finite state automaton can simulate the complexity and self-organized characteristics of the evolving multispecies living ecosystems. Simulations show that a small perturbation or extinction event may affect many other species in the ecosystem in an avalanche manner. Both the avalanches and the extinction arising from these changes follow a power law, reflecting that the multispecies living ecosytems have the characteristics of self-organized criticality.
Matrix form of a multi-queue problem
Authors: Paola Favati, G. Lotti, Ornella Menchi
Venue:  (1998)

In this paper we consider the common Markov chain problem of evaluating the queue length distribution of a quite general multi-queue system with $s$ waiting lines and one server. A finite approximation of the problem is considered by limiting the total length of the queues, obtaining a system with a block coefficient matrix in block upper Hessenberg form. TEL:: 050593448 EMAIL:: favati@imc.pi.cnr.it
Complete arcs arising from conics
Authors: Gábor Korchmáros, Angelo Sonnino
Venue: Discrete Mathematics (2003)

A new proof will be given for the following result originally stated in (Rend. Cl. Sci. Fis. Mat. Natur. (8) 56 (1974) 541): Let K be a complete k-arc in PG(2,q), q odd, containing (q+3)/2 points from an irreducible conic C of PG(2,q). If (q+ 1)/2 is a prime, then K contains at most four points outside C If q2 ≡ 1 (mod 16), then this number can be at most two.
General Overview of a Dialogue System''s
Authors: Giacomo Ferrari, Irina Prodanof, Michele Carenini
Venue:  (1991)

In this paper an overview of the functions necessary for a demonstrator to be developed within the frame of IDEAL are described. The main point such a demonstrator is expected to make clear, is that an explanation system is a strongly knowledge-based system, where knowledge about the domain (task) to be taught and about the way how it is to be taught shall strictly interact. The most complex technical difficulty is the interaction between the general teaching loop and the local question-answer cycle. In fact, a local loop may cause interruptions, revisions, or, even, cancellation of the general (dominating) loop. TEL:: +39 50 560481
A New Approach Based on Mobile Agents to Network Fault Detection
Authors: Puhan Zhang, Yufang Sun
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

As networks become larger and more complex, the need for advanced fault management capabilities becomes critical.Faults are unavoidable in large and complex communication networks, but quick detection and identification can significantly improve network reliability.Packet monitoring has become a standard technique in Network fault detection, but when applied to a large-scale Network yields a high volume of packets.To overcome thisProblem, some techniques are proposed.However, the Proposed techniques are based on popular SNMP agent, RMON technology, which are characterized by centralization, they do not provide strong scalability and local processingability.In this paper, we present an intelligent mobileagent-based approach to deal with the problem of network fault detection and implemented it by using java technology and aglet which is a mobile agent system from IBM.Experiment results show theproposed approach is very effective in network faultdetection.
Unification and extension of weighted finite automata applicable to image compression
Authors: Zhuhan Jiang, Olivier de Vel, Bruce Litow
Venue: Theoretical Computer Science (2003)

Weighted finite automata (WFA), including the linear WFA due to Culik and Kari and the acyclic WFA due to Hafner, have been under investigation over the years for their applications to image compression. We shall in this work first examine in great details the underlying WFA structure and propose the most systematic extension, along with its full legitimacy analysis, to the WFA that are applicable to image compression. A new mechanism based on the concept of resolution-wise and resolution-driven image mappings is developed to create rich families of legitimate similarity images so as to reduce the overall WFA size, a property that is critically related the performance of WFA-based compression codecs. Moreover, we shall also unify the relevant WFA by showing an acyclic WFA can always be merged into a linear WFA but not vice versa.
A Practical Attribute Grammar Circularity Test
Authors: Matthew Belmonte
Venue:  (1988)

Efficient implementations for two optimisations to Knuth''s attribute grammar circularity test are described. A new method for eliminating useless visits to productions is introduced. This improves upon a somewhat weaker mechanism introduced previously by Deransart et. al. Data structures and algorithms for graph covering and elimination of redundant unions are discussed and proven correct. 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
Managing eBusiness on Demand SLA Contracts in Business Terms Using the Cross-SLA Execution Manager SAM
Authors: Melissa Buco, Rong Chang, Laura Luan, Chris Ward, Joel Wolf, Philip Yu, Tevfik Kosar, Syed Umair Shah
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

It is imperative for a competitive e-business service provider to be positioned to manage theexecution of its service level agreement (SLA) contracts in business terms (e.g., minimizing financial penalties for service-level violations, maximizing service-level measurement based customer satisfaction metrics). This paper briefly describes the design rationale of an integrated set of business-oriented service level management (SLM) technologies under development in the SAM project at IBM T.J. Watson Research Center. The e-business SLA execution manager SAM, (1) enables the provider to deploy an effective means of capturingand managing contractual SLA data as well as provider-facing non-contractual SLM data; (2)assists service personnel to prioritize the processing of action-demanding quality management alerts as per the provider's SLM objectives; and (3) automates the prioritization and execution management of approved SLM processes on behalf of the provider, including assigning SLM tasks to service personnel.
Coordinated Flows in a Formal Multi-Agent System Based on a Modal Algebra
Authors: Panos A. Patsouris
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

We develop a formal multi-agent system based on a modal algebra enabling us to preserve the essential characteristics of its autonomous software agents (autonomy, mobility, etc.), as well as to explore the formal properties and management of the cooperation (non-hierarchical or flat structures) and coordination (hierarchical structures) among those simple agents, that can be constructed through the operations of the model.We show the potential of these operations that allow us to construct different cooperation and coordination based on the same set of autonomous agents (as alternative solutions with respect to the same given problem), while, in parallel we provide the means in order to explicitly specify different types of coordinated flows of information specified and governed by these structures.We illustrate all the above via a number of algorithms referring to the development of a simple (in structure) data mining system. We simply selected an adequate application area with no purpose to compare data mining methods and techniques. The various algorithmic solutions we suggest, unveil the resilience of the alternative design approaches aiming at improving issues like decentralization of services, as well as enhancing performance through concurrent organization by thus exploiting the different possibilities of the model.
Circuit Design for Wireless Communications: Improved Techniques for Image Rejection in Wideband Quadrature Receivers (International Series in Engineering and Computer Science)
Authors: Kong-Pang Pun, Carlos Azeredo-Leme, Jose Epifanio da Franca
Venue:  (2003)

:Circuit Design for Wireless Communications: Improved Techniques for Image Rejection in Wideband Quadrature Receivers serves as a very useful reference for wireless design engineers who want to improve the image rejection of their wireless receivers and researchers and students who are interested in this subject.
Automated Compilation of Concurrent Programs into Self-Timed Circuits
Authors: Steven M. Burns
Venue:  (1988)

No abstract available.
DIOGENES
Authors: CIRCA 1986, L A Rosenberg
Venue:  (1986)

The DIOGENES methodology produces design for fault-tolerant VLSI processor arrays in two stages: first, the desired array is viewed as an undirected graph and is {\em embedded in a book}; then, the book embedding is converted to an efficient fault-tolerant layout of the array. We survey here work on both stages of the methodology, highlighting recent progress and pointing out remaining challenges.
Computer-Based Animation of a Multi-Legged Articulated Body
Venue: Proceedings of the International Conference on Information Visualisation (2000)

A methodology for modeling quadruped gaits and gait transitions based on Fourier series analysis of horse movement is proposed. The resultant model is used to create animated locomotion sequences of a quadruped changing gait. The dynamic similarity hypothesis is used as a method for comparing the gaits of different animals.The fields investigated to provide the background of this work are Animation, Gait Research, Data Gathering and Simulation. From these the methodology has been used to define a generic rotoscoped model for movement, which although developed from horse movement data, could be equally applied to any other quadruped.Key ideas from biomechanics and gait research have been incorporated into the gait and gait transition models. Different gaits have fundamentally different leg movement patterns, so locomotion models which models different gaits must take into account the synchronization between the legs during locomotion. Additionally any methodology used to simulate the transition between gaits must take into account the phase differences between the legs when simulation a gait transition. Animation provides techniques to model the visual motion of a multi-legged figure moving using a number of different gaits; the gait model determines the control of movement. 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
A Realistic Commercially Robust Process for the Development of Object-Oriented Software
Authors: Timothy Korson
Venue: Proceedings of the 5th International Conference on Engineering of Complex Computer Systems (1999)

The successful use of object technology requires far more than simply the adaptation of UML, Java, CORBA, or Active X. It is crucial to understand the process of how to use these notations and technologies to build commercially robust software systems. In this session the speaker draws from his experience at NASA, NORTEL, AT&T, IBM, and other leading companies to illustrate the pitfalls and best practices of the process of OO software development. Attendees walk through the complete development process from use case development to pattern application and coding. Participants gain a clear understanding of the distinction between domain models, application models, and architectures. The course goes beyond notation and cookbook methods to address the key principles of Object-Oriented Software Development. A percentage of the time is spent discussing the rationale underlying each step of the process so that engineering concepts behind the specific techniques is presented. Several case studies are woven through the presentation."
A traffic oriented pre-arbitrated slot reuse scheme in DQDB networks
Authors: Yibin Yang, Ming T. Liu
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Distributed queue dual bus (DQDB) networks are high speed metropolitan area networks specified by the IEEE 802.6 standard. They may serve as local subnetworks to gather high speed data for transmission over wide area B-ISDN networks or as backbones in mobile networks to connect wireless infrastructures. In these situations, DQDB networks will carry a predominant portion of isochronous traffic. Thus we are motivated to investigate how to efficiently support isochronous traffic via the pre-arbitrated (PA) access method in DQDB networks. We propose a new PA slot reuse scheme which can much improve DQDB networks' utilization via arranging isochronous connections to share octets in PA slots. It is based on the idea of categorizing octets with octet types. A related problem of octet type selection is formulated and an algorithm is developed to solve the problem. Based on the algorithm's results, the proposed scheme is made efficient as well as traffic-oriented. Simulations are performed to show that the scheme is much better than the previous ones, in terms of utilization, drop rate and overhead. The new scheme is compatible with the current DQDB standard and can be implemented in the bandwidth manager and VCI server of a DQDB network.
Music Databases: Indexing Techniques and Implementation
Authors: T.-C. Chou, A. L. P. Chen, C.-C. Liu
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

In this paper, the music database with the search-by- content ability is studied. The chords are used to represent music. With the chord-representation model, the input fault tolerance ability is equipped. PAT-tree is proposed as the index structure. The "unstructured search" is an important characteristic of PAT-tree. We have implemented a music database system based on the chord-representation model and PAT-tree index structure. chords are
Intelligent Agent-Based Operations Management
Authors: Sophie D'Amours
Venue:  (2003)

:Knowledge-based and intelligent agent-based systems can now be applied to operations management. The contributions here demonstrate the range of application of these methods to practical industrial problems. These include the use, in product modeling, of a concurrent engineering approach in new product development, the formalization of knowledge and product information in intelligent systems, and the classification of configuration modeling requirements for industrial product through generic modeling and configuration. In process modeling, information and knowledge management is applied to the building construction industry; while in organization modeling it is applied to the management and control of distributed systems, real-time distributed control systems and scheduling problems. This title will be relevant to business-process reengineering teams, business analysts, quality management teams, continuous improvement analysts, and HR analysts and designers.
Intrabody Buses for Data and Power
Authors: E. Rehmi Post, Matt Reynolds, Matthew Gray, Joe Paradiso, Neil Gershenfeld
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

While wearable computers are empowering fashion accessories, they bring with them a tangle of wires which connect their parts. As these subsystems be- gin to decouple and operate on less power, it becomes possible to wirelessly distribute their required data and power using to the wearer's body. We have demon- strated systems that transmit and receive both data and power, and are working to combine the two.
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments
Authors: G. C. Buttazzo, F. Sensini
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

In this paper we present a new scheduling approach for servicing soft aperiodic requests in a hard real-time environment, where a set of hard periodic tasks is scheduled using the Earliest Deadline First algorithm. The main characteristic of the proposed algorithm is that it achieves full processor utilization and optimal aperiodic responsiveness, still guaranteeing the execution of the periodic tasks. Another interesting feature of the algorithm is that it can easily be tuned to change its performance and complexity according to the application requirements. Schedulability issues, performance results, and implementation complexity of the algorithm are discussed and compared with other classical methods, such as Background, the Total Bandwidth Sewer (TBS), and the optimal EDL server. Extensive simulations show that a substantial improvement can be achieved with a little increase of complexity, ranging from the TBS performance up to the optimal behavior.
On Polynomial Time Isomorphism of Complete Sets
Authors: L. Berman, Juris Hartmanis
Venue:  (1976)

IN this note we show that the recently discovered NP complete sets arising in number theory, the PTAPE complete sets arising in game theory and EXPTAPE complete sets arising from algebraic word problems are polynomial time isomorphic to the previously known complete sets in the corresponding categories.
Defect Content Estimation for Two Reviewers
Authors: Hakan Petersson, Claes Wohlin, Per Runeson, M. Höst
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Estimation of the defect content is important to enable quality control throughout the software development process.Capture-recapture methods and curve fitting methods have been suggested as tools to estimate the defect content after a review.The methods are highly reliant on the quality of the data.If the number of reviewers is fairly small, it becomesdifficult or even impossible to get reliable estimates.This paper presents a comprehensive study of estimates based on two reviewers, using real data from reviews.Three experience-based defect content estimation methods are evaluated vs. methods that use data only from the current review.Some models are possible to distinguish from each other in terms of statistical significance.In order to gain an even better understanding, the best models are compared subjectively.It is concluded that the experience-based methods provide some good opportunities to estimate the defect content after a review.