ppxscal/embedding_network huggingface dataset:
High-Quality Multimodal Volume Rendering for Preoperative Planning of Neurosurgical Interventions
Authors: Johanna Beyer, Markus Hadwiger, Stefan Wolfsberger, Katja Bühler
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Surgical approaches tailored to an individual patient's anatomy and pathology have become standard in neurosurgery. Precise preoperative planning of these procedures, however, is necessary to achieve an optimal therapeutic effect. Therefore, multiple radiological imaging modalities are used prior to surgery to delineate the patient's anatomy, neurological function, and metabolic processes. Developing a three-dimensional perception of the surgical approach, however, is traditionally still done by mentally fusing multiple modalities. Concurrent 3D visualization of these datasets can, therefore, improve the planning process significantly. In this paper we introduce an application for planning of individual neurosurgical approaches with high-quality interactive multimodal volume rendering. The application consists of three main modules which allow to (1) plan the optimal skin incision and opening of the skull tailored to the underlying pathology; (2) visualize superficial brain anatomy, function and metabolism; and (3) plan the patient-specific approach for surgery of deep-seated lesions. The visualization is based on direct multi-volume raycasting on graphics hardware, where multiple volumes from different modalities can be displayed concurrently at interactive frame rates. Graphics memory limitations are avoided by performing raycasting on bricked volumes. For preprocessing tasks such as registration or segmentation, the visualization modules are integrated into a larger framework, thus supporting the entire workflow of preoperative planning.
Comparing student acceptance and performance of online activities to classroom activities
Authors: Jill E. Courte
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Students in a computer science survey course for non-majors experienced a blend of online activities with traditional classroom activities. While the majority of the course involved face-to-face meetings, online modules involving two disparate topics were inserted into the course. Students in two sections of the course participated alternately in the online modules in order to compare their performance and acceptance of the same material presented online versus in the classroom. Overall, the course presents a broad view of computing and its implications for society so incorporating online learning into the class is a perfect match with the course content. Students taking this course typically exhibit a broad range of technical ability. The module topics included a technical topic, computer programming with JavaScript, and a "softer" topic, computer mediated communication. One section received classroom instruction in JavaScript and online instruction in computer mediated communication while the other section received online instruction in JavaScript and classroom instruction in computer mediated communication. At the conclusion of each module, students completed a survey intended to measure their acceptance and opinions of each type of instruction. This paper describes student acceptance of combining online learning with classroom instruction and presents a comparison of student performance for the same topics completed online versus in the classroom.
The Mixed Hierarchical Fuzzy Evaluation System Based on Dynamic Neural Network
Authors: Xiaoping Qiu, Yang Xu, Haiming Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The mixed hierarchical fuzzy evaluation system (MHFES) is discussed in this paper. First, the design of neural units corresponding to the five common operations are proposed. Second, the definition of MHFES is discussed, including the definitions of the evaluation items and the relationships among them, based on the five operations above. Third, the main algorithms of the MHFES are introduced to compute the values of those evaluation items and the result of the MHFES. Subsequently, the experiments are carried out and the results show that the MHFES is effective.
Explaining differences in access to home computers and the Internet: A comparison of Latino groups to other ethnic and racial groups
Authors: Robert W. Fairlie
Venue: Electronic Commerce Research (2007)

A report by the U.S. Department of Commerce notes that Internet use among African-Americans and Latinos is growing at a substantially faster rate than Internet use among whites or Asians suggesting that the so-called "Digital Divide" may be disappearing. Using data from the Computer and Internet Use Supplement to the October 2003 Current Population Survey (CPS), I explore this hypothesis. I find large disparities in home computer and Internet access across major racial and detailed Latino groups that do not appear as though they will disappear soon. I also find that ethnic and racial disparities in home computer and Internet access rates are larger for children than for adults. The results are mixed for other measurable dimensions of the digital divide. Using regression models and special decomposition techniques, I find that differences in income and education explain part, but not all, of the ethnic and racial disparities in home computer and Internet access. Language is also found to be an important determinant of home computer and Internet access even after controlling for education, family income and immigrant status. Spanish-speaking Latinos have strikingly low rates of computer ownership and home Internet access. In contrast, concerns over privacy on the Internet do not appear to contribute substantially to racial disparities in home Internet access.
The Design of a Cryptography Based Secure File System
Authors: E. Gudes
Venue: IEEE Transactions on Software Engineering (1980)

