the changes in the temperature and density of powder metallurgical (P/M) parts during a sintering operation inside a continuous belt furnace were analyzed. the analysis of the P/M parts was done using LINEMOD TM a new...
详细信息
ISBN:
(纸本)0871707276
the changes in the temperature and density of powder metallurgical (P/M) parts during a sintering operation inside a continuous belt furnace were analyzed. the analysis of the P/M parts was done using LINEMOD TM a new generation supervisory control system. LINEMOD TM supervisory control software used mathematical models for off-line simulation and on-line control. the system was found to be a multi-tasking, and multi-user software system capable of product tracking, communication, mathematical modeling, adaptive learning, data collection, charge scheduling, and report generation.
the proceedings contain 26 papers. the topics discussed include: evolutionary approaches with multirecombination for the parallel machine scheduling problem;multiplicity and local search in evolutionary algorithms to ...
ISBN:
(纸本)0769508103
the proceedings contain 26 papers. the topics discussed include: evolutionary approaches with multirecombination for the parallel machine scheduling problem;multiplicity and local search in evolutionary algorithms to build the Pareto front;TAOS: a task-and-action oriented framework for user's task analysis in the context of human-computer interfaces design;evolving a legacy data warehouse system to an object-oriented architecture;materialized views in data warehousing environments;building databases with information extracted from web documents;a dynamic virtual fragmentation method for query recovery optimization;a temporal database management system implemented on top of a conventional database;testing an implementation of a temporal logic language;cooperative learning on autonomous agents acquiring common language for action and perception;a para-consistent system of autonomous agents for Brazilian bank check treatment;a dynamic associative semantic model for natural language processing based on a spreading activation network;an integral software process formal model based on the SOCCA approach;and network programming internals of the Dillo web browser.
Dye-doped semiconducting polymers are used as active layer in polymer light-emitting diodes (LEDs). the emission color can be tuned by doping the active polymer with certain dyes. this concept of energy transfer is de...
详细信息
Dye-doped semiconducting polymers are used as active layer in polymer light-emitting diodes (LEDs). the emission color can be tuned by doping the active polymer with certain dyes. this concept of energy transfer is demonstrated for a green matrix doped with a red emitting dye, suitable for use in LEDs. An absolute PL efficiency of 39% is observed for this system. Another very attractive development is taking place in the area of all-polymer transistors. this may lead to a (partial) replacement of the driving electronics by all-plastic circuits. A new precursor route toward poly(thienylene vinylene)s (PTVs), suitable as active material in all-polymer integrated circuits, is presented. Synthesis of the precursors is reproducible and fast, and can readily be upscaled. Quantitative conversion of the precursor polymer can be accomplished by heating at 150 °C for 20 minutes. the resulting mobility (4 × 10-3 cm2/Vs) and ON-OFF ratio (4 × 104) makes this material a suitable candidate for the development and large scale manufacturing of all-polymer integrated circuits.
Although several object-oriented distributed systems development tools exist, there is little, if no offer of solutions that homogeneously integrate all aspects of a distributed system. this article describes a toolki...
详细信息
Although several object-oriented distributed systems development tools exist, there is little, if no offer of solutions that homogeneously integrate all aspects of a distributed system. this article describes a toolkit that aims at supporting the construction and the execution of distributed systems. the tools are defined according to an architecture that fully complies with object-oriented principles, providing software developers with a relatively simple, yet effective and efficient, platform that makes the main difficulties normally found in distributed systems development transparent. Among those difficulties, it is the notorious impedance mismatch between the programming language and the object manipulation language. Such difficulty is not noticed in the toolkit presented. Moreover, all the benefits from object orientation are deeply exploited. For this reason, the toolkit permits fast development of distributed systems.
the proceedings contain 20 papers. the special focus in this conference is on Model Checking and Software Verification. the topics include: Using garbage collection in model checking;model checking based on simultaneo...
ISBN:
(纸本)3540410309
the proceedings contain 20 papers. the special focus in this conference is on Model Checking and Software Verification. the topics include: Using garbage collection in model checking;model checking based on simultaneous reachability analysis;verification and optimization of a plc control schedule;modelingthe ASCB-D synchronization algorithm with spin;a symbolic model checker for Boolean programs;interaction abstraction for compositional finite state systems;towards verification in hierarchical system development;abstraction of communication channels in promela;a language framework for expressing checkable properties of dynamic software;model-checking multi-threaded distributed java programs;using runtime analysis to guide model checking of java programs;communication topology analysis for concurrent programs;the temporal rover and the ATG rover and runtime checking of multithreaded applications with visual threads.
this paper presents a formal design for a novel group multicast service that provides virtually synchronous semantics in asynchronous fault-prone environments. the design employs a client-server architecture in which ...
详细信息
this paper presents a formal design for a novel group multicast service that provides virtually synchronous semantics in asynchronous fault-prone environments. the design employs a client-server architecture in which group membership is maintained not by every process but only by dedicated membership servers, while virtually synchronous group multicast is implemented by service end-points running at the clients. Specifically, the paper defines service semantics for the client-server interface, that is, for the group membership service. the paper then specifies virtually synchronous semantics for the new group multicast service, as a collection of commonly used safety and liveness properties. Finally, the paper presents new algorithms that use the defined group membership service to implement the specified properties. the algorithm that provides the complete virtually synchronous semantics executes in a single message round in parallel withthe membership service's agreement on views, and is therefore more efficient than previously suggested algorithms providing such semantics.
We introduce an object-oriented approach to transform a star-schema of a legacy data warehouse system into a Dimensional Object Model (DOM) (Firestone, 1998), in order to take advantage of the flexibility of the objec...
详细信息
We introduce an object-oriented approach to transform a star-schema of a legacy data warehouse system into a Dimensional Object Model (DOM) (Firestone, 1998), in order to take advantage of the flexibility of the object paradigm. We have applied the Object-Oriented Software Engineering (OOSE) process, proposed by (Jacobson et al., 1992), to describe the life cycle of a data warehouse and to clarify the context of our intervention. By means of OOSE we also define the target architecture and the components that will ensure the development of reuse-supporting data warehouse systems. In a sense, a change tolerant architecture is proposed, as referred to by (Jacobson, 1998). the solution proposed applies the object paradigm for the star-schema decomposition in a three-layer architecture, separating the components in logical, interface and data management layers. this decomposition minimizes the dependence among the components and increases their reusability. the main contribution of this work is that, by transforming the star-schema into a DOM, we are preparing the system to evolve through any object-oriented data warehouse development methodology. In a context of many already existing data warehouse systems based on relational models, this transformation sounds especially interesting.
the time consumed during the execution of queries in a parallel and distributed environment is highly affected by the form in which the tables comprising a database have been fragmented. the classical methods of fragm...
详细信息
the time consumed during the execution of queries in a parallel and distributed environment is highly affected by the form in which the tables comprising a database have been fragmented. the classical methods of fragmentation in a distributed database system helps, to a great extent, to make the information retrieval faster and with smaller calculation efforts. this is particularly true for applications where the specifications are well known in advance at the time of the creation of the tables that compose the database, which in some form or other influenced the design and the definition of the type of fragmentation and their distribution on different sites of processing. Nevertheless, the above characteristics cannot be used in applications where the distributed management cannot do inferences that help it to know in what sites the data withthe characteristics the user is looking for are located. Under these conditions the time and amount of work used by the participants in the query solution can be highly increased. In this paper the dynamic virtual fragmentation method is presented. the method works as an alternative way that allows us to diminish response time consumed by queries using horizontal fragmented tables. the proposed method has been proven and implemented in a database parallel server running on a shared nothing supercomputer.
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time. On the contrary, data replication in ...
详细信息
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time. On the contrary, data replication in the presence of writes incurs extra cost due to multiple updates. the set of sites at which an object is replicated constitutes its replication scheme. Finding an optimal replication scheme that minimizes the amount of network traffic given read and write frequencies for various objects, is NP-complete in general. We propose two heuristics to deal withthis problem for static read and write patterns. the first is a simple and fast greedy heuristic that yields good solutions when the system is predominantly read-oriented. the second is a genetic algorithm that through an efficient exploration of the solution space provides better solutions for cases where the greedy heuristic does not perform well. We also propose an extended genetic algorithm that rapidly adapts to the dynamically changing characteristics such as the frequency of reads and writes for particular objects.
Parallel machine scheduling, also known as parallel task scheduling, involves the assignment of multiple tasks onto the system architecture's processing components (a bank of machines in parallel). Parallel machin...
详细信息
Parallel machine scheduling, also known as parallel task scheduling, involves the assignment of multiple tasks onto the system architecture's processing components (a bank of machines in parallel). Parallel machine scheduling is important from boththe theoretical and practical points of view. From the theoretical viewpoint, it is a generalization of the single machine scheduling problem. From the practical point of view it permits to take full advantage of the processing power provided by resources in parallel. Two basic models involving m machines and n jobs are the foundations of more complex models. In the first problem the jobs are allocated according to resource availability following some allocation rule. In the second one, besides that, jobs are subject to precedence constraints. the completion time of the last job to leave the system, known as the makespan (C/sub max/), is one of the most important objective functions to be minimized, because it usually implies high utilization of resources. these problems, minimizing the makespan, are known in the literature (Pinedo, 1995) as the unrestricted parallel machine scheduling (Pm|C/sub max/) and the parallel machine scheduling with job precedence constraints (Pm|prec|C/sub max/). Evolutionary algorithms (EAs) have also been used to solve scheduling problems. this paper proposes a multirecombination scheme to solve both parallel machine scheduling problems.
暂无评论