Redundant Objects Research Articles

A hash-based collaborative transcoding proxy system

With the ever increasing wireless client population, the Internet client devices have become highly heterogeneous. Transcoding is used to adapt web objects to suit diverse devices. In this paper, a hash-based collaborative transcoding proxy system is proposed, which aims to improve the system performance in two aspects, caching efficiency and workload balancing. This system employs a hashed-based object caching strategy, which optimizes the cache storage utilization by removing redundant objects scattering in different locations of the overall system cache. In addition, a cache replacement algorithm deployed at the transcoding proxy is examined. A simple hash-based workload distribution strategy is also proposed to share the expensive transcoding load among the various proxies. This strategy performs well with balanced hash function. With unbalanced hash function, satisfactory load sharing is achieved by an optimized strategy, which allows the overloaded proxy to alleviate its load by outsourcing some excessive transcoding tasks to its less overloaded neighbors. An event-driven simulation is conducted to evaluate the system performance, and our results show that the proposed system outperforms existing methods in terms of throughput and response time.

Scanlon, permissions, and redundancy: response to McNaughton and Rawling

According to one formulation of Scanlon's contractualist principle, certain acts are wrong if they are permitted by principles that are reasonably rejectable because they permit such acts. According to the redundancy objection, if a principle is reasonably rejectable because it permits actions which have feature F, such actions are wrong simply in virtue of having F and not because their having F makes principles permitting them reasonably rejectable. Consequently Scanlon's contractualist principle adds nothing to the reasons we have not to act wrongly and is redundant. In 'Scanlon's contractualism and the redundancy objection' I argued that the redundancy objection is based upon the false assumption that Scanlon regards his contractualist principle as a ground of moral wrongness that is, as telling us what makes certain acts wrong. I pointed out that he does not regard his principle in this way, but regards it as telling us what moral wrongness is. So the redundancy objection is based on a mistake. Nonetheless, Scanlon is still vulnerable to a version of this objection, because he regards the moral wrongness of (p ing as a reason not to (p. Given that he identifies the fact that (p ing is wrong with the fact that (p ing is permitted by a reasonably rejectable principle, he is committed to the view that his contractualist principle gives us a reason not to (p. His critics can thus still insist that the only reason we have not to do such acts is provided by features those actions have on the basis of which we could reasonably reject principles that permit them. The fact that such acts are reasonably rejectable does not provide an additional reason not to do them. I suggested that Scanlon can avoid this objection by abandoning the assumption that wrongness is reason-giving. He will then no longer be committed to the dubious view that the fact that (p ing is permitted by a reasonably rejectable principle provides a further reason not to c( over and above the reasons for rejecting the principle(s) that permits c( ing. D. McNaughton and P. Rawling (2003) criticise my defence of Scanlon on two grounds. The first is that the 'permitted-by-rejectable-principles' formulation that I use is deeply implausible, and should be abandoned for the forbidden-by-unrejectable-principles formulation. Even if they are right that the permissibility formulation is implausible, this would not affect my defence of Scanlon, for although I used the permissibility formulation, my argument did not depend on this.

Contractualism and the new and improved redundancy objection

T. M. Scanlon's contractualism holds that for an action to be wrong in the most central sense of 'wrong' is for it to be forbidden by any set of principles nobody could reasonably reject for informed, unforced general agreement (Scanlon 1998: 153). Perhaps the most frequently raised objection to Scanlon's contractualism is that the appeal to reasonable rejectability is simply redundant. The objection goes roughly as follows. Whenever principles allowing an action are reasonably rejectable because that action has some feature (or set of features) F, the action is wrong simply in virtue of being F and not because its being F makes principles allowing it reasonably rejectable.1 The appeal to reasonable rejectability seems otiose when we could apparently understand wrongness more directly in terms of the grounds for reasonable rejection. Call this the 'redundancy objection'. It has been pressed by Simon Blackburn (1999), Colin McGinn (1999) and

Contractualism and the new and improved redundancy objection

Contractualism and the new and improved redundancy objection

Hierarchical simulation model with animation

There are many issues in computer simulation such as verifying model code, validating models, understanding the dynamics of systems and training the personnel. The developers of simulation tool have been interested in the animation, since it can help solve theproblems related to the above listed issues. Trying to display all the graphic objects representing the dynamics of the models being simulated, however, causes the distractionof focus, which results in solving the above listed problems difficult. The redundant graphic objects also increase the computer computation overhead. This paper presents a hierarchical animation environment in which the users can have better focus on the dynamics of system components by selectively choosing the hierarchical level and components within a level of the hierarchically structured model. When the model is large and complex in particular, the selection of observation level is needed. The design of the hierarchical animation is based on the DEVS (Discrete EVent system Specification) formalism, which is theoretically well grounded means of expressing modular and hierarchical models.

Scanlon's contractualism and the redundancy objection

Journal Article Scanlon's contractualism and the redundancy objection Get access Philip Stratton–Lake Philip Stratton–Lake University of ReadingReading RG6 6AA, UKp.j.stratton-lake@reading.ac.uk Search for other works by this author on: Oxford Academic Google Scholar Analysis, Volume 63, Issue 1, January 2003, Pages 70–76, https://doi.org/10.1093/analys/63.1.70 Published: 01 January 2003