The design of a secure file system based on user controlled cryptographic (UCC) transformations is investigated. With UCC transformations, cryptography not only complements other protection mechanisms, but can also enforce protection specifications. Files with different access permissions are enciphered by different cryptographic keys supplied by authorized users at access time. Several classes of protection policies such as: compartmentalized, hierarchical, and data dependent are discussed. Several protection implementation schemes are suggested and analyzed according to criteria such as: security, efficiency, and user convenience. These schemes provide a versatile and powerful set of design alternatives.
A simple and expressive semantic framework for policy composition in access control
Authors: Glenn Bruns, Daniel S Dantas, Michael Huth
Venue: Proceedings of the 2007 ACM workshop on Formal methods in security engineering (2007)

In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing policy composition approaches tend to be ad-hoc, and do not explain whether too many or too few policy combinators have been defined. We define an access controlpolicy as a four-valued predicate that maps accesses to either grant, deny, conflict, or unspecified. These correspond to the four elements of the Belnap bilattice. Functions on this bilattice are then extended to policies to serve as policy combinators. We argue that this approach provides a simple andnatural semantic framework for policy composition, with a minimal but functionally complete set of policy combinators. We define derived, higher-level operators that are convenient for the specification of access control policies, and enable the decoupling of conflict resolution from policy composition. Finally, we propose a basic query language and show that it can reduce important analyses (e.g., conflict analysis) to checks of policy refinement.
Parallel Performance Modeling using a Genetic Programming-based Error Correction Procedure
Authors: Kavitha Raghavachar, G. Mahinthakumar, Patrick Worley, Emily Zechman, Ranji Ranjithan
Venue: Simulation (2007)

Performance models of high performance computing (HPC) applications are important for several reasons. First, they provide insight to designers of HPC systems on the role of subsystems such as the processor or the network in determining application performance. Second, they allow HPC centers more accurately to target procurements to resource requirements. Third, they can be used to identify application performance bottlenecks and to provide insights about scalability issues. The suitability of a performance model, however, for a particular performance investigation is a function of both the accuracy and the cost of the model. A semi-empirical model previously published by the authors for an astrophysics application was shown to be inaccurate when predicting communication cost for large numbers of processors. It is hypothesized that this deficiency is due to the inability of the model adequately to capture communication contention (threshold effects) as well as other unmodeled components such as noise and I/O contention. In this paper we present a new approach to capture these unknown features to improve the predictive capabilities of the model. This approach uses a systematic model error-correction procedure that uses evolutionary algorithms to find an error correction term to augment the eXisting model. Four variations of this procedure were investigated and all were shown to produce better results than the original model. Successful cross-platform application of this approach showed that it adequately captures machine dependent characteristics. This approach was then successfully demonstrated for a second application, further showing its versatility.
Predicting time-sharing in mobile interaction
Authors: Miikka Miettinen, Antti Oulasvirta
Venue: User Modeling and User-Adapted Interaction (2007)

The era of modern personal and ubiquitous computers is beset with the problem of fragmentation of the user's time between multiple tasks. Several adaptations have been envisioned that would support the performance of the user in the dynamically changing contexts in which interactions with mobile devices take place. This paper assesses the feasibility of sensor-based prediction of time-sharing, operationalized in terms of the number of glances, the duration of the longest glance, and the total and average durations of the glances to the interaction task. The data used for constructing and validating the predictive models was acquired from a field study (N = 28), in which subjects performing mobile browsing tasks were observed for approximately 1 h in a variety of environments and situations. The predictive accuracy achieved in binary classification tasks was about 70% (about 20% above default), and the most informative sensors were related to the environment and interactions with the mobile device. Implications to the feasibility of different kinds of adaptations are discussed.
Reusing relational sources for semantic information access
Authors: Lina Lubyte
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

