Fukuoka-shi, Japan
Fukuoka-shi, Japan

Cyber University is a private Japanese university. All of its courses are offered online, although it has a physical campus at Fukuoka, Fukuoka Prefecture. The first president of the university is archeologist Sakuji Yoshimura. Wikipedia.

SEARCH FILTERS
Time filter
Source Type

News Article | May 9, 2017
Site: www.prweb.com

Baltimore, Maryland - LifeJourney™ today released its “Cyber University” program that enables two and four year institutions who are focused on cybersecurity education to grow their cybersecurity enrollment by attracting and retaining top students. The LifeJourney NSA Day of Cyber program, an online cybersecurity career exploration platform, has millions of students worldwide. The Cyber University enables students to have a direct connection from the NSA Day of Cyber program to the community colleges and universities that provide the education needed to fill the cyber jobs of the future. Cyber University provides college recruitment departments a real time ability to connect those students, teachers and adult learners interested in a cyber career to their community colleges and universities. Cybersecurity skills has become the most visible and pressing educational issue for our nation, impacting every aspect of our economy from healthcare, mobile, to everyday financial transactions.  It has given birth to a rapidly growing digital jobs market and an unprecedented opportunity for the future generation - the cyber generation. Click here for the recent Forbes article which covers the more than 1 Million job openings in 2016, outlining the opportunity for institutions to dramatically grow their student base. “Our ability to inspire students to pursue the key skills needed to drive our country’s cyber security future is of extreme importance to the nation and to our communities,” stated Rick Geritz, CEO LifeJourney “and we’re pleased to help bridge cyber students and educational organizations on a national scale.” To find out more about LifeJourney’s Cyber University click here for a product brief and contact Kim Paradise - kim(at)lifejourney.us About LifeJourneyLifeJourney ™ is a STEM mentorship technology that enables students to test drive their future by living a day in the life of a nation’s iconic companies and organizations and then experience their career skills journey.


Park Y.,Cyber University | Reeves D.,Cyber University
Proceedings of the 6th International Symposium on Information, Computer and Communications Security, ASIACCS 2011 | Year: 2011

Detection of malicious software (malware) continues to be a problem as hackers devise new ways to evade available methods. The proliferation of malware and malware variants requires methods that are both powerful, and fast to execute. This paper proposes a method to derive the common execution behavior of a family of malware instances. For each instance, a graph is constructed that represents kernel objects and their attributes, based on system call traces. The method combines these graphs to develop a supergraph for the family. This supergraph contains a subgraph, called the HotPath, which is observed during the execution of all the malware instances. The proposed method is scalable, identifies previously-unseen malware instances, shows high malware detection rates, and false positive rates close to 0%. Copyright 2011 ACM.


Von Der Dunk F.G.,Cyber University
Proceedings of the International Astronautical Congress, IAC | Year: 2013

The 2004 Commercial Space Launch Amendments Act provided the first national statute dedicated to private commercial spaceflight, further elaborated by a Chapter in the Code of Federal Regulations. A major element of that regulation concerns the 'informed consent' requirement, which constitutes the main condition upon which a private commercial spaceflight operator is allowed to fly paying passengers into the edge of outer space and back. The requirement as such does not automatically equate with a statutory waiver of passenger liability, which was a major reason for a handful of individual US states to add by way of statutes such immunity from liability in order to attract private commercial spaceflight operators. Notably, this concerns so far Virginia, Florida, New Mexico, Texas, Colorado and California. The present paper summarizes and compares the key provisions of the federal and state statutes on this key issue of (lack of) contractual liability, and addresses some of the issues possibly following from the divergences which inevitably exist between these statutes. ©2013 by the International Astronautical Federation. All rights reserved.


Kamide N.,Cyber University
International Journal of Approximate Reasoning | Year: 2013

It is known that logical systems with the property of paraconsistency can deal with inconsistency-tolerant and uncertainty reasoning more appropriately than systems which are non-paraconsistent. It is also known that the logic BI of bunched implications is useful for formalizing resource-sensitive reasoning. In this paper, a paraconsistent extension PBI of BI is studied. The logic PBI is thus intended to formalize an appropriate combination of inconsistency-tolerant reasoning and resource-sensitive reasoning. A Gentzen-type sequent calculus SPBI for PBI is introduced, and the cut-elimination and decidability theorems for SPBI are proved. An extension of the Grothendieck topological semantics for BI is introduced for PBI, and the completeness theorem with respect to this semantics is proved. © 2012 Elsevier Inc. All rights reserved.


Kamide N.,Cyber University
Theoretical Computer Science | Year: 2013

The logic BI of bunched implications is a combination of intuitionistic logic and multiplicative intuitionistic linear logic. In this paper, a temporal extension tBI of BI is introduced and studied. A Gentzen-type sequent calculus GtBI for tBI is introduced, and the cut-elimination and decidability theorems for GtBI are proved using a theorem for syntactically embedding GtBI into a sequent calculus GBI for BI. A semantics for GtBI is introduced extending the Grothendieck topological semantics for BI, and the completeness theorem with respect to this semantics is proved using a theorem for semantically embedding tBI into BI. A semantics for GtBI without additive falsity constant is introduced extending the Kripke resource semantics for BI without additive falsity constant, and the completeness theorem with respect to this semantics is proved in a similar way. Moreover, an intuitionistic temporal linear logic, ITLL, is introduced as a Gentzen-type sequent calculus, and a theorem for embedding GtBI into ITLL is proved using a temporal extension of the Girard translation of intuitionistic logic into intuitionistic linear logic. © 2013 Elsevier B.V. All rights reserved.


