Pii: S1467-0895(00)00006-3

نویسنده

  • Andreas I. Nicolaou
چکیده

A contingency model is advanced that examines sources of requirements for organizational coordination and control as they affect the extent of integration in an accounting information system. Requirements that are contingent on the degree of organizational formalization, information interdependence among functional areas, and dependence in interorganizational information sharing and electronic data interchange links, are examined. The congruence or fit of system integration with those requirements is a key concept that influences beliefs about system effectiveness. Results of the empirical study indicated that, as hypothesized, the fit between the accounting system design and the contingency factors resulted in a more successful system. Specifically, system fit was a significant factor that explained variations in perceived AIS effectiveness, as measured by decision makers’ perceived satisfaction with the accuracy and monitoring effectiveness of output information. The effect of system fit on a second factor of perceived AIS effectiveness, as measured by decision-makers’ satisfaction with the perceived quality of information content in system outputs, was only marginally significant. The study addresses an important area in accounting systems research that directly relates to the decision facilitation and control objectives of accounting information. © 2000 Elsevier Science Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher type recursion, ramification and polynomial time

It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a ramified type structure, and by adding linear concepts to the lambda calculus.

متن کامل

Pii: S0925-7721(00)00006-7

A k-set of a finite set S of points in the plane is a subset of cardinality k that can be separated from the rest by a straight line. The question of how many k-sets a set of n points can contain is a long-standing open problem where a lower bound of (n logk) and an upper bound of O(nk1/3) are known today. Under certain restrictions on the set S, for example, if all points lie on a convex curv...

متن کامل

Pii: S1366-5545(00)00006-5

A heuristic procedure is developed to assign buses to transit centers (garages) in such a way that all the buses on a particular route are assigned to a single transit center. This research builds on an optimal mixed integer programming location/allocation model that splits the bus assignments when capacity limitations were reached at a transit center. The heuristic procedure adopts a two-step ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000