The rapid growth of available data arises the need for more sophisticated techniques for semantic access to information. It has been proved that using conceptual model or ontology over relational data sources is necessary to overcome many problems related with accessing the structured data. However, the task of wrapping the data residing in a database by means of an ontology is mainly done manually. The research we are carrying out studies the reuse of relational sources in the context of semantics-based access to information. This problem is tackled in two phases: (i) extracting semantics hidden in the relational sources by wrapping them by means of an ontology, (ii) understanding the methodology for semantic extension of such ontologies. In this paper we focus on the first sub-problem and present an automatic procedure for extracting from a relational database schema its conceptual view. The semantic mapping between the database and its conceptualization is captured by associating views over the data source to elements of the extracted ontology. To represent the extracted conceptual model we use an ontology language, rather that a graphical notation, in order to provide precise formal semantics. Our approach uses heuristics based on ideas of standard relational schema design and normalization. Under this we formally prove that our technique preserves the semantics of constraints in the database. Therefore, there is no data loss, and the extracted model constitutes a faithful wrapper of the relational database.
Managing for innovation
Authors: Robert L. Glass
Venue: Communications of the ACM (2008)

People versus process? Watts Humphrey says it's people and process.
Web Application Model Recovery for User Input Validation Testing
Authors: Nuo Li, Mao-zhong Jin, Chao Liu
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The invalidated input is one of the most critical web application security flaws. However, testing the user input validation function is an intellectual and labor intensive task. We are developing a model driven framework to help testers to accomplish this job in visual view with guidance. This paper reports our on-going work. A meta-model of Web application for user input validation testing is defined. Based on the meta-model, by analyzing HTML files, a light weight method is given to create the model. Our evaluation shows that the proposed method can comprehensively model Web applications, and accurately identify the purpose of input points, which are very important for the test case generation in the future.
Low-overhead design technique for calibration of maximum frequency at multiple operating points
Authors: Somnath Paul, Sivasubramaniam Krishnamurthy, Hamid Mahmoodi, Swarup Bhunia
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Determination of maximum operating frequencies (Fmax) during manufacturing test at different operating voltages is required to: (a) to ensure that, for a Dynamic Voltage and Frequency Scaling (DVFS) system, the adaptation hardware actually applies the correct operating frequency corresponding to a scaled supply and (b) to sort chips in different voltage-frequency (V-Fmax)bins, so that chips at different bins can be used for different applications. Existing speed binning approach requires extensive delay testing at all operating points with all possible frequencies, which increases test cost and test time significantly. In this paper, we propose a low-overhead solution for characterizing Fmax of a circuit at different operating voltages that can eliminate the complex and expensive Fmax calibration at multiple voltage points. The basic idea is to choose a small set of representative paths in a circuit based on their voltage sensitivity and dynamically configuring them into ring oscillator to compute the Fmax. The proposed calibration mechanism is all-digital, robust to process variations, reasonably accurate (average 2.8% error) and incorporates minimal hardware overhead (average 1.7% delay, 3.5% area and 0.28% power overhead).
An Adaptive Counter Propagation Network
Authors: Yihong Dong, Chao Sun, Xiaoying Tai
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In traditional CPN network and its learning method, the number of neurons in competitive layer is difficult to decide. Too many neurons in the competitive layer will generate "dead neurons", while too few neurons will make the competitive layer unstable. In this paper, an adaptive counter propagation network named ACPN and its approach are proposed, where the number of competitive neurons can be decided adaptively. In ACPN, the neurons in competitive layer are generated dynamically, so each neuron in the competitive layer can do its best in training. Because of the efficiency of neurons in competitive is improved sufficiently, ACPN can work well with the least amount of neurons and realize the required capability of network. The experiment shows that the improved model ACPN runs faster and is more efficient than other CPN networks.
The Wrinkle Generation Method for Facial Reconstruction Based on Extraction of Partition Wrinkle Line Features and Fractal Interpolation
Authors: Yi-bo Li, Hong Xiao, Sen-yue Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Because of the high putrescibility of the body, in general condition, only part or fragmentary bones can be found when the victim body was discovered. Therefore, the first step of criminal investigation is to reconstruct the facial features in order to find the victim. Because wrinkle is the most remarkable and intuitionistic feature in the human skin, the wrinkle generation method for reconstructed face is an important step of facial reconstruction. Three improvements based on Bando's classic wrinkle generation algorithm are represented on the basis of analyzing of the special need of craniofacial reconstruction and the typical wrinkle generation technology. Firstly, the extraction of partition wrinkle line features takes the place of the wrinkle line drawing method which is by hand; secondly, the fractal coarse wrinkle line replaces the smooth cubic Bezier wrinkle line; thirdly, the natural ripple which is deeper in middle than in both sides substitutes the ripple with the same depth. The experiments show that the wrinkle generated by this method not only has the advantage of verisimilitude as a photograph, but also has the feature of natural ripple which is deeper in middle than in both sides. Therefore, this method has both the advantages of cylindrical algorithm and geometric texture mapping, and the operations are also more simply and conveniently.
e-Game: A platform for developing auction-based market simulations
Authors: Maria Fasli, Michael Michalakopoulos
Venue: Decision Support Systems (2008)

