Open Access. Powered by Scholars. Published by Universities.®

Science and Technology Studies Commons

Open Access. Powered by Scholars. Published by Universities.®

2000

Series

Discipline
Institution
Keyword
Publication

Articles 31 - 39 of 39

Full-Text Articles in Science and Technology Studies

The Kth-Order Nonhomomorphicity Of S-Boxes, Yuliang Zheng, Xian-Mo Zhang Jan 2000

The Kth-Order Nonhomomorphicity Of S-Boxes, Yuliang Zheng, Xian-Mo Zhang

Faculty of Engineering and Information Sciences - Papers: Part A

Nonhomomorphicity is a new nonlinearity criterion of a mapping or S-box used in a private key encryption algorithm. An important advantage of nonhomomorphicity over other nonlinearity criteria is that the value of nonhomomorphicity is easy to estimate by the use of a fast statistical method. Due to the Law of Large Numbers, such a statistical method is highly reliable. Major contributions of this paper are (1) to explicitly express the nonhomomorphicity by other nonlinear characteristics, (2) to identify tight upper and lower bounds on nonhomomorphicity, and (3) to find the mean of nonhomomorphicity over all the S-boxes with the same …


Expedited Broda-Damas Bracket Abstraction, Martin W. Bunder Jan 2000

Expedited Broda-Damas Bracket Abstraction, Martin W. Bunder

Faculty of Engineering and Information Sciences - Papers: Part A

A bracket abstraction algorithm is a means of translating λ-terms into combinators. Broda and Damas, in [1], introduce a new, rather natural set of combinators and a new form of bracket abstraction which introduces at most one combinator for each λ-abstraction. This leads to particularly compact combinatory terms. A disadvantage of their abstraction process is that it includes the whole Schonfinkel [4] algorithm plus two mappings which convert the Schonfinkel abstract into the new abstract. This paper shows how the new abstraction can be done more directly, in fact, using only 2n - 1 algorithm steps if there are n …


Slope Instability, Hazard And Risk Associated With A Rainstorm Event - A Case Study, Phillip N. Flentje, Robin N. Chowdhury Jan 2000

Slope Instability, Hazard And Risk Associated With A Rainstorm Event - A Case Study, Phillip N. Flentje, Robin N. Chowdhury

Faculty of Engineering and Information Sciences - Papers: Part A

Over the last few decades there has been an increasing awareness of landslide hazard and risk in many coastal regions of Australia. Urban communities in hilly areas are, from time to time, adversely affected by rainfall-induced landsliding. However, acute awareness of hazard may be absent during periods between significant rainstorm events. In general, the serious consequences of landslides to property and life have been underestimated in Australia. It is now known that at least 80 deaths can be attributed to a number of landslides (Leiba, 1998). Some of these events have focussed the attention of the public, the most important …


A Geometric Approach For Three-Phase Load Balancing In Distribution Networks, Kashem M. Muttaqi, Velappa Ganapathy, G B. Jasmon Jan 2000

A Geometric Approach For Three-Phase Load Balancing In Distribution Networks, Kashem M. Muttaqi, Velappa Ganapathy, G B. Jasmon

Faculty of Engineering and Information Sciences - Papers: Part A

No abstract provided.


A Novel Method For Loss Minimization In Distribution Networks, Kashem M. Muttaqi, Velappa Ganapathy, G B. Jasmon, M Buhari Jan 2000

A Novel Method For Loss Minimization In Distribution Networks, Kashem M. Muttaqi, Velappa Ganapathy, G B. Jasmon, M Buhari

Faculty of Engineering and Information Sciences - Papers: Part A

Network reconfiguration for loss minimization is the determination of switching-options that minimizes the power losses for a particular set of loads on a distribution system. In this paper, a novel method is proposed by formulating an algorithm to reconfigure distribution networks for loss minimization. An efficient technique is used to determine the switching combinations, select the status of the switches, and find the best combination of switches for minimum loss. In the first stage of the proposed algorithm, a limited number of switching combinations is generated and the best switching combination is determined. In the second stage, an extensive search …


Optimization Techniques For Data Intensive Decision Flows, Richard Hull, Francois Llirbat, Bharat Kumar, Gang Zhou, Guozhu Dong, Jianwen Su Jan 2000

Optimization Techniques For Data Intensive Decision Flows, Richard Hull, Francois Llirbat, Bharat Kumar, Gang Zhou, Guozhu Dong, Jianwen Su

Kno.e.sis Publications

For an enterprise to take advantage of the opportunities afforded by electronic commerce it must be able to make decisions about business transactions in near-real-time. In the coming era of segment-of-one marketing, these decisions will be quite intricate, so that customer treatments can be highly personalized, reflecting customer preferences, the customer's history with the enterprise, and targeted business objectives. This paper describes a paradigm called “decision flows” for specifying a form of incremental decision-making that can combine diverse business factors in near-real-time.

This paper introduces and empirically analyzes a variety of optimization strategies for decision flows that are “data-intensive”, i.e. …


Separating Auxiliary Arity Hierarchy Of First-Order Incremental Evaluation Using (3+1)-Ary Input Relations, Guozhu Dong, Louxin Zhang Jan 2000

Separating Auxiliary Arity Hierarchy Of First-Order Incremental Evaluation Using (3+1)-Ary Input Relations, Guozhu Dong, Louxin Zhang

Kno.e.sis Publications

Presents a first-order incremental evaluation system that uses first-order queries to maintain a database view defined by a non-first-order query. Reduction of the arity of queries to understand the power of foies; Use of a key lemma for proving a query which encodes the multiple parity problem.


Imprecise Answers In Distributed Environments: Estimation Of Information Loss For Multi-Ontology Based Query Processing, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth Jan 2000

Imprecise Answers In Distributed Environments: Estimation Of Information Loss For Multi-Ontology Based Query Processing, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth

Kno.e.sis Publications

The World Wide Web is fast becoming a ubiquitous computing environment. Prevalent keyword-based search techniques are scalable, but are incapable of accessing information based on concepts. We investigate the use of concepts from multiple, real-world pre-existing, domain ontologies to describe the underlying data content and support information access at a higher level of abstraction. It is not practical to have a single domain ontology to describe the vast amounts of data on the Web. In fact, we expect multiple ontologies to be used as different world views and present an approach to "browse" ontologies as a paradigm for information access. …


Complexity And Copyright In Contradiction, Michael J. Madison Jan 2000

Complexity And Copyright In Contradiction, Michael J. Madison

Articles

The title of the article is a deliberate play on architect Robert Venturi's classic of post-modern architectural theory, Complexity and Contradiction in Architecture. The article analyzes metaphorical 'architectures' of copyright and cyberspace using architectural and land use theories developed for the physical world. It applies this analysis to copyright law through the lens of the First Amendment. I argue that the 'simplicity' of digital engineering is undermining desirable 'complexity' in legal and physical structures that regulate expressive works.