Requirements Engineering Techniques for Data Warehouse using Information Packaging Methodology
Bibliographic record
Abstract
A requirement is a feature of the system or a description of something the system is capable of doing in order to fulfill the system's purpose. Building a data warehouse is a very challenging task. Most of the data ware house project fails to meet the business requirements and business goals because of the improper requirement engineering phase. The Requirement Engineering (RE) is the most important phase of the software development life cycle (SDLC). This phase results into a large document written in natural language that converts the incomplete, imprecise requirements and wishes of the potential users into complete, precise and formal specifications. This formal specification is known as SRS i.e. Software Requirement Specification. These Requirements are transformed into information package in the form of dimensions, hierarchies and facts to build a data warehouse. Hospital can be seen as an example of a complex system. This paper considers Hospital as a case study for which a software system has been developed taking the mentioned approach into account. In this paper we study information package for Hospital Automation System.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.008 | 0.013 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.001 | 0.004 |
| Bibliometrics | 0.004 | 0.004 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".