A new type of data dependency, the domain reduction dependency is defined. Given a set of attributes over which a query is being made, this dependency allows one to more accurately predict the probability of release of sensitive statistics for that query than could have been done with table size alone. In addition, the properties of DRDs provide metainformation on the gain and loss of information within a lattice of queries through the addition or removal of attributes from a query set. This increased formalism on information loss and gain may provide insights which will allow the construction of better techniques for protecting the security of future statistical databases.>

article Free AccessAn extended memoryless inference control model: accounting for dependence in table-level controls Share on Authors: S. C. Hansen Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas Department of Computing and Information Sciences, Kansas State University, Manhattan, KansasView Profile , E. A. Unger Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas Department of Computing and Information Sciences, Kansas State University, Manhattan, KansasView Profile Authors Info & Claims ACM SIGMOD RecordVolume 20Issue 2June 1991 pp 348–356https://doi.org/10.1145/119995.115853Online:01 April 1991Publication History 3citation235DownloadsMetricsTotal Citations3Total Downloads235Last 12 Months4Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

An estimate of the information a database contains and the quantification of the vulnerability of that database to compromise by inferential methods is discussed. Such a measure could be used to evaluate the deterrent value of extant protection methods and provide a measure of the potential for inferential compromise through the use of one of the known attack tools. The authors explore the use of the concept of entropy as defined for information by C.E. Shannon (1948; 1951), for the purpose of quantifying information content in a database and develop a measure of vulnerability based on entropy. Use of the measure, when exact disclosure through the use of a tracker is anticipated, is characterized for both static and dynamic databases at design and operational time.>

There has been considerable research in database security and inference control; however, that research deals primarily with statistical databases. Although some of the mechanisms proposed to deter compromise artificially introduce dynamicism into these otherwise static databases, very little effort has been devoted to the area of natural dynamics. The purpose of the work presented is to determine a deterrent value for natural change in dynamic databases. More specifically, the authors investigate how the changing value of an attribute prevents the inference of the confidential value of that attribute for any particular record. Assuming a restricted query set size, they calculate bounds of deterrence to compromise by the individual, general, and double trackers.>

The authors report on the design of a dynamic integrity constraint checker with a nonmonotonic interval logic (IL). Central to this logic is the inclusion of the unless operator which captures the nonmonotonicity of dynamic integrity constraints over temporal intervals. IL is embedded in the Ada/ISL Interval Specification Language which has been utilized in the design of the Icarus Integrity System. In this system, the answer to a query depends on the availability of an explicit body of knowledge (knowledge base) about the integrity of data items contained in the query. The principal inference mechanism in this system is the refutation of faulty beliefs about data based on partial information and intuition, with respect to facts in the knowledge base. A technique for the verification of the Icarus kernel is presented. A family of assertions about the completeness, correctness, and confidence integrity characteristics about data is included in the integrity model.>

The information manager today is usually educated in a college of business with curriculum requirements guided by the DPMA guidelines for the management information systems, MIS, degree or in a computer science department with curriculum requirements guided by the ACM curriculum for information systems. There is considerable feedback to educators that such people although talented and well trained have enough flat sides in their background to make it necessary to expend considerable resources to make them useful to the organization as a well rounded and well grounded information analyst or manager. The complaint is heard that the MIS types are not technically oriented enough and the IS types are not management oriented enough. The authors undertook a study of the complaints, the suggestions, the current curriculum guidelines and the existing programs. Out of this study emerged a proposal for a degree which blends the current ACM and DPMA guidelines, adds new requirements and suggests different teaching methodologies. The proposal has the potential to address many of the current deficiencies perceived by employers of MIS and IS graduates but it has other problems including acceptance within a traditionally organized and funded university. This paper addresses our solution, its merits, and shortcomings.

Abstract Resource manager objects are the operating system entities that manage computer system resources. In this paper we extend Hoare's and Brinch Hansen's monitor concept, and introduce a resource monitor language construct that represents a resource manager object. Resource monitors provide requesting processes with implicit synchronization, and do not require separate processes to perform the resource access operations. The resource monitor construct is compared to current language constructs used to structure operating system software. For this purpose we use an evaluation methodology that combines software complexity measurements with program performance measurements. The evaluation itself is carried out in a Concurrent Pascal‐like programming environment. The current language constructs have a software complexity that is larger by 37 to 219 per cent over the resource monitor's complexity. The run‐time synchronization overhead of programs that use current language constructs is 1.43 to 2.75 times higher than the overhead of programs that use a resource monitor.

The purpose of this study was to create and validate a tool which could be administered to students enrolled in or considering enrollment in an introductory programming course to predict success in the course or alternatively to segregate enrolled students into fast and slow paced sections. Previous work which met the criteria of a self contained predictive tool included the work of Barry Kurtz [5] of the University of California, Irvine using abstract reasoning development as the predictive measure. The test Kurtz developed had been tested only on a small sample (23 students) in a controlled environment (one instructor - the researcher) and the test required up to 80 minutes to complete.

An information systems major is presented as a second offering by a computer science department. The rationale for the degree program is based upon the demands of industry for graduates skilled in database and information systems. Courses in COBOL, business data processing, database management, and systems analysis are included in the information systems curriculum to prepare the student for employment in the business systems area. The contents of the courses in the information systems core curriculum at Kansas State University are presented as an example of an implemented degree program. In addition, the information systems curriculum is analyzed in terms of its differences with the Curriculum 78 computer science curriculum and of the resources required for its implementation.

This research deals with the methodology of integrating a data base management system (DBMS) into a distributed network system. The focus of concern is upon the interfaces and communications among a DBMS, an operating system with associated network interface features, and other such components at distributed nodes. The environment of a generalized data base management system is extended to a distributed generalized data base management system. The definition of this system by the authors allows the DBMS, schema, subschema, and application program to be distributed individually throughout nodes in the network and for the data base itself to be distributed.