Review of research in feature-based design

Research in feature-based design is reviewed. Feature-based design is regarded as a key factor towards CAD/CAPP integration from a process planning point of view. From a design point of view, feature-based design offers possibilities for supporting the design process better than current CAD systems do. The evolution of feature definitions is briefly discussed. Features and their role in the design process and as representatives of design-objects and design-object knowledge are discussed. The main research issues related to feature-based design are outlined. These are: feature representation, features and tolerances, feature validation, multiple viewpoints towards features, features and standardization, and features and languages. An overview of some academic feature-based design systems is provided. Future research issues in feature-based design are outlined. The conclusion is that feature-based design is still in its infancy, and that more research is needed for a better support of the design process and better integration with manufacturing, although major advances have already been made

Information Technology and Australia’s Productivity Surge

This paper finds that the rapid update of information and communication technologies contributed to Australia’s strong productivity performance in the 1990s and the contribution to labour productivity growth was at least as strong as it was in the US. Australia generated a productivity improvement of 1.1 per cent from information and communication technology use and other factors.information technology - communications - productivity - IT - ICT - capital - computer - growth accounting

The chaos machine: analogue computing rediscovered (1)

Analogue computers provide actual rather than virtual representations of model systems. They are powerful and engaging computing machines that are cheap and simple to build. This two-part Retronics article helps you build (and understand!) your own analogue computer to simulate the Lorenz butterfly that's become iconic for Chaos theory

Physicality in Australian patent law

It is generally understood that the patent system exists to encourage the conception and disclosure of new and useful inventions embodied in machines and other physical devices, along with new methods that physically transform matter from one state to another. What is not well understood is whether, and to what extent, the patent system is to encourage and protect the conception and disclosure of inventions that are non-physical methods – namely those that do not result in a physical transformation of matter. This issue was considered in Grant v Commissioner of Patents. In that case the Full Court of the Federal Court of Australia held that an invention must involve a physical effect or transformation to be patentable subject matter. In doing so, it introduced a physicality requirement into Australian law. What this article seeks to establish is whether the court’s decision is consistent with the case law on point. It does so by examining the key common law cases that followed the High Court’s watershed decision in National Research Development Corporation v Commissioner of Patents, the undisputed authoritative statement of principle in regard to the patentable subject matter standard in Australia. This is done with a view to determining whether there is anything in those cases that supports the view that the Australian patentable subject matter test contains a physicality requirement

On Non-Parallelizable Deterministic Client Puzzle Scheme with Batch Verification Modes

A (computational) client puzzle scheme enables a client to prove to a server that a certain amount of computing resources (CPU cycles and/or Memory look-ups) has been dedicated to solve a puzzle. Researchers have identified a number of potential applications, such as constructing timed cryptography, fighting junk emails, and protecting critical infrastructure from DoS attacks. In this paper, we first revisit this concept and formally define two properties, namely deterministic computation and parallel computation resistance. Our analysis show that both properties are crucial for the effectiveness of client puzzle schemes in most application scenarios. We prove that the RSW client puzzle scheme, which is based on the repeated squaring technique, achieves both properties. Secondly, we introduce two batch verification modes for the RSW client puzzle scheme in order to improve the verification efficiency of the server, and investigate three methods for handling errors in batch verifications. Lastly, we show that client puzzle schemes can be integrated with reputation systems to further improve the effectiveness in practice