Trading in electronic markets has been the focus of intense research over the last few years within Computer Science and Economics. This paper discusses the need for tools to support the design and implementation of electronic market simulations or games. Such games emulate real life problems and can be used in order to conduct research on market infrastructure, negotiation protocols and strategic behaviour. To this end, we present the e-Game platform which was developed to support the design, implementation and execution of market simulations involving auctions. How the development of market games is aided is demonstrated with an example game.
The Toy Language Syndrome
Authors: B. K. Rosen
Venue: IEEE Transactions on Software Engineering (1978)

Theorists and implementers can easily interact in such a way that software performs improperly, even if there are no mathematical mistakes in the theory and no coding bugs in the implementation. This correspondence explains the problem and some ways to cope with it. Examples are drawn from program proving, language design, and code optimization.
Theory of Computer Addition and Overflows
Authors: H. L. Garner
Venue: IEEE Transactions on Computers (1978)

Computer addition is a groupoid. If an additive identity exists it is unique. If(and only if) addition is defined with the compute through the overflow (CTO) property, then a finite ring of integers is the homomorphic image of the computer number system and addition. Stated another way, the necessary and sufficient condition for CTO is a congruence relation on the integers. Also, if the number system has CTO capabilities for addition, it also has extended CTO properties for addition. A technique is presented for determining the correct sum in the extended compute through overflow (ECTO) mode of computation.
Supporting Web Search with Near Keywords
Authors: Hanxiong Chen, Kousuke Yamamoto, Kazutaka Furuse, Nobuo Ohbo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The goal of information retrieval (IR) is to identify doc- uments which best satisfy users' information need. The task of formulating an effective query becomes much more dif- ficult when the target is the Web. Proposals on query re- finement in IR, such as relevant feedback which needs to analyse the whole document database, cannot be applied to Web search. We propose a new method to support Web query refinement. Our methods is based on local analysis which clustering the search result. Unlike other clustering- base approaches, we take into consideration the distance between keywords, and guarantee no information loss. A Web search system is implemented for investigation of the feasibility. Candidate keywords generated by our method are provided to user to refine his/her query. We also con- firmed the effectiveness by experiments on well known test collections.
Fuzzy goal programming for multiobjective transportation problems
Authors: M. Zangiabadi, H. R. Maleki
Venue: Journal of Applied Mathematics and Computing (2007)

Several fuzzy approaches can be considered for solving multi-objective transportation problem. This paper presents a fuzzy goal programming approach to determine an optimal compromise solution for the multiobjective transportation problem. We assume that each objective function has a fuzzy goal. Also we assign a special type of nonlinear (hyperbolic) membership function to each objective function to describe each fuzzy goal. The approach focuses on minimizing the negative deviation variables from 1 to obtain a compromise solution of the multiobjective transportation problem. We show that the proposed method and the fuzzy programming method are equivalent. In addition, the proposed approach can be applied to solve other multiobjective mathematical programming problems. A numerical example is given to illustrate the efficiency of the proposed approach.
Business Intelligence An Industrial Perspective
Authors: Meichun Hsu
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Information technology has long enabled enterprises to conduct business transactions efficiently. The advent of Web and the accompanying pervasive search, retrieval and mining technologies have opened up a new frontier for enterprises. Enterprises, private or public, are expected to capitalize on information of many sources and forms to detect events and respond to changes quickly for business advantages.In this talk, we will discuss next-generation business intelligence architectures that will likely enable business intelligence applications to scale significantly both in computation and in volume of data, and thus opening up possibilities that are not practical today, by fusing parallel computing and parallel data management technologies and by going way beyond the type and scope of data harnessed in traditional online transaction processing systems.