Segui questo link per vedere altri tipi di pubblicazioni sul tema: Computers.
Tesi sul tema "Computers"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-50 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Computers".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.
1
Frisk, Henrik. "Improvisation, computers and interaction : rethinking human-computer interaction through music /". Malmö : Malmö Academy of Music, Lund University, 2008. http://www.lu.se/o.o.i.s?id=12588&postid=1239899.
Testo completo
2
Smith, Lisa Min-yi Chen. "Display computers". Texas A&M University, 2006. http://hdl.handle.net/1969.1/3829.
Testo completoAbstract (sommario):
A Display Computer (DC) is an everyday object: Display Computer = Display +
Computer. The ÂDisplay part is the standard viewing surface found on everyday
objects that conveys information or art. The ÂComputer is found on the same everyday
object; but by its ubiquitous nature, it will be relatively unnoticeable by the DC user, as
it is manufactured Âin the marginsÂ. A DC may be mobile, moving with us as part of the
everyday object we are using. DCs will be ubiquitous: Âeffectively invisibleÂ, available
at a glance, and seamlessly integrated into the environment. A DC should be an example
of WeiserÂs calm technology: encalming to the user, providing peripheral awareness
without information overload. A DC should provide unremarkable computing in support
of our daily routines in life. The nbaCub (nightly bedtime ambient Cues utility buddy)
prototype illustrates a sample application of how DCs can be useful in the everyday
environment of the home of the future. Embedding a computer into a toy, such that the
display is the only visible portion, can present many opportunities for seamless and nontraditional
uses of computing technology for our youngest user community. A field
study was conducted in the home environment of a five-year old child over ten
consecutive weeks as an informal, proof of concept of what Display Computers for
children can look like and be used for in the near future. The personalized nbaCub
provided lightweight, ambient information during the necessary daily routines of
preparing for bed (evening routine) and preparing to go to school (morning routine). To
further understand the childÂs progress towards learning abstract concepts of time
passage and routines, a novel Âtest by design activity was included. Here, the role of
the subject changed to primary designer/director. Final post-testing showed the subject knew both morning and bedtime routines very well and correctly answered seven of
eight questions based on abstract images of time passage. Thus, the subject was in the
process of learning the more abstract concept of time passage, but was not totally
comfortable with the idea at the end of the study.
3
Дядечко, Алла Миколаївна, Алла Николаевна Дядечко, Alla Mykolaivna Diadechko e S. I. Polevik. "Quantum computers". Thesis, Видавництво СумДУ, 2008. http://essuir.sumdu.edu.ua/handle/123456789/16043.
Testo completo
4
Башлак, Ірина Анатоліївна, Ирина Анатольевна Башлак, Iryna Anatoliivna Bashlak e O. Lobunko. "Quantum computers". Thesis, Вид-во СумДУ, 2009. http://essuir.sumdu.edu.ua/handle/123456789/16767.
Testo completo
5
Gelius, Henrik. "Computer-supported collaboration using Pick-and-Drop interaction on handheld computers". Thesis, Linköping University, Department of Computer and Information Science, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1737.
Testo completoAbstract (sommario):
This study investigates a new interaction technique for collaboration on handheld computers called Pick-and-Drop. The technique is an extension of the popular Drag-and-Drop method used in many graphical interfaces today, but with Pick-and-Drop on-screen objects can be picked from one screen with a pen and dropped onto another.
The aim of the study is to answer whether Pick-and-Drop promote collaboration among children by letting them focus more on other users and the task at hand than on the computer interaction. The study also investigates in what way collaborative situations can benefit from Pick-and-Drop.
A prototype Pick-and-Drop system was implemented on four customized handheld computers equipped with wireless network communication. The prototype allowed spontaneous collaboration using ad-hoc networks and peer-to-peer communication. Radio Frequency Identification (RFID) tags were used to identify the pens when picking and dropping objects from the screen.
Ten children aged 6-7 years old participated in the study at an after- school recreational centre. They tried Pick-and-Drop by playing a collaborative game of buying and selling apples using golden coins represented as icons on the screen. The test was video filmed for later analysis.
The study showed that Pick-and-Drop offers effective collaborative interaction based on a mix of turn taking and concurrent interaction. Users do not have to switch focus when using an application or sharing data as the interaction style stays the same. There was an interesting difference in control over the interaction when users shared objects by “giving” or by “taking”. Users stayed in better control when they shared objects through giving.
6
Jedeskog, Gunilla. "Teachers and computers : Teachers' computer usage and the relationship between computers and the role of the teacher, as described in international research". Doctoral thesis, Uppsala : Uppsala university, 2000. http://publications.uu.se/theses/fulltext/91-506-1439-8.pdf.
Testo completo
7
Dent, Mike. "Doctors and computers". Thesis, University of Warwick, 1988. http://wrap.warwick.ac.uk/71206/.
Testo completoAbstract (sommario):
The twin concerns of the thesis are (a) to develop a labour process analysis that is able to account for professional work and (b) in so doing to explain the reasons for hospital doctors various responses to the introduction of computer systems into medical work. This thesis constitutes a study of hospital doctors (clinicians) use of information technology in their clinic work. The first part reviews the literature and general developments in medical computing in relation to a theoretical analysis of the organisation and control of the clinic/medical labour process. The second part consists of an ethnographic study of the introduction of computer-based medical information systems into three hospitals; two being case studies of renal units and associated clinics and the third a study of an outpatients' department at a small acute hospital. The computer systems involved either replaced or supplemented the traditional form of the medical records and for this reason it was possible to focus on the role of these organisational records in the maintenance and reproduction of dominance and subordination within the labour process of clinic/medical work.
8
Saunders, Nancy G. "Coping with computers". Virtual Press, 1998. http://liblink.bsu.edu/uhtbin/catkey/1117126.
Testo completoAbstract (sommario):
The purpose of this study was to describe and understand the meaning of responses of study participants to interactive computer-mediated communication within a distance learning environment. The theoretical framework for this study was based on collaborative learning theories within a constructivist perspective.The study setting was a distance learning graduate course taught in a studio classroom on Ball State University campus and transmitted via the IHETS Network to five distant sites in Indiana. An interactive Internet site, the Class Page, was an important instructional component of the course. This Class Page was developed to enable and support active, collaborative learning among distance learners.Study participants, all graduate students enrolled in degree programs, included 13 studio students and 24 off site students. One professor and two graduate assistants delivered course and Web site instruction. In this descriptive study, responses of participants were collected through a series of surveys and interviews over the sixteen week semester. Evidence collection focused on learner responses to the computer component of this distance learning setting.Identified in this study were cognitive and affective learning strategies developed and employed by students to effectively learn from the educational environment of computer-mediated communication within this study's setting. Two cognitive learning strategies identified were the `management of the computer environment' and the `management of personal resources.' Two affective learning strategies identified were the `management of self and the `management of others.' The computer medium of this setting played an important role in determining how students responded to, and learned within, this distance learning environment.Learners' responses to this multimedia distance setting were shaped by specific aspects of the learning environment. The development of the cognitive and affective learning strategies was influenced by the instructional design of the distance course and the Class Page, the structure of Class Page interactivity, and the characteristics of individual learners. Conclusions and recommendations of this study focused on these four influences upon student responses. Implications for future distance education design and development included the need for a clear model of distance learner participation and further research requirements in areas such as learner characteristics, applications of interactive media, and course design issues.Department of Educational Leadership
9
Higgins, Daniel M. (Daniel Michael). "Learning and computers". Thesis, Massachusetts Institute of Technology, 1995. http://hdl.handle.net/1721.1/36622.
Testo completo
10
Demydenko, Y. S. "Uses of computers". Thesis, Сумський державний університет, 2013. http://essuir.sumdu.edu.ua/handle/123456789/33542.
Testo completoAbstract (sommario):
The computer is truly an amazing machine. Few tools let you do so many different tasks. Whether you want to track an investment, publish a news letter, design a building, you can do it with a computer. Computers are so important for our modern society that without them our economy would have to halt. In the last few decades, computers have completely altered business practice all around the world.
When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/33542
11
Greene, Ryan Thomas. "Computers and Families". Thesis, Virginia Tech, 2001. http://hdl.handle.net/10919/31082.
Testo completoAbstract (sommario):
As we move into the new millennium, computers will increasingly become part of the human culture. As such, computers will continue to effect families, and there will undoubtedly be a proliferation of computer usage across family types. Because computers will be an integral part of change in the next millennium, it is important to examine their potential impact on the basic unit of society- the family. This study, descriptive in nature, provides insight on families and their interactions as related to computer use in their homes. Better understanding of computers and family life can help provide the basis for a smoother transition for families into the expanding world of information technology.
As the expansion of the digital age proceeds, its impact on family life would seem to warrant investigation. Information on who is using computers in the home, how those computers are being used, and how time is spent on computers can add to our appreciation of the impact of computer technology. In addition, the perceived impact of computers needs to be assessed in relation to outcomes for family life- interaction, relationships, and familial organization.Master of Science
12
Jones, Daniel Clayton. "Learning about computers". CSUSB ScholarWorks, 1999. https://scholarworks.lib.csusb.edu/etd-project/1721.
Testo completo
13
Webster, Linda D. "Measuring change in computer self-efficacy and computer literacy of undergraduates in an introduction to computers course /". free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p3164548.
Testo completo
14
Skulkhu, Jaruwan. "Computer Literacy Levels and Attitudes toward Computers of Thai Public University Students". Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc330671/.
Testo completoAbstract (sommario):
The purpose of this study was to investigate and analyze computer literacy and general attitudes toward computers of students at Thai public unversities. The comparative study of computer literacy levels and attitudes toward computers among Thai students with various demographic classification was performed followed by the study of relationships between the two variables among the samples. A fifty-eight-item questionnaire was adapted from the computer literacy questionnaire developed by the researchers at the Minnesota Educational Computing Consortium. The items were designed to assess knowledge and attitudes relative to computers. The questionnaire was administered to a random sample of 492 students who took at least one computer course from thirteen public universities in Thailand. Statistical tests used to analyze the data included t-test, one-way analysis of variance, and Pearson product moment correlations. Based on the research findings, the following conclusions were drawn: (1) Thai university students exhibited a moderate computer literacy level. (2) While a higher proportion of female students enrolled in computer classes, male and female students reported similar computer literacy levels. (3) Graduate students had higher computer literacy levels than did other students from different educational levels. (4) Academic majors and academic performance (GPAs) were also factors affecting computer literacy levels. Education majors displayed higher computer literacy levels than mathematics majors and science majors. (5) Students with higher GPAs had higher levels of computer literacy than the groups with lower GPAs. (6) Computer literacy was not age dependent. (7) Generally, Thai university students showed positive attitudes toward computers. (8) Males and females both showed positive attitudes toward computers. (9) Graduate students exhibited more positive attitudes toward computers than all other groups. (10) The groups of students with lower GPAs displayed lower positive attitudes toward computers. (11) There was a strong positive relationship between students' knowledge and their attitudes toward computers. It is recommended that computer education should be viewed in relation to its contribution to educational process as a whole. It should be relevant to the local environment, work, individuals and. society needs sis well as development of positive attitude toward manual skills. More research is needed in the areas of teacher education, evaluation techniques to assess students' progress in a new teaching context, and ethical values relative to computers.
15
Wilson, Grant Michael. "Ash, Gas and Computers: the vulnerability of laptop computers to volcanic hazards". Thesis, University of Canterbury. Geological Sciences, 2011. http://hdl.handle.net/10092/5888.
Testo completoAbstract (sommario):
Volcanic eruptions are powerful, uncontrollable natural events which produce a number of hazards that can impact upon all aspects of society, including critical infrastructure. The most widespread and disruptive of these hazards is volcanic ashfall. Direct ashfall impacts, even minor, can cause multiple knock on effects throughout all critical infrastructure sectors leading to disruption of these services, on which society relies. However with appropriate volcanic risk management strategies, these impacts can be lessened.
Electronic equipment, including laptop computers, are a common and vital component in all critical infrastructure sectors, field based volcanic research and wider society. Therefore, it is important to understand how laptops will function in volcanic environments. This thesis assesses the vulnerability of laptop computers to volcanic ash and gas hazards through field and laboratory based experimentation and the development of quantitative risk assessments metrics.
Laboratory based ash vulnerability experiments were carried out in the Volcanic Ash Testing Facility, University of Canterbury, using a mass produced basalt ‘pseudo ash’, which is physically and chemically analogous to fresh volcanic ash. Each laptop was exposed to ash for 100 160 hours at fall rates of ~500 g/m² h. None of the ten laptops used sustained any permanent damage from volcanic ash, however, three shutdown temporarily due to overheating. This was because laptops only contain a few small ventilation holes which prevent large quantities of ash from entering the laptops. However, ash contamination reduced functionality of keyboards, CD drives and some cooling fans as these are open to the environment or located close to ventilation holes. Wet ash, known to cause short circuits of electrical equipment, was not able to enter the laptops because it is less mobile than dry ash. Functionality was retained with the use of simple mitigation techniques such as placing laptops inside heavy duty polyethylene bags.
Volcanic gas vulnerability experiments were undertaken at White Island, New Zealand. Three laptops were exposed to high concentrations of volcanic gases for ~5 hours. None however, sustained any permanent damage, due to the limited quantity of gas that could enter the laptop, although metal components on the outside of the laptop sustained minor corrosion.
16
Witt, Hendrik. "Human computer interfaces for wearable computers a systematic approach to development and evaluation /". kostenfrei kostenfrei, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?idn=987607065.
Testo completo
17
Luff, Paul. "Computers and interaction : the social organisation of human-computer interaction in the workplace". Thesis, University of Surrey, 1997. http://epubs.surrey.ac.uk/742233/.
Testo completo
18
Mansourian, Lida. "The Association Between Exposure to Computer Instruction and Changes in Attitudes Toward Computers". Thesis, North Texas State University, 1987. https://digital.library.unt.edu/ark:/67531/metadc331898/.
Testo completoAbstract (sommario):
The problem with which this study was concerned is the association between exposure to computer instruction and changes in attitudes toward computers.
The study had a two-fold purpose. The first was to determine the attitudes of undergraduate students toward computers. The second was to determine whether exposure to information about computers and their uses is associated with changes in students' attitudes toward computers.
A computer literacy test was administered to subjects as a pre-and post-test. The major findings of the study indicate that there were significant, positive attitude changes among students exposed to computer instruction. There were also significant increases in knowledge about computers among participants exposed to computer instruction. The major conclusions are that attitudes are not fixed and develop in the process of need satisfaction. Participants in the study experienced attitude changes, which supports the suggestion that attitudes are developmental. Futhermore, the attitude changes observed in the study occurred in the process of learning about computers, a process assumed to be rooted in the educational and/or career needs of the participants. Attitudes are shaped by the information to which people are exposed. Attitude modification seldom, if ever, occurs in a vacuum. Instead, it most often takes place in the context of information dissemination and exposure. In this study, attitudes toward computers changed positively and significantly as participants were exposed to information about computers.
19
Greh, Deborah Ellen. "Computers in art education /". Access Digital Full Text version, 1987. http://pocketknowledge.tc.columbia.edu/home.php/bybib/10778184.
Testo completo
20
Manji, Karim A. "Pictorial communication with computers". Thesis, Teesside University, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.258559.
Testo completo
21
Allen, Alicia L. "Computers in housing authorities". Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/62928.
Testo completo
22
Huang, Wei-Han 1979. "Instrumentation for quantum computers". Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/30104.
Testo completoAbstract (sommario):
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2004.Includes bibliographical references (p. 209-215).
Quantum computation poses challenging engineering and basic physics issues for the control of nanoscale systems. In particular, experimental realizations of up to seven-qubit NMR quantum computers have acutely illustrated how quantum circuits require extremely precise control instrumentation for pulsed excitation. In this thesis, we develop two general-purpose, low-cost pulse programmers and two Class E power amplifiers, designed for precise control of qubits and complex pulse excitation. The first-generation pulse programmer has timing resolutions of 235 ns, while the second-generation one has resolutions of 10 ns. The Class E power amplifier has [mu]s transient response times, a high quality-factor, and a small form factor. The verification of the pulse programmer and the Class E power amplifier is demonstrated using a customized nuclear quadrupole resonance (NQR) spectrom- eter, which incorporates both devices. The two devices control the generation of RF pulses used in NQR experiments on paradichlorobenzene (C₆H₄C₁₂) and sodium nitrite (NaNO₂). The NQR signals originating from ¹⁴N in sodium nitrite and from ³⁵Cl in paradichlorobenzene are measured using the NQR spectrometer. The pulse programmer and the Class E power amplifier represent first steps towards development of practical NMR quantum computers.
by Wei-Han Huang.
S.M.
23
Нефедченко, Оксана Іллівна, Оксана Ильинична Нефедченко e Oksana Illivna Nefedchenko. "Computers in our life". Thesis, Вид-во СумДУ, 2009. http://essuir.sumdu.edu.ua/handle/123456789/16750.
Testo completo
24
Lally, Elaine. "At home with computers /". Oxford : Berg, 2002. http://catalogue.bnf.fr/ark:/12148/cb39059889m.
Testo completo
25
Riley, Brendan Patrick. "Cinema, computers, and war". [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0004299.
Testo completo
26
Kingdon, Lorraine B. "Computers, Cattle and Crops". College of Agriculture, University of Arizona (Tucson, AZ), 1989. http://hdl.handle.net/10150/295614.
Testo completo
27
Friedewald, Michael. "Der Computer als Werkzeug und Medium : die geistigen und technischen Wurzeln des Personal Computers /". Berlin : Verlag für Geschichte der Naturwissenschaften und der Technik, 1999. http://opac.nebis.ch/cgi-bin/showAbstract.pl?u20=3928186477.
Testo completo
28
Hendricks, Samantha. "The relationship between inservice teachers' beliefs about computers and their levels of computer use". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape11/PQDD_0013/MQ52570.pdf.
Testo completo
29
Nash, Beverly Elaine. "Effects of efficacy expectations, instrumentality beliefs and computer enjoyment on intentions to use computers". Thesis, Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/28844.
Testo completo
30
Sloan, Hugh J. "Respondent self-completion on computers in marketing research : computers compared with alternative collection methods /". The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1259094256.
Testo completo
31
Tarnoff, David. "Episode 2.1 – How Computers Count without Fingers". Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/7.
Testo completoAbstract (sommario):
In this episode, we visit some ancient Sumerians so we can expand our view of finger counting and see how this applies to counting with transistors. From this, we will have the basis for unsigned binary integers and the humble binary digit or bit. We also show how to calculate the upper limit to which a fixed number of transistors can count.
32
An, Jianhua. "Cultural factors in constructivist design : computer literacy for the workplace /". Access Digital Full Text version, 1994. http://pocketknowledge.tc.columbia.edu/home.php/bybib/11714025.
Testo completoAbstract (sommario):
Thesis (Ed.D.)--Teachers College, Columbia University, 1994.Typescript; issued also on microfilm. Sponsor: Florence McCarthy. Dissertation Committee: John Black. Includes tables. Includes bibliographical references (leaves 170-180).
33
Christensen, Jon L. Pierson Brian E. "Integrating computers into calculus instruction /". Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA280996.
Testo completoAbstract (sommario):
Thesis (M.S. in Applied Mathematics) Naval Postgraduate School, March 1994.Thesis advisor(s): Maurice D. Weir, Carlos F. Borges. "March 1994." Includes bibliographical references. Also available online.
34
Krum, David Michael. "Wearable Computers and Spatial Cognition". Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4784.
Testo completoAbstract (sommario):
Human beings live and work in large and complex environments. It is often difficult for individuals to perceive and understand the structure of these environments. However, the formation of an accurate and reliable cognitive map, a mental model of the environment, is vital for optimal navigation and coordination. The need to develop a reliable cognitive map is common to the average individual as well as workers with more specialized tasks, for example, law enforcement or military personnel who must quickly learn to operate in a new area.
In this dissertation, I propose the use of a wearable computer as a platform for a spatial cognition aid. This spatial cognition aid uses terrain visualization software, GPS positioning, orientation sensors, and an eyeglass mounted display to provide an overview of the surrounding environment. While there are a number of similar mobile or wearable computer systems that function as tourist guides, navigation aids, and surveying tools, there are few examples of spatial cognition aids.
I present an architecture for the wearable computer based spatial cognition aid using a relationship mediation model for wearable computer applications. The relationship mediation model identifies and describes the user relationships in which a wearable computer can participate and mediate. The dissertation focuses on how the wearable computer mediates the users perception of the environment. Other components such as interaction techniques and a scalable system of servers for distributing spatial information are also discussed.
Several user studies were performed to determine an effective presentation for the spatial cognition aid. Participants were led through an outdoor environment while using different presentations on a wearable computer. The spatial learning of the participants was compared. These studies demonstrated that a wearable computer can be an effective spatial cognition aid. However, factors such as such as mental rotation, cognitive load, distraction, and divided attention must be taken into account when presenting spatial information to a wearable computer user.
35
Miller, R. Quentin. "Programming bulk-synchronous parallel computers". Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.318894.
Testo completo
36
Yepremyan, Astrik. "Of Proofs, Mathematicians, and Computers". Scholarship @ Claremont, 2015. http://scholarship.claremont.edu/scripps_theses/723.
Testo completoAbstract (sommario):
As computers become a more prevalent commodity in mathematical research and mathematical proof, the question of whether or not a computer assisted proof can be considered a mathematical proof has become an ongoing topic of discussion in the mathematics community. The use of the computer in mathematical research leads to several implications about mathematics in the present day including the notion that mathematical proof can be based on empirical evidence, and that some mathematical conclusions can be achieved a posteriori instead of a priori, as most mathematicians have done before. While some mathematicians are open to the idea of a computer-assisted proof, others are skeptical and would feel more comfortable if presented with a more traditional proof, as it is more surveyable. A surveyable proof enables mathematicians to see the validity of a proof, which is paramount for mathematical growth, and offer critique. In my thesis, I will present the role that the mathematical proof plays within the mathematical community, and thereby conclude that because of the dynamics of the mathematical community and the constant activity of proving, the risks that are associated with a mistake that stems from a computer-assisted proof can be caught by the scrupulous activity of peer review in the mathematics community. Eventually, as the following generations of mathematicians become more trained in using computers and in computer programming, they will be able to better use computers in producing evidence, and in turn, other mathematicians will be able to both understand and trust the resultant proof. Therefore, it remains that whether or not a proof was achieved by a priori or a posteriori, the validity of a proof will be determined by the correct logic behind it, as well as its ability to convince the members of the mathematical community—not on whether the result was reached a priori with a traditional proof, or a posteriori with a computer-assisted proof.
37
Kou, Shuting, e 寇舒婷. "Porous structure modeling with computers". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/206700.
Testo completoAbstract (sommario):
Porous structures are a particular type of solids, where a large number of pores exist in the geometric domain of interest. Research on porous structures have received increasingly keen interest in recent years and this is largely because of many unique and superior properties that porous structures possess. They can undertake special tasks which general solid materials are not competent to do.
In recent twenty years numerous representations are put forward for porous structure modeling. But the challenges in practical porous structure design still exist and the structure heterogeneity brings many difficulties. This thesis is motivated to propose new porous structure modeling strategies which are more accurate, flexible and easy for porous structure description.
An approach of porous structure modeling based on quadtree/octree and NURBS is proposed first. Quadtree and octree are tools for modeling domain partition. The pore size and pore distribution are controlled by the flexibility of quadtree and octree enumeration technique. Derived polygon and polyhedron are then introduced to assist the generation of NURBS curves and surfaces. These NURBS curves and surfaces form the boundaries of the porous structures.
However there are limitations of the above method. The accurate control of porosity is not easily achieved in 3D porous structure modeling and seemingly adopting quadtree/octree for the modeling domain partition is also less than satisfactory. Hence a new representation for porous structures based on Centroidal Voronoi tessellation (CVT) and pore-network is put forward. CVT is utilized for modeling domain partition because the CVT cells are approximate hexagons which is widely existent in plants, animals and other cellular structures in nature. The density distribution function used in CVT generation also helps to build functionally graded porous structures. Pore-network, which is a mature and commonly used model in the research of multiphase flow in porous media, is subsequently introduced to build the porous structures. This modeling approach results in porous structures that could mimic the geometry and performance of structures in nature.
To evaluate the object’s properties, finite element analysis (FEA) is conducted on the porous structure models represented by the two methods. The mechanics properties of the two types of models are analyzed. The stress-strain curve of each sample is plotted and the effective Young’s modulus is calculated. Comparison of these two types of models is also done. Besides, the contributions of the thesis and suggestions for future research are also discussed.published_or_final_version
Mechanical Engineering
Master
Master of Philosophy
38
Christensen, Jon L., e Brian E. Pierson. "Integrating computers into calculus instruction". Thesis, Monterey, California. Naval Postgraduate School, 1994. http://hdl.handle.net/10945/30883.
Testo completoAbstract (sommario):
Visualization is key in helping a student understand the fundamentals of Calculus. The new generation of computer literate students, raised in a video-based environment, will expect more than the traditional chalkboard methods in assisting them in this visualization. By integrating computers into the classroom and developing software to assist in mathematics instruction, we can enhance student comprehension of, and ability to apply, mathematics in solving real world problems of interest to the military. As evidenced by the success of both the Apple Macintosh and Windows software, mouse driven, graphical user interfaces (GUI's) represent a powerful and frequently-used tool in the computing environment. GUI's improve the visual capabilities in computing software, simplify program execution, and reduce the time required to become proficient with the software. When designed correctly, the GUI-based software can significantly improve the way in which people interact with computers. This thesis lays the framework and develops multi-platform GUI software modules needed for the instruction of Calculus
39
Mogendorff, Dolf Andries. "Information and computers in hotels". Thesis, University of Aberdeen, 1987. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=130730.
Testo completoAbstract (sommario):
The main subject of the thesis is the introduction of a computer system into two hotels (one existing and one new) of very similar size, operating system and management structure. A model of information relationships is developed to aid an interactionist analysis of the research data. Findings include the following: Management may use the computer as an organisational change agent but the technology itself does not necessarily play an active role in this. A computer system can be used to foster closer integration of departments, but such technological integration can also diminish interdepartmental cooperation. A period of organisational turbulence occurs when information technology is introduced into an hotel front office, and this will continue until the entrant rule system which accompanies the entrant technology becomes integrated with the embedded rule system already present. Over this initial period, because of an apparent over-concentration on machine-related tasks, a temporarily reduced level of customer service may occur. After a period of time, staff adapt the new rules to fit with their own requirements. These requirements sometimes include reducing customer pressure by 'managing' the technology for their own needs. Lack of middle management's prior technical knowledge of the computer system may lead to reduced control because their previous reliance on a combination of better knowledge of the embedded rule system plus greater experiental 'social skills' does not necessarily compensate for staff's newly-acquired technical skills. User comprehension of the system suffers where the data used in training is of a discrete nature and where the technology itself is not adequately explained. Initial user acceptance is higher in the new hotel than in the existing one; however, the reasons are not entirely clear because, according to company management, the situation after two years was a reversal of that position.
40
Jones, J. F. "Computers to help people think". Thesis, University of Hertfordshire, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233110.
Testo completo
41
Bristow, Huw William. "Context awareness for wearable computers". Thesis, University of Birmingham, 2004. http://etheses.bham.ac.uk//id/eprint/9/.
Testo completoAbstract (sommario):
The research described in this thesis considers mobile technology with particular reference to the use of context sensing. It is argued that such technologies are useful to enhance user proficiency in everyday tasks. A wearable, context–aware computer system and a set of evaluation tasks are devised to investigate this premise. A photograph diary study is carried out to elicit defining features of a broad range of everyday activities. These features are called Context Identifiers. From this a structured definition of context is suggested that bridges the gap between the current theoretical and technological definitions of context. Based on a literature review of current mobile and wearable technology and on the findings of the photograph diary study, a novel wearable computer and supporting software is developed. The wearable computer can detect and interpret features of everyday context, including Location, Posture and Movement, and Objects. During the design cycle of the wearable computer, experiments are conducted to evaluate three versions of the wearable computer. The usability of the computer is considered based on measures of efficiency, effectiveness and user satisfaction. Use of the system is shown to improve user task proficiency in the completion of simple tasks and the wearable computer is shown to capture context in a similar way to humans. Specifically when the first version of the system is used in an information retrieval task, the wearable computer is shown to significantly decrease task completion time when compared to using a standard internet enabled computer or users searching for information in their environment. In addition the task accuracy is increased. The second version of the system in which the number of everyday contextual features the system can detect is increased, again significantly decrease the task completion time when compared to the same system detecting less context features. The third version of the system which detects further more contextual features is shown to be highly usable based on a number of usability measures and is shown to capture context in a similar fashion to humans.
42
Sylla, Fatimata Seye. "Computers and literacy in Senegal". Thesis, Massachusetts Institute of Technology, 1985. http://hdl.handle.net/1721.1/77676.
Testo completoAbstract (sommario):
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Architecture, 1985.MICROFICHE COPY AVAILABLE IN ARCHIVES AND ROTCH.
Includes bibliographical references (leaves 109-110).
This thesis reports two exploratory studies on the use of compute:-s in education in a third world context. One study looks at elementary school children in Dakar in order to elucidate a set of research questions such as whether there are gender differences and whether these are the same as what has been observed In the United States, whether there are differences related to social status or to degree of assimilation of French education and, more generally, whether it is possible to identify influences of Senegalese culture on the way children learn to use computers. The second study looks at two groups of illiterate adult women: one In Dakar and the other made up of immigrants from Latin America living in Boston. I believe that my results cast some light on scientific questions about how cultures affect learning. But my own interest goes beyond simply understanding. I want to develop educational methods that will use our diverse cultures as sources of strength for new educational methods rather than seeing them as "obstacles" to the exportation of ready made educational methods from "developed" to "developing" countries. My explorations are chosen with this intent and my thesis is colored with preliminary speculations about how to realize it.
by Fatimata Seye Sylla.
M.S.
43
Kim, Jang Don. "Applications performance on reconfigurable computers". Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/42711.
Testo completo
44
Золотова, Світлана Григорівна, Светлана Григорьевна Золотова, Svitlana Hryhorivna Zolotova e J. L. Sidorenko. "Apple. Computers of the future". Thesis, Вид-во СумДУ, 2011. http://essuir.sumdu.edu.ua/handle/123456789/22505.
Testo completo
45
Susidenko, Y. A. "From the history of computers". Thesis, Сумський державний університет, 2012. http://essuir.sumdu.edu.ua/handle/123456789/28613.
Testo completo
46
Fuller, Marvin G. "Technological enhancements for personal computers". Thesis, Monterey, Calif. : Naval Postgraduate School, 1992. http://handle.dtic.mil/100.2/ADA247962.
Testo completoAbstract (sommario):
Thesis (M.S. in Systems Technology (Command, Control, and Communications))--Naval Postgraduate School, March 1992.Thesis Advisor: Poock, Gary K. "March 1992." Includes bibliographical references (p. 54-55). Also available in print.
47
Kalaiselvi, S. "Checkpointing Algorithms for Parallel Computers". Thesis, Indian Institute of Science, 1997. https://etd.iisc.ac.in/handle/2005/3908.
Testo completoAbstract (sommario):
Checkpointing is a technique widely used in parallel/distributed computers for rollback error recovery. Checkpointing is defined as the coordinated saving of process state information at specified time instances. Checkpoints help in restoring the computation from the latest saved state, in case of failure. In addition to fault recovery, checkpointing has applications in fault detection, distributed debugging and process migration.
Checkpointing in uniprocessor systems is easy due to the fact that there is a single clock and events occur with respect to this clock. There is a clear demarcation of events that happens before a checkpoint and events that happens after a checkpoint. In parallel computers a large number of computers coordinate to solve a single problem. Since there might be multiple streams of execution, checkpoints have to be introduced along all these streams simultaneously. Absence of a global clock necessitates explicit coordination to obtain a consistent global state.
Events occurring in a distributed system, can be ordered partially using Lamport's happens before relation. Lamport's happens before relation ->is a partial ordering relation to identify dependent and concurrent events occurring in a distributed system.
It is defined as follows:
·If two events a and b happen in the same process, and if a happens before b, then a->b
·If a is the sending event of a message and b is the receiving event of the same message then a -> b
·If neither a à b nor b -> a, then a and b are said to be concurrent.
A consistent global state may have concurrent checkpoints. In the first chapter of the thesis we discuss issues regarding ordering of events in a parallel computer, need for coordination among checkpoints and other aspects related to checkpointing. Checkpointing locations can either be identified statically or dynamically. The static approach assumes that a representation of a program to be checkpointed is available with information that enables a programmer to specify the places where checkpoints are to be taken. The dynamic approach identifies the checkpointing locations at run time. In this thesis, we have proposed algorithms for both static and dynamic checkpointing. The main contributions of this thesis are as follows:
1. Parallel computers that are being built now have faster communication and hence more efficient clock synchronisation compared to those built a few years ago. Based on efficient clock synchronisation protocols, the clock drift in current machines can be maintained within a few microseconds. We have proposed a dynamic checkpointing algorithm for parallel computers assuming bounded clock drifts.
2. The shared memory paradigm is convenient for programming while message passing paradigm is easy to scale. Distributed Shared Memory (DSM) systems combine the advantage of both paradigms and can be visualized easily on top of a network of workstations. IEEE has recently proposed an interconnect standard called Scalable Coherent Interface (SCI), to con6gure computers as a Distributed Shared Memory system. A periodic dynamic checkpointing algorithm has been proposed in the thesis for a DSM system which uses the SCI standard.
3. When information about a parallel program is available one can make use of this knowledge to perform efficient checkpointing. A static checkpointing approach based on task graphs is proposed for parallel programs. The proposed task graph based static checkpointing approach has been implemented on a Parallel Virtual Machine (PVM) platform.
We now give a gist of various chapters of the thesis. Chapter 2 of the thesis gives a classification of existing checkpointing algorithms. The chapter surveys algorithm that have been reported in literature for checkpointing parallel/distributed systems. A point to be noted is that most of the algorithms published for checkpointing message passing systems are based on the seminal article by Chandy & Lamport. A large number of checkpointing algorithms have been published by relaxing the assumptions made in the above mentioned article and by extending the features to minimise the overheads of coordination and context saving.
Checkpointing for shared memory systems primarily extend cache coherence protocols to maintain a consistent memory. All of them assume that the main memory is safe for storing the context. Recently algorithms have been published for distributed shared memory systems, which extend the cache coherence protocols used in shared memory systems. They however also include methods for storing the status of distributed memory
in stable storage. Chapter 2 concludes with brief comments on the desirable features of a
checkpointing algorithm.
In Chapter 3, we develop a dynamic checkpointing algorithm for message passing systems assuming that the clock drift of processors in the system is bounded. Efficient clock synchronisation protocols have been implemented on recent parallel computers owing to the fact that communication between processors is very fast. Based on efficient clock synchronisation protocols, clock skew can be limited to a few microseconds. The algorithm proposed in the thesis uses clocks for checkpoint coordination and vector counts for identifying messages to be logged. The algorithm is a periodic, distributed algorithm. We prove correctness of the algorithm and compare it with similar clock based algorithms.
Distributed Shared Memory (DSM) systems provide the benefit of ease of programming in a scalable system. The recently proposed IEEE Scalable Coherent Interface (SCI) standard, facilitates the construction of scalable coherent systems. In Chapter 4 we discuss a checkpointing algorithm for an SCI based DSM system. SCI maintains cache coherence in hardware using a distributed cache directory which scales with the number of processors in the system. SCI recommends a two phase transaction protocol for communication. Our algorithm is a two phase centralised coordinated algorithm. Phase one initiates checkpoints and the checkpointing activity is completed in phase two. The correctness of the algorithm is established theoretically. The chapter concludes with the discussion of the features of SCI exploited by the checkpointing algorithm proposed in the thesis.
In Chapter 5, a static checkpointing algorithm is developed assuming that the program to be executed on a parallel computer is given as a directed acyclic task graph. We assume that the estimates of the time to execute each task in the task graph is given. Given the timing at which checkpoints are to be taken, the algorithm identifies a set of edges where checkpointing tasks can be placed ensuring that they form a consistent global checkpoint. The proposed algorithm eliminates coordination overhead at run time. It significantly reduces the context saving overhead by taking checkpoints along edges of the task graph. The algorithm is used as a preprocessing step before scheduling the tasks to processors. The algorithm complexity is O(km) where m is the number of edges in the graph and k the maximum number of global checkpoints to be taken.
The static algorithm is implemented on a parallel computer with a PVM environment as it is widely available and portable. The task graph of a program can be constructed manually or through program development tools. Our implementation is a collection of preprocessing and run time routines. The preprocessing routines operate on the task graph information to generate a set of edges to be checkpointed for each global checkpoint and write the information on disk. The run time routines save the context along the marked edges. In case of recovery, the recovery algorithms read the information from stable storage and reconstruct the context. The limitation of our static checkpointing algorithm is that it can operate only on deterministic task graphs. To demonstrate the practical feasibility of the proposed approach, case studies of checkpointing some parallel programs are included in the thesis.
We conclude the thesis with a summary of proposed algorithms and possible directions to continue research in the area of checkpointing.
48
Kalaiselvi, S. "Checkpointing Algorithms for Parallel Computers". Thesis, Indian Institute of Science, 1997. http://hdl.handle.net/2005/67.
Testo completoAbstract (sommario):
Checkpointing is a technique widely used in parallel/distributed computers for rollback error recovery. Checkpointing is defined as the coordinated saving of process state information at specified time instances. Checkpoints help in restoring the computation from the latest saved state, in case of failure. In addition to fault recovery, checkpointing has applications in fault detection, distributed debugging and process migration.
Checkpointing in uniprocessor systems is easy due to the fact that there is a single clock and events occur with respect to this clock. There is a clear demarcation of events that happens before a checkpoint and events that happens after a checkpoint. In parallel computers a large number of computers coordinate to solve a single problem. Since there might be multiple streams of execution, checkpoints have to be introduced along all these streams simultaneously. Absence of a global clock necessitates explicit coordination to obtain a consistent global state.
Events occurring in a distributed system, can be ordered partially using Lamport's happens before relation. Lamport's happens before relation ->is a partial ordering relation to identify dependent and concurrent events occurring in a distributed system.
It is defined as follows:
·If two events a and b happen in the same process, and if a happens before b, then a->b
·If a is the sending event of a message and b is the receiving event of the same message then a -> b
·If neither a à b nor b -> a, then a and b are said to be concurrent.
A consistent global state may have concurrent checkpoints. In the first chapter of the thesis we discuss issues regarding ordering of events in a parallel computer, need for coordination among checkpoints and other aspects related to checkpointing. Checkpointing locations can either be identified statically or dynamically. The static approach assumes that a representation of a program to be checkpointed is available with information that enables a programmer to specify the places where checkpoints are to be taken. The dynamic approach identifies the checkpointing locations at run time. In this thesis, we have proposed algorithms for both static and dynamic checkpointing. The main contributions of this thesis are as follows:
1. Parallel computers that are being built now have faster communication and hence more efficient clock synchronisation compared to those built a few years ago. Based on efficient clock synchronisation protocols, the clock drift in current machines can be maintained within a few microseconds. We have proposed a dynamic checkpointing algorithm for parallel computers assuming bounded clock drifts.
2. The shared memory paradigm is convenient for programming while message passing paradigm is easy to scale. Distributed Shared Memory (DSM) systems combine the advantage of both paradigms and can be visualized easily on top of a network of workstations. IEEE has recently proposed an interconnect standard called Scalable Coherent Interface (SCI), to con6gure computers as a Distributed Shared Memory system. A periodic dynamic checkpointing algorithm has been proposed in the thesis for a DSM system which uses the SCI standard.
3. When information about a parallel program is available one can make use of this knowledge to perform efficient checkpointing. A static checkpointing approach based on task graphs is proposed for parallel programs. The proposed task graph based static checkpointing approach has been implemented on a Parallel Virtual Machine (PVM) platform.
We now give a gist of various chapters of the thesis. Chapter 2 of the thesis gives a classification of existing checkpointing algorithms. The chapter surveys algorithm that have been reported in literature for checkpointing parallel/distributed systems. A point to be noted is that most of the algorithms published for checkpointing message passing systems are based on the seminal article by Chandy & Lamport. A large number of checkpointing algorithms have been published by relaxing the assumptions made in the above mentioned article and by extending the features to minimise the overheads of coordination and context saving.
Checkpointing for shared memory systems primarily extend cache coherence protocols to maintain a consistent memory. All of them assume that the main memory is safe for storing the context. Recently algorithms have been published for distributed shared memory systems, which extend the cache coherence protocols used in shared memory systems. They however also include methods for storing the status of distributed memory
in stable storage. Chapter 2 concludes with brief comments on the desirable features of a
checkpointing algorithm.
In Chapter 3, we develop a dynamic checkpointing algorithm for message passing systems assuming that the clock drift of processors in the system is bounded. Efficient clock synchronisation protocols have been implemented on recent parallel computers owing to the fact that communication between processors is very fast. Based on efficient clock synchronisation protocols, clock skew can be limited to a few microseconds. The algorithm proposed in the thesis uses clocks for checkpoint coordination and vector counts for identifying messages to be logged. The algorithm is a periodic, distributed algorithm. We prove correctness of the algorithm and compare it with similar clock based algorithms.
Distributed Shared Memory (DSM) systems provide the benefit of ease of programming in a scalable system. The recently proposed IEEE Scalable Coherent Interface (SCI) standard, facilitates the construction of scalable coherent systems. In Chapter 4 we discuss a checkpointing algorithm for an SCI based DSM system. SCI maintains cache coherence in hardware using a distributed cache directory which scales with the number of processors in the system. SCI recommends a two phase transaction protocol for communication. Our algorithm is a two phase centralised coordinated algorithm. Phase one initiates checkpoints and the checkpointing activity is completed in phase two. The correctness of the algorithm is established theoretically. The chapter concludes with the discussion of the features of SCI exploited by the checkpointing algorithm proposed in the thesis.
In Chapter 5, a static checkpointing algorithm is developed assuming that the program to be executed on a parallel computer is given as a directed acyclic task graph. We assume that the estimates of the time to execute each task in the task graph is given. Given the timing at which checkpoints are to be taken, the algorithm identifies a set of edges where checkpointing tasks can be placed ensuring that they form a consistent global checkpoint. The proposed algorithm eliminates coordination overhead at run time. It significantly reduces the context saving overhead by taking checkpoints along edges of the task graph. The algorithm is used as a preprocessing step before scheduling the tasks to processors. The algorithm complexity is O(km) where m is the number of edges in the graph and k the maximum number of global checkpoints to be taken.
The static algorithm is implemented on a parallel computer with a PVM environment as it is widely available and portable. The task graph of a program can be constructed manually or through program development tools. Our implementation is a collection of preprocessing and run time routines. The preprocessing routines operate on the task graph information to generate a set of edges to be checkpointed for each global checkpoint and write the information on disk. The run time routines save the context along the marked edges. In case of recovery, the recovery algorithms read the information from stable storage and reconstruct the context. The limitation of our static checkpointing algorithm is that it can operate only on deterministic task graphs. To demonstrate the practical feasibility of the proposed approach, case studies of checkpointing some parallel programs are included in the thesis.
We conclude the thesis with a summary of proposed algorithms and possible directions to continue research in the area of checkpointing.
49
Nip, Lai-ming. "Purchase selection of a major computer system in Hong Kong : considerations and marketing implications /". [Hong Kong : University of Hong Kong], 1988. http://sunzi.lib.hku.hk/hkuto/record.jsp?B12361537.
Testo completo
50
Tsang, Currie. "Higher education in information technology & its impacts on a changing urban job market : case study: Hong Kong /". [Hong Kong : University of Hong Kong], 1986. http://sunzi.lib.hku.hk/hkuto/record.jsp?B12324413.
Testo completo