Scanlon's contractualism and the redundancy objection

Scanlon's contractualism and the redundancy objection

Scanlon's contractualism and the redundancy objection

Scanlon's contractualism and the redundancy objection

Replica-aware caching for Web proxies

A significant percentage of Web objects are replicas. For example, a vast majority of image files such as banners, buttons, and logos are duplicated throughout the WWW. Nevertheless, Web caching systems generally treat the replicas as different objects because they have different URLs. In this paper, we propose a simple and efficient way to manage the replicated objects for Web proxy caches. In the proposed scheme, the MD5 checksum, together with the size of an object, forms an identifier of a Web object that can distinguish replicas. Experimental results show that the proposed scheme significantly improves the cache hit rate and the byte hit rate by removing the redundant objects from the cache and reflecting the popularity of objects more precisely.

Movement and Chains

A line of thought within the Minimalist Program proceeds as follows: the objects interpreted at the interface determine the units of syntactic manipulation. This paper argues that chains are not proper units for determining relative quantifier scope and so should not be thought of as proper syntactic objects. This conclusion is buttressed by the claim that once θ‐features are allowed into the theory, a conclusion independently required once control is considered, then chains are redundant objects that can be seen as violating the Inclusiveness Condition. The paper presents a theory that dispenses with chains. This requires syntactic innovations that are examined.

Software operation system information model

AbstractA domain model for software maintenance and delivery is proposed and a specific information model for a telephone switching support system is derived from it by using object‐oriented analysis. This domain modeling and information‐model construction method can easily define boundaries for complicated tasks and can be reused for other target systems. Since the derived information model does not have any redundant objects or services, it is believed that it will facilitate the development of systems that have consistency among objects and specialized services.

Compiler Generation from Denotational Semantics

<p>A methodology is described for generating provably correct compilers from denotational definitions of programming languages. An application is given to produce compilers into STM code (an STM or state transition machine is a flow-chart-like program, low-level enough to be translated into efficient code on conventional computers). First, a compiler phi: LAMC -> STM from a lambda calculus dialect is defined. Any denotational definition DD of language L defines a map DD': L -> LAMC, so DD'_circle phi compiles L into STM code. Correctness follows from the correctness of phi.</p><p>The algebraic framework of Morris, ADJ, etc. is used. The set of STMs is given an algebraic structure so any DD'_circ phi may be specified by giving a derived operator on STM for each syntax rule of L.</p><p>This approach yields quite redundant object programs, so the paper ends by describing two flow analytic optimization methods. The first analyzes an already-produced STM to obtain information about its runtime behaviour which is used to optimize the STM. The second analyzes the generated compiling scheme to determine runtime properties of object programs in general which a compiler can use to produce less redundant STMs.</p>

Redundant objective functions in linear vector maximum problems and their determination

Suppose that in a multicriteria linear programming problem among the given objective functions there are some which can be deleted without influencing the set E of all efficient solutions. Such objectives are said to be redundant. Introducing systems of objective functions which realize their individual optimum in a single vertex of the polyhedron generated by the restriction set, the notion of relative or absolute redundant objectives is defined. A theory which describes properties of absolute and relative redundant objectives is developed. A method for determining all the relative and absolute redundant objectives, based on this theory, is given. Illustrative examples demonstrate the procedure.

The Redundant Object Pronoun in Contemporary Spanish

Nowhere have I been able to find a full discussion of the redundant object pronoun in Modern Spanish. More specifically, rules for the concurrence of use and non-use in similar situations are extremely vague, if stated at all. The present study is an attempt to remedy this lack. These investigations are confined to printed texts. The method used is the sampling technique so successfully employed by Keniston in his Spanish Syntax List' and The Syntax of Castilianr Prose: the Sixteenth Century,2 to which subsequent scholars have been so deeply indebted. In the former work in particular, one will recall, the author was able to lay a great many syntactic ghosts which had been intimidating the groves of Academe for generations, and thus to put the study of Spanish syntax upon a more realistic basis.

The formation of oil-field emulsions

This study investigates the coupling effects of objective-reduction and preference-ordering schemes on the search efficiency in the evolutionary process of multi-objective optimization. The difficulty in solving a many-objective problem increases with the number of conflicting objectives. Degenerated objective space can enhance the multi-directional search toward the multi-dimensional Pareto-optimal front by eliminating redundant objectives, but it is difficult to capture the true Pareto-relation among objectives in the non-optimal solution domain. Successive linear objective-reduction for the dimensionality-reduction and dynamic goal programming for preference-ordering are developed individually and combined with a multi-objective genetic algorithm in order to reflect the aspiration levels for the essential objectives adaptively during optimization. The performance of the proposed framework is demonstrated in redundant and non-redundant benchmark test problems. The preference-ordering approach induces the non-dominated solutions near the front despite enduring a small loss in diversity of the solutions. The induced solutions facilitate a degeneration of the Pareto-optimal front using successive linear objective-reduction, which updates the set of essential objectives by excluding non-conflicting objectives from the set of total objectives based on a principal component analysis. Salient issues related to real-world problems are discussed based on the results of an oil-field application.