Schaefer M.,Cyber University
Proceedings of the International Astronautical Congress, IAC | Year: 2014

The intersection of insurance markets and liability regimes regarding third-parties and space flight participants (SFPs) in commercial space activities is important because of the potential impact on the development of an industry that is important for national economic and security reasons. Third-parties are those not involved with the space activity while SFPs are those aboard space craft that are not crew. Commercial human space flight is set to begin on a large scale in earnest soon and this will increase the number of launches taking place. The U.S. third-party liability regime is under pressure for change. If the U.S. Congress enacted third-party liability caps, or, alternatively, a long-term extension of the promise of government indemnification for large loss events, this would benefit industry and not impact insurance capacity or prices to any significant degree. However, if the U.S. government revisits its Maximum Probable Loss (MPL) calculation - MPL being the amount that space launch companies are required to obtain in third-party liability insurance - and adjusts it upward, this could have a negative impact on industry. Insurance premium outlays would increase, particularly for sub-orbital companies anticipating significant frequency of launches and that pay higher premium rates due to their lower per launch MPLs, at least until vehicle track records are established and discounted bulk buying is possible. The United States is the only country to date addressing SFP liability issues, but most legislation is at the state-level. U.S. state laws, while seemingly intended to protect space operators from negligence suits, suffer from drafting ambiguities, potential gaps and loopholes, and, collectively, leave an inconsistent patchwork of rules. In spite of the uncertainty, at least one company has begun offering $5 million life and health policies for SFPs, although many of the SFPs in the early stages of the industry will be high-net-worth individuals that may choose to self-insure. A clear federal rule establishing immunity for space operators from negligence suits by SFPs will likely create a more efficient insurance market. A uniform rule placing the liability on industry for SFP death and injuries should be avoided given it would greatly increase the cost of tickets leaving the United States at risk of the nascent industry making future investments in more favorable regulatory jurisdictions. Copyright ©2014 by the International Astronautical Federation. All rights reserved.


Kamide N.,Cyber University
Proceedings of The International Symposium on Multiple-Valued Logic | Year: 2013

Shramko-Wansing's trilattice logics are sixteen-valued logics based on the algebraic structures of trilattices that can suitably represent generalized truth values. In this paper, an alternative new proof of the cut-elimination and completeness theorems for such a trilattice logic is obtained using two embedding theorems. Moreover, the Craig interpolation and Maksimova separation theorems for this logic are proved using the same embedding theorems. The results on Craig interpolation and Maksimova separation are new results of this paper. © 2013 IEEE.


Kamide N.,Cyber University
Proceedings of The International Symposium on Multiple-Valued Logic | Year: 2013

It is known that many-valued paraconsistent logics are useful for expressing uncertain and inconsistency-tolerant reasoning in a wide range of Computer Science. Some four-valued and sixteen-valued paraconsistent logics have especially been well-studied. Some four-valued logics are not so fine-grained, and some sixteen-valued logics are enough fine-grained, but rather complex. In this paper, a natural eight-valued paraconsistent logic in between four-valued and sixteen-valued logics is introduced as a Gentzen-type sequent calculus. A triplet valuation semantics is introduced for this logic, and the completeness theorem for this semantics is proved. The cut-elimination theorem for this logic is proved, and this logic is shown to be decidable. © 2013 IEEE.


Kamide N.,Cyber University
Proceedings - 2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013 | Year: 2013

In this paper, we propose a formal method for modeling and verifying inconsistency-tolerant temporal reasoning with hierarchical information. For this purpose, a temporal logic called sequential paraconsistent computation tree logic (SPCTL) is obtained from the well-known computation tree logic (CTL) by adding a paraconsistent negation connective and some sequence modal operators. SPCTL can appropriately represent both, inconsistency-tolerant reasoning by the paraconsistent negation connective, and hierarchical information by the sequence modal operators. The validity, satisfiability and model-checking problems of SPCTL are shown to be EXPTIMEcomplete, deterministic EXPTIME-complete and deterministic PTIME-complete, respectively. Some new illustrative examples for students' learning processes are presented using SPCTL. © 2013 IEEE.


Kamide N.,Cyber University
International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems | Year: 2014

Verifying and specifying multi-agent systems in an appropriate inconsistency-tolerant logic are of growing importance in Computer Science since computer systems are generally used by or composed of inconsistency-tolerant multi-agents. In this paper, an inconsistency-tolerant logic for representing multi-agents is introduced as a Gentzen-type sequent calculus. This logic (or calculus) has multiple negation connectives that correspond to each agent, and these negation connectives have the property of paraconsistency that guarantees inconsistency-tolerance. The logic proposed is regarded as a modified generalization of trilattice logics, which are known to be useful for expressing fine-grained truth-values in computer networks. The completeness, cut-elimination and decidability theorems for the proposed logic (or sequent calculus) are proved as the main results of this paper. © 2014 World Scientific Publishing Company.

Loading Cyber University collaborators
Loading Cyber University